Research
Ornstein-Uhlenbeck Is Hard to Beat, Yet Superlinear Drift Ships Lower Transport Costs
arXiv:2609.37579v1 Announce Type: cross Abstract: Bresar and Mijatovic ite{bresar2025} show that Ornstein--Uhlenbeck diffusion is hard to beat in forward convergence under assumptions that exclude sup
arXiv:2609.37579v1 Announce Type: cross Abstract: Bresar and Mijatovic ite{bresar2025} 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 ite{bresar2025} thus fails to be universal.
Related
- Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions
- Score Accuracy Along the Forward Diffusion Does Not Certify Numerical Stability in Diffusion Sampling
- Notes on generative modeling: flow matching, diffusion, optimal transport and Schr{odinger bridge
- Renyi Tracking Bounds for Langevin Dynamics with Moving Targets
Source: arXiv cs.LG | 2026-09-30