Eldan's Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing
Not on the map. Why?
Abstract (arXiv)
We show that the Cheeger constant for n-dimensional isotropic logconcave measures is O(n1/4), improving on the previous best bound of O(n1/3√log n). As corollaries we obtain the same improved bound on the thin-shell estimate, Poincar'e constant and Lipschitz concentration constant and an alternative proof of this bound for the isotropic (slicing) constant; it also follows that the ball walk for sampling from an isotropic logconcave density in bf Rn converges in O*(n2.5) steps from a warm start. The proof is based on gradually transforming any logconcave density to one that has a significant Gaussian factor via a Martingale process. Extending this proof technique, we prove that the log-Sobolev constant of any isotropic logconcave density in bf Rn with support of diameter D is Omega(1/D), resolving a question posed by Frieze and Kannan in 1997. This is asymptotically the best possible estimate and improves on the previous bound of Omega(1/D2) by Kannan-Lov'asz-Montenegro. It follows that for any isotropic logconcave density, the ball walk with step size δ=Theta(1/√n) mixes in Oleft(n2Dright) proper steps from any starting point. This improves on the previous best bound of O(n2D2) and is also asymptotically tight. The new bound leads to the following large deviation inequality for an L-Lipschitz function g over an isotropic logconcave density p: for any t>0, [ Prx~ pleft(left|g(x)-bargright|≥ L· tright)≤exp(-fracc· t2t+√n) ] where barg is the median or mean of g for x~ p; this generalizes and improves on previous bounds by Paouris and by Guedon-Milman. The technique also bounds the ``small ball'' probability in terms of the Cheeger constant, and recovers the current best bound.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Dec 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 3; 2025: 2; 2026: 2.
13 papers.
Sort:
By area:
- 2023Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localizationcited by 230
- 2021A Proximal Algorithm for Sampling from Non-smooth Potentialscited by 23
- 2022A Proximal Algorithm for Samplingcited by 21
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodiescited by 18
- 2021Sampling from Log-Concave Distributions with Infinity-Distance Guaranteescited by 8
- 2022Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlocited by 6
- 2024Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regressioncited by 3
- 2024Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysiscited by 2
- 2025Joint stochastic localization and applicationscited by 2
- 2025Perspectives on Stochastic Localizationcited by 2
- 2026A Mathematical Introduction to Diffusion Modelscited by 1
- 2023Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Busercited by 0
- 2026A Mathematical Introduction to Diffusion Models2 Jul 2026
- 2026On McDiarmid's Inequality under Dependence via Approximate Tensorization of Entropy10 Jun 2026
- 2025Perspectives on Stochastic Localization6 Oct 2025
- 2025Joint stochastic localization and applications19 May 2025
- 2024Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis15 Dec 2024
- 2024Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression11 Dec 2024
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies2 May 2024
- 2023Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localization7 Aug 2023
- 2023Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser11 May 2023
- 2022Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlo21 Oct 2022
- 2022A Proximal Algorithm for Sampling28 Feb 2022
- 2021Sampling from Log-Concave Distributions with Infinity-Distance Guarantees7 Nov 2021
1 more
- 2021A Proximal Algorithm for Sampling from Non-smooth Potentialscited by 23
- 2022A Proximal Algorithm for Samplingcited by 21
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodiescited by 18
- 2021Sampling from Log-Concave Distributions with Infinity-Distance Guaranteescited by 8
- 2022Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlocited by 6
- 2024Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regressioncited by 3
- 2024Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysiscited by 2
- 2025Joint stochastic localization and applicationscited by 2
- 2025Perspectives on Stochastic Localizationcited by 2
- 2023Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Busercited by 0
- 2026On McDiarmid's Inequality under Dependence via Approximate Tensorization of Entropycited by 0
- 2026On McDiarmid's Inequality under Dependence via Approximate Tensorization of Entropy10 Jun 2026
- 2025Perspectives on Stochastic Localization6 Oct 2025
- 2025Joint stochastic localization and applications19 May 2025
- 2024Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis15 Dec 2024
- 2024Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression11 Dec 2024
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies2 May 2024
- 2023Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser11 May 2023
- 2022Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlo21 Oct 2022
- 2022A Proximal Algorithm for Sampling28 Feb 2022
- 2021Sampling from Log-Concave Distributions with Infinity-Distance Guarantees7 Nov 2021
- 2021A Proximal Algorithm for Sampling from Non-smooth Potentials9 Oct 2021