Ornstein-Uhlenbeck Is Hard to Beat, Yet Superlinear Drift Ships Lower Transport Costs
Not on the map. Why?
Abstract (arXiv)
Brevsar and Mijatovi'c citebresar2025 show that Ornstein--Uhlenbeck diffusion is hard to beat in forward convergence under assumptions that exclude superlinear drift. We instead test superlinear Langevin diffusions for score-based image generation, computing their conditional scores numerically from a Fokker--Planck equation. In our experiments, the superlinear models beat the Ornstein--Uhlenbeck baseline on empirical Wasserstein distance across nearly the entire tested grid and show less variation across diffusion horizons. The ``hard to beat'' verdict of citebresar2025 thus fails to be universal.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 12 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
3 of 12 references.
References · 3
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
Built on by
Not cited yet.