arXiv Machine Learning

On the Robustness of Langevin Dynamics to Score Function Error

arXiv:2603. 11319v2 Announce Type: replace Abstract: We consider the robustness of score-based generative modeling to errors in the estimate of the score function.

Hugging Face Trending Papers
Aug 6

The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity

We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.

arXiv Machine Learning
Jul 17

The Effect of Stochasticity in Score-Based Diffusion Sampling: a KL Divergence Analysis

arXiv:2506. 11378v3 Announce Type: replace Abstract: Sampling in score-based diffusion models can be performed by solving either a reverse-time stochastic differential equation (SDE) parameterized by an arbitrary stochasticity function or a probability flow ODE, corresponding to setting this stochasticity function to zero.

By Bernardo P. Schaeffer, Ricardo M. S. Rosa, Glauco Valle
arXiv AI
Jun 24

Catastrophic Compositional Generation: Why Vanilla Diffusion Models Fail to Extrapolate

arXiv:2606. 23920v1 Announce Type: cross Abstract: The task of compositional generation involves using a conditional generative model, trained only on a subset of the possible conditions, to produce samples from compositionally-defined target distributions such as a geometric combination of the source distributions.

By Duncan Soiffer, Chandler Squires, Yuan Guan, Jason Hartford, Pradeep Ravikumar