arXiv Statistics ML By Zhifeng Chen, Chenyang Jiang, Yazhen Wang

First-Order Stationarity of Reverse Diffusions

Read the original on arXiv Statistics ML →

The paper establishes a first‑order theoretical framework for diffusion models, showing that SDE‑based reverse‑time flows of both overdamped and underdamped Langevin diffusions contract relative Fisher divergences at explicit exponential rates when the stationary potential of the forward process is strongly convex. It further incorporates discretization to provide averaged first‑order stationarity bounds—sampling analogues of averaged gradient‑norm guarantees in nonconvex optimization—for samplers of both diffusion models. These results highlight a unique advantage of SDE‑based reverse diffusion over ODE‑based approaches, offering local convexity‑free certificates that ensure score consistency rather than global mode weights.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Aug 27

Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling

The paper introduces Hessian-free high-resolution (HFHR) dynamics, an extension of underdamped Langevin dynamics that incorporates reversible position diffusion for sampling in machine learning. It provides an explicit quantitative contraction rate under a position Poincaré inequality, weighted Hessian and Laplacian bounds, and a compact Sobolev embedding, even when the potential is non‑convex. For the HFHR Monte Carlo algorithm, a path‑space Girsanov argument yields a non‑asymptotic convergence bound and an explicit iteration complexity in total variation distance, improving on previous HFHR results and demonstrating benefits of a positive diffusion parameter through numerical experiments.

By Wujun Lv, Xiaoyu Wang, Yingli Wang, Lingjiong Zhu
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.