Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eldan's Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing

Published 5 Dec 2016 in math.FA, cs.CG, cs.DS, math.MG, and math.PR | (1612.01507v3)

Abstract: We show that the Cheeger constant for nn-dimensional isotropic logconcave measures is O(n<sup>1/4)O(n<sup>{1/4}), improving on the previous best bound of O(n<sup>1/3log</sup>n).O(n<sup>{1/3}\sqrt{\log</sup> 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 R<sup>n{\bf R}<sup>{n} converges in O<sup>(n<sup>2.5)O<sup>{*}(n<sup>{2.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 R<sup>n{\bf R}<sup>{n} with support of diameter DD is Ω(1/D)\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 Ω(1/D<sup>2)\Omega(1/D<sup>{2}) by Kannan-Lov\'{a}sz-Montenegro. It follows that for any isotropic logconcave density, the ball walk with step size δ=Θ(1/n)\delta=\Theta(1/\sqrt{n}) mixes in O(n<sup>2D)O\left(n<sup>{2}D\right) proper steps from \emph{any }starting point. This improves on the previous best bound of O(n<sup>2D<sup>2)O(n<sup>{2}D<sup>{2}) and is also asymptotically tight. The new bound leads to the following large deviation inequality for an LL-Lipschitz function gg over an isotropic logconcave density pp: for any $t&gt;0$, [ Pr_{x\sim p}\left(\left|g(x)-\bar{g}\right|\geq L\cdot t\right)\leq\exp(-\frac{c\cdot t{2}}{t+\sqrt{n}}) ] where gˉ\bar{g} is the median or mean of gg for xpx\sim 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.

Citations (92)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.