# A Slightly Improved Bound for the KLS Constant

arXiv: https://arxiv.org/abs/2208.11644 · HTML: https://mlsanity.com/paper/2208.11644/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Aug 2022.

## Built on by (most cited first, 10 of 10)

- [The Double-Ellipsoid Geometry of CLIP](https://mlsanity.com/paper/2411.14517/) (2024)
- [Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler](https://mlsanity.com/paper/2302.06085/) (2023)
- [Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis](https://mlsanity.com/paper/2412.11303/) (2024)
- [Joint stochastic localization and applications](https://mlsanity.com/paper/2505.13410/) (2025)
- [Perspectives on Stochastic Localization](https://mlsanity.com/paper/2510.04460/) (2025)
- [Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser](https://mlsanity.com/paper/2305.06541/) (2023)
- [Langevin Dynamics: A Unified Perspective on Optimization via Lyapunov Potentials](https://mlsanity.com/paper/2407.04264/) (2024)
- [Improved generalization bounds for binary linear classification via isoperimetry](https://mlsanity.com/paper/2505.16713/) (2025)
- [Functional Stochastic Localization](https://mlsanity.com/paper/2602.03999/) (2026)
- [On McDiarmid's Inequality under Dependence via Approximate Tensorization of Entropy](https://mlsanity.com/paper/2606.12720/) (2026)

## Abstract (arXiv)

We refine the recent breakthrough technique of Klartag and Lehec to obtain an improved polylogarithmic bound for the KLS constant.