9 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…
Generalization Bounds for Markov Algorithms through Entropy Flow Computations
Benjamin Dupuis, Maxime Haddouche, George Deligiannidis +1
Many learning algorithms can be represented as Markov processes, and understanding their generalization error is a central topic in learning theory. For specific continuous-time no…
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…
Rényi Differential Privacy for Heavy-Tailed SDEs via Fractional Poincaré Inequalities
Benjamin Dupuis, Mert Gürbüzbalaban, Umut ÅimÅekli +3
Characterizing the differential privacy (DP) of learning algorithms has become a major challenge in recent years. In parallel, many studies suggested investigating the behavior of…
Tracking the Median of Gradients with a Stochastic Proximal Point Method
Fabian Schaipp, Guillaume Garrigos, Umut Simsekli +1
There are several applications of stochastic optimization where one can benefit from a robust estimate of the gradient. For example, domains such as distributed learning with corru…