A transport approach to the cutoff phenomenon
Not on the map. Why?
Abstract (arXiv)
Substantial progress has recently been made in the understanding of the cutoff phenomenon for Markov processes, using an information-theoretic statistics known as varentropy [Sal23; Sal24; Sal25a; PS25]. In the present paper, we propose an alternative approach which bypasses the use of varentropy and exploits instead a new W-TV transport inequality, combined with a classical parabolic regularization estimate [BGL01; OV01]. While currently restricted to non-negatively curved processes on smooth spaces, our argument no longer requires the chain rule, nor any approximate version thereof. As applications, we recover the main result of [Sal25a] establishing cutoff for the log-concave Langevin dynamics, and extend the conclusion to a widely-used discrete-time sampling algorithm known as the Proximal Sampler.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 22 references that are in the map. First posted on arXiv 10 Sep 2025.
Builds on
6 of 22 references.
References · 6
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
- 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 86
- 2022Improved analysis for a proximal algorithm for samplingcited by 73
- 2023Improved dimension dependence of a proximal algorithm for samplingcited by 30
- 2025Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequalitycited by 12
- 2024Fast Convergence of Phi-Divergence Along the Unadjusted Langevin Algorithm and Proximal Samplercited by 11
Built on by
Not cited yet.