Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 44 min ago
PreprintCC BY 4.0arXiv

Ornstein-Uhlenbeck Is Hard to Beat, Yet Superlinear Drift Ships Lower Transport Costs

Abstract

Brešar and Mijatović \cite{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 \cite{bresar2025} thus fails to be universal.

Related

  1. Fourier-Laplace transforms in polynomial Ornstein-Uhlenbeck volatility models
    Eduardo Abi Jaber, Shaun Xiaoyuan Li, Xuyang Lin
    Finance and StochasticsPeer-reviewedPublisher termsFull textProbabilityHAL
  2. Sharp Logarithmic Sobolev Inequalities for q-Araki-Woods Ornstein-Uhlenbeck Semigroups
    Jinsong Wu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. PSEUDOSPECTRAL PHENOMENA PREVENTING THE ANALYTICITY SECTOR OF A ORNSTEIN-UHLENBECK SEMIGROUP TO BE RULED BY THE SPECTRAL ANGLE OF ITS GENERATOR
    Karel Pravda-Starov
    HALPreprintCC BY 4.0Full textAnalysis & PDEsHALarXiv
  4. Spectral and mapping properties of the inverse Ornstein--Uhlenbeck operator
    Tommaso Bruno, Valentina Casarino, Paolo Ciatti +1
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  5. Maximum likelihood estimation in the ergodic Volterra Ornstein-Uhlenbeck process
    Mohamed Ben Alaya, Martin Friesen, Jonas Kremer
    Stochastic Processes and their ApplicationsPeer-reviewedCC BYStatisticsHAL
BibTeX
@misc{lovas2026ornsteinuhlenbeck,
  title = {{Ornstein-Uhlenbeck Is Hard to Beat, Yet Superlinear Drift Ships Lower Transport Costs}},
  author = {Attila Lovas and Lóránt Nagy},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37579},
  eprint = {2609.37579},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37579},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Ornstein-Uhlenbeck Is Hard to Beat, Yet Superlinear Drift Ships Lower Transport Costs
AU  - Attila Lovas
AU  - Lóránt Nagy
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37579
UR  - https://arxiv.org/abs/2609.37579
AB  - Brešar and Mijatović \cite{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 \cite{bresar2025} thus fails to be universal.
ER  -