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

arXiv: https://arxiv.org/abs/2604.06065 · HTML: https://mlsanity.com/paper/2604.06065/

## Key facts

- Cited by 8 papers in the map (data through 14 Oct 2026).
- Placed in Flow matching, time series and science, one of 14 directions in Diffusion models.
- Builds on 15 of its 35 references that are in the map.
- First posted on arXiv 7 Apr 2026.

## Placed in

- Diffusion models / [Flow matching, time series and science](https://mlsanity.com/diffusion/flow-matching-time-series-and-science/)

## Builds on (most cited first, 15 of 15)

- [Score-Based Generative Modeling through Stochastic Differential Equations](https://mlsanity.com/paper/2011.13456/) (2020)
- [Error Bounds for Flow Matching Methods](https://mlsanity.com/paper/2305.16860/) (2023)
- [Wasserstein Convergence Guarantees for a General Class of Score-Based Generative Models](https://mlsanity.com/paper/2311.11003/) (2023)
- [Convergence Analysis for General Probability Flow ODEs of Diffusion Models in Wasserstein Distances](https://mlsanity.com/paper/2401.17958/) (2024)
- [Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distance](https://mlsanity.com/paper/2501.02298/) (2025)
- [An analysis of the noise schedule for score-based generative models](https://mlsanity.com/paper/2402.04650/) (2024)
- [Convergence of Continuous Normalizing Flows for Learning Probability Distributions](https://mlsanity.com/paper/2404.00551/) (2024)
- [Unraveling the Smoothness Properties of Diffusion Models: A Gaussian Mixture Perspective](https://mlsanity.com/paper/2405.16418/) (2024)
- [Convergence of Deterministic and Stochastic Diffusion-Model Samplers: A Simple Analysis in Wasserstein Distance](https://mlsanity.com/paper/2508.03210/) (2025)
- [Advancing Wasserstein Convergence Analysis of Score-Based Models: Insights from Discretization and Second-Order Acceleration](https://mlsanity.com/paper/2502.04849/) (2025)
- [Wasserstein Convergence of Score-based Generative Models under Semiconvexity and Discontinuous Gradients](https://mlsanity.com/paper/2505.03432/) (2025)
- [Wasserstein Bounds for generative diffusion models with Gaussian tail targets](https://mlsanity.com/paper/2412.11251/) (2024)
- [Assessing the Quality of Denoising Diffusion Models in Wasserstein Distance: Noisy Score and Optimal Bounds](https://mlsanity.com/paper/2506.09681/) (2025)
- [Non-asymptotic error bounds for probability flow ODEs under weak log-concavity](https://mlsanity.com/paper/2510.17608/) (2025)
- [Distribution estimation via Flow Matching with Lipschitz guarantees](https://mlsanity.com/paper/2509.02337/) (2025)

## Built on by (most cited first, 8 of 8)

- [Do Heavy Tails Help Diffusion? On the Subtle Trade-off Between Initialization and Training](https://mlsanity.com/paper/2605.13175/) (2026)
- [Wasserstein bounds for denoising diffusion probabilistic models via the F"ollmer process](https://mlsanity.com/paper/2605.18069/) (2026)
- [Understanding Multimodal Failure in Action-Chunking Behavioral Cloning](https://mlsanity.com/paper/2605.22493/) (2026)
- [Counterfactual Generation via Flow Matching: Coupling-Sensitive End-to-End Rates](https://mlsanity.com/paper/2610.01193/) (2026)
- [Sample complexity bounds for categorical Markov random fields via Discrete Diffusions](https://mlsanity.com/paper/2610.02128/) (2026)
- [Universal Local Error and Realized Amplification for the First-Order EDM Predictor](https://mlsanity.com/paper/2610.10190/) (2026)
- [When do explicit penalties improve flow matching?](https://mlsanity.com/paper/2610.15689/) (2026)
- [Radial Tail Repair: Post-Training Correction for Diffusion and Flow Models](https://mlsanity.com/paper/2610.16851/) (2026)

## Abstract (arXiv)

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 √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.
