A Slightly Improved Bound for the KLS Constant
Functional Analysis
2022-10-10 v2 Data Structures and Algorithms
Probability
Abstract
We refine the recent breakthrough technique of Klartag and Lehec to obtain an improved polylogarithmic bound for the KLS constant.
Cite
@article{arxiv.2208.11644,
title = {A Slightly Improved Bound for the KLS Constant},
author = {Arun Jambulapati and Yin Tat Lee and Santosh S. Vempala},
journal= {arXiv preprint arXiv:2208.11644},
year = {2022}
}
Comments
minor revision fixing typos