mlsanityData to 14 Oct 2026

A Slightly Improved Bound for the KLS Constant

arXiv 2208.11644 ↗First posted 24 Aug 2022math.FA cs.DS math.PRcited by 10

Not on the map. Why?

Abstract (arXiv)

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

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

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 3; 2026: 2.

10 papers.

  1. 2024The Double-Ellipsoid Geometry of CLIPcited by 42
  2. 2023Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Samplercited by 10
  3. 2024Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysiscited by 2
  4. 2025Joint stochastic localization and applicationscited by 2
  5. 2025Perspectives on Stochastic Localizationcited by 2
  6. 2023Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Busercited by 0
  7. 2024Langevin Dynamics: A Unified Perspective on Optimization via Lyapunov Potentialscited by 0
  8. 2025Improved generalization bounds for binary linear classification via isoperimetrycited by 0
  9. 2026Functional Stochastic Localizationcited by 0
  10. 2026On McDiarmid's Inequality under Dependence via Approximate Tensorization of Entropycited by 0