← Search

Alain Oliviero Durmus

34 accepted papers

2026

Categorical Reparameterization with Denoising Diffusion models

ICML 2026poster

Learning models with categorical variables requires optimizing expectations over discrete distributions, a setting in which stochastic gradient-based optimization is challenging due to the non-differentiability of categorical sampling. A common workaround is to replace the discrete distribution with…

Cited by 0SourceScholar
2026

Diffusion Flow Matching: Dimension-Improved KL Bounds and Wasserstein Guarantees

ICML 2026spotlight

Diffusion Flow Matching (DFM) has recently emerged as a versatile framework for generative modeling, yet its theoretical convergence properties remain only partially understood. In this work, we provide refined and novel convergence guarantees for Brownian motion based DFMs, focusing on the discreti…

Cited by 0SourceScholar
2026

Dynamic Programming for Epistemic Uncertainty in Markov Decision Processes

ICML 2026spotlight

In this paper, we propose a general theory of ambiguity-averse MDPs, which treats the uncertain transition probabilities as random variables and evaluates a policy via a risk measure applied to its random return. This ambiguity-averse MDP framework unifies several models of MDPs with epistemic uncer…

Cited by 0SourceScholar
2026

Efficient Zero-shot Inpainting with Decoupled Diffusion Guidance

ICLR 2026poster

Diffusion models have emerged as powerful priors for image editing tasks such as inpainting and local modification, where the objective is to generate realistic content that remains consistent with observed regions. In particular, zero-shot approaches that leverage a pretrained diffusion model, with…

Cited by 0SourcecodeScholar
2026

Entropic Mirror Monte Carlo

ICML 2026poster

Importance sampling is a Monte Carlo method which designs estimators of expectations under a target distribution using weighted samples from a proposal distribution. When the target distribution is complex, such as multimodal distributions in high-dimensional spaces, the efficiency of importance sam…

Cited by 0SourceScholar
2026

Online Decision-Focused Learning

ICLR 2026poster

Decision-focused learning (DFL) is an increasingly popular paradigm for training predictive models whose outputs are used in decision-making tasks. Instead of merely optimizing for predictive accuracy, DFL trains models to directly minimize the loss associated with downstream decisions. However, exi…

Cited by 0SourceScholar
2026

Tightening the Score Matching Gap for Diffusion Models

ICML 2026poster

Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution. Their training and evaluation primarily rely on an Evidence Lower Bound (ELBO), which relates the Kullback-Leibler (KL) divergence of model samples to the score matching loss along t…

Cited by 0SourceScholar
2025

A Mixture-Based Framework for Guiding Diffusion Models

ICML 2025poster

Denoising diffusion models have driven significant progress in the field of Bayesian inverse problems. Recent approaches use pre-trained diffusion models as priors to solve a wide range of such problems, only leveraging inference-time compute and thereby eliminating the need to retrain task-specific…

2025

Algorithm- and Data-Dependent Generalization Bounds for Diffusion Models

NeurIPS 2025poster

Score-based generative models (SGMs) have emerged as one of the most popular classes of generative models. A substantial body of work now exists on the analysis of SGMs, focusing either on discretization aspects or on their statistical performance. In the latter case, bounds have been derived, under…

Cited by 0SourceScholar
2025

Differential Privacy Guarantees of Markov Chain Monte Carlo Algorithms

ICML 2025poster

This paper aims to provide differential privacy (DP) guarantees for Markov chain Monte Carlo (MCMC) algorithms. In a first part, we establish DP guarantees on samples output by MCMC algorithms as well as Monte Carlo estimators associated with these methods under assumptions on the convergence proper…

Cited by 0SourcePDFScholar
2025

Discrete Markov Probabilistic Models: An Improved Discrete Score-Based Framework with sharp convergence bounds under minimal assumptions

ICML 2025poster

This paper introduces the Discrete Markov Probabilistic Model (DMPM), a novel algorithm for discrete data generation. The algorithm operates in discrete space, where the noising process is a continuous-time Markov chain that can be sampled exactly via a Poissonian clock that flips labels uniformly a…

Cited by 0SourcePDFScholar
2025

Exponential Convergence Guarantees for Iterative Markovian Fitting

NeurIPS 2025poster

The Schrödinger Bridge (SB) problem has become a fundamental tool in computational optimal transport and generative modeling. To address this problem, ideal methods such as Iterative Proportional Fitting and Iterative Markovian Fitting (IMF) have been proposed—alongside practical approximations like…

Cited by 2SourceScholar
2025

Heavy-Tailed Diffusion with Denoising Levy Probabilistic Models

ICLR 2025poster

Investigating noise distributions beyond Gaussian in diffusion generative models remains an open challenge. The Gaussian case has been a large success experimentally and theoretically, admitting a unified stochastic differential equation (SDE) framework, encompassing score-based and denoising formul…

Cited by 0SourcePDFScholar
2025

Learned Reference-based Diffusion Sampler for multi-modal distributions

ICLR 2025poster

Over the past few years, several approaches utilizing score-based diffusion have been proposed to sample from probability distributions, that is without having access to exact samples and relying solely on evaluations of unnormalized densities. The resulting samplers approximate the time-reversal of…

Cited by 0SourcePDFScholar
2025

Non-Asymptotic Analysis Of Data Augmentation For Precision Matrix Estimation

NeurIPS 2025spotlight

This paper addresses the problem of inverse covariance (also known as precision matrix) estimation in high-dimensional settings. Specifically, we focus on two classes of estimators: linear shrinkage estimators with a target proportional to the identity matrix, and estimators derived from data augmen…

Cited by 0SourceScholar
2025

Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson–Romberg Extrapolation

ICLR 2025poster

We address the problem of solving strongly convex and smooth minimization problems using stochastic gradient descent (SGD) algorithm with a constant step size. Previous works suggested to combine the Polyak-Ruppert averaging procedure with the Richardson-Romberg extrapolation to reduce the asymptot…

Cited by 4SourcePDFScholar
2025

Personalized Convolutional Dictionary Learning of Physiological Time Series

AISTATS 2025poster

Human physiological signals tend to exhibit both global and local structures: the former are shared across a population, while the latter reflect inter-individual variability. For instance, kinetic measurements of the gait cycle during locomotion present common characteristics, although idiosyncras…

Cited by 0SourcecodeScholar
2025

Prediction-Aware Learning in Multi-Agent Systems

ICML 2025poster

The framework of uncoupled online learning in multiplayer games has made significant progress in recent years. In particular, the development of time-varying games has considerably expanded its modeling capabilities. However, current regret bounds quickly become vacuous when the game undergoes sign…

Cited by 0SourcePDFScholar
2025

Refined Analysis of Constant Step Size Federated Averaging and Federated Richardson-Romberg Extrapolation

AISTATS 2025poster

In this paper, we present a novel analysis of $\texttt{FedAvg}$ with constant step size, relying on the Markov property of the underlying process. We demonstrate that the global iterates of the algorithm converge to a stationary distribution and analyze its resulting bias and variance relative to th…

Cited by 1SourceScholar
2025

Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Up

ICML 2025poster

This paper proposes a novel analysis for the Scaffold algorithm, a popular method for dealing with data heterogeneity in federated learning. While its convergence in deterministic settings—where local control variates mitigate client drift—is well established, the impact of stochastic gradient updat…

2025

Variational Diffusion Posterior Sampling with Midpoint Guidance

ICLR 2025oral

Diffusion models have recently shown considerable potential in solving Bayesian inverse problems when used as priors. However, sampling from the resulting denoising posterior distributions remains a challenge as it involves intractable terms. To tackle this issue, state-of-the-art approaches formula…

2025

Watermark Anything With Localized Messages

ICLR 2025poster

Image watermarking methods are not tailored to handle small watermarked areas. This restricts applications in real-world scenarios where parts of the image may come from different sources or have been edited. We introduce a deep-learning model for localized image watermarking, dubbed the Watermark A…

2024

$\mathtt{VITS}$ : Variational Inference Thompson Sampling for contextual bandits

ICML 2024poster

In this paper, we introduce and analyze a variant of the Thompson sampling (TS) algorithm for contextual bandits. At each round, traditional TS requires samples from the current posterior distribution, which is usually intractable. To circumvent this issue, approximate inference techniques can be us…

Cited by 3SourcePDFScholar
2024

Differentially Private Representation Learning via Image Captioning

ICML 2024poster

Differentially private (DP) machine learning is considered the gold-standard solution for training a model from sensitive data while still preserving privacy. However, a major barrier to achieving this ideal is its sub-optimal privacy-accuracy trade-off, which is particularly visible in DP represent…

2024

Divide-and-Conquer Posterior Sampling for Denoising Diffusion priors

NeurIPS 2024poster

Recent advancements in solving Bayesian inverse problems have spotlighted denoising diffusion models (DDMs) as effective priors. Although these have great potential, DDM priors yield complex posterior distributions that are challenging to sample from. Existing approaches to posterior sampling in thi…

2024

Incentivized Learning in Principal-Agent Bandit Games

ICML 2024poster

This work considers a repeated principal-agent bandit game, where the principal can only interact with her environment through the agent. The principal and the agent have misaligned objectives and the choice of action is only left to the agent. However, the principal can influence the agent's decisi…

Cited by 7SourcePDFScholar
2024

Learning to Mitigate Externalities: the Coase Theorem with Hindsight Rationality

NeurIPS 2024spotlight

In Economics, the concept of externality refers to any indirect effect resulting from an interaction between players and affecting a third party without compensation. Most of the models within which externality has been studied assume that agents have perfect knowledge of their environment and prefe…

Cited by 2SourcePDFScholar
2024

Piecewise deterministic generative models

NeurIPS 2024poster

We introduce a novel class of generative models based on piecewise deterministic Markov processes (PDMPs), a family of non-diffusive stochastic processes consisting of deterministic motion and random jumps at random times. Similarly to diffusions, such Markov processes admit time reversals that turn…

Cited by 2SourcePDFScholar
2024

Shape analysis for time series

NeurIPS 2024poster

Analyzing inter-individual variability of physiological functions is particularly appealing in medical and biological contexts to describe or quantify health conditions. Such analysis can be done by comparing individuals to a reference one with time series as biomedical data. This paper introduces a…

Cited by 3SourcePDFScholar
2024

Stochastic Localization via Iterative Posterior Sampling

ICML 2024spotlight

Building upon score-based learning, new interest in stochastic localization techniques has recently emerged. In these models, one seeks to noise a sample from the data distribution through a stochastic process, called observation process, and progressively learns a denoiser associated to this dynami…

2024

Theoretical Guarantees for Variational Inference with Fixed-Variance Mixture of Gaussians

ICML 2024poster

Variational inference (VI) is a popular approach in Bayesian inference, that looks for the best approximation of the posterior distribution within a parametric family, minimizing a loss that is (typically) the reverse Kullback-Leibler (KL) divergence. Despite its empirical success, the theoretical p…

Cited by 8SourcePDFScholar
2024

Theoretical guarantees in KL for Diffusion Flow Matching

NeurIPS 2024poster

Flow Matching (FM) (also referred to as stochastic interpolants or rectified flows) stands out as a class of generative models that aims to bridge in finite time the target distribution $\nu^\star$ with an auxiliary distribution $\mu$ leveraging a fixed coupling $\pi$ and a bridge which can either…

Cited by 2SourcePDFScholar
2024

Unravelling in Collaborative Learning

NeurIPS 2024poster

Collaborative learning offers a promising avenue for leveraging decentralized data. However, collaboration in groups of strategic learners is not a given. In this work, we consider strategic agents who wish to train a model together but have sampling distributions of different quality. The collabora…

Cited by 1SourcePDFScholar
2024

Watermarking Makes Language Models Radioactive

NeurIPS 2024spotlight

We investigate the radioactivity of text generated by large language models (LLM), \ie whether it is possible to detect that such synthetic input was used to train a subsequent LLM. Current methods like membership inference or active IP protection either work only in settings where the suspected tex…