6 papers · 1 filter
Tightening the Score Matching Gap for Diffusion Models
Benjamin Dupuis, Tyler Farghly, Maxime Haddouche +2
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 Lo…
Benign Overfitting Does Not Occur in Diffusion Models
Tyler Farghly, Benjamin Dupuis, Alain Durmus +1
Benign overfitting and double descent have come to shape our understanding of generalization in deep learning, establishing that overfitting is not only compatible with good genera…
Algorithm- and Data-Dependent Generalization Bounds for Diffusion Models
Benjamin Dupuis, Dario Shariatian, Maxime Haddouche +2
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 e…
Differential privacy guarantees of Markov chain Monte Carlo algorithms
Andrea Bertazzi, Tim Johnston, Gareth O. Roberts +1
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 MCM…
Piecewise deterministic generative models
Andrea Bertazzi, Dario Shariatian, Umut Simsekli +2
We introduce a novel class of generative models based on piecewise deterministic Markov processes (PDMPs), a family of non-diffusive stochastic processes consisting of deterministi…
Implicit Bias in Noisy-SGD: With Applications to Differentially Private Training
Tom Sander, Maxime Sylvestre, Alain Durmus
Training Deep Neural Networks (DNNs) with small batches using Stochastic Gradient Descent (SGD) yields superior test performance compared to larger batches. The specific noise stru…