English

Lipschitz regularity in Flow Matching and Diffusion Models: sharp sampling rates and functional inequalities

Statistics Theory 2026-04-08 v1 Probability Machine Learning Statistics Theory

Abstract

Under general assumptions on the target distribution pp^\star, we establish a sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores, with optimal dependence on time and dimension. As applications, we obtain Wasserstein discretization bounds for Euler-type samplers in dimension dd: with NN discretization steps, the error achieves the optimal rate d/N\sqrt{d}/N up to logarithmic factors. Moreover, the constants do not deteriorate exponentially with the spatial extent of pp^\star. We also show that the one-sided Lipschitz control yields a globally Lipschitz transport map from the standard Gaussian to pp^\star, which implies Poincar\'e and log-Sobolev inequalities for a broad class of probability measures.

Keywords

Cite

@article{arxiv.2604.06065,
  title  = {Lipschitz regularity in Flow Matching and Diffusion Models: sharp sampling rates and functional inequalities},
  author = {Arthur Stéphanovitch},
  journal= {arXiv preprint arXiv:2604.06065},
  year   = {2026}
}
R2 v1 2026-07-01T11:57:43.491Z