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

arXiv stat.ML / 4/8/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper develops a sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model score functions under broad assumptions on the target distribution p⋆, with optimal dependence on time and dimension.
  • It derives Wasserstein discretization bounds for Euler-type samplers, showing that with N steps the sampling error scales as ~√d/N up to logarithmic factors.
  • The authors show that the relevant constants remain stable and do not deteriorate exponentially with the spatial extent of p⋆, improving practical theoretical guarantees.
  • By using one-sided Lipschitz control, the work proves existence of a globally Lipschitz transport map from a standard Gaussian to p⋆, which in turn implies Poincaré and log-Sobolev inequalities for a wide class of measures.

Abstract

Under general assumptions on the target distribution p^\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 d: with N discretization steps, the error achieves the optimal rate \sqrt{d}/N up to logarithmic factors. Moreover, the constants do not deteriorate exponentially with the spatial extent of p^\star. We also show that the one-sided Lipschitz control yields a globally Lipschitz transport map from the standard Gaussian to p^\star, which implies Poincar\'e and log-Sobolev inequalities for a broad class of probability measures.