arXiv (All)
open access
Ornstein-Uhlenbeck Is Hard to Beat, Yet Superlinear Drift Ships Lower Transport Costs
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 fro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the computational cost of Stochastic Gradient Langevin Dynamics#1011473
- A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New#1034510
- The Mechanics of Delta Learning: Target Design for Generalizable Scientific Machine Learning#1076438
- Generalized Forcing Method: Generation of Diverse Data for Training Linear Transport PDE Closure Models#973200
- Sharp hypocoercive convergence estimates for underdamped Langevin dynamics with specular reflection#1110314
Record · ID 1141896
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive