Eldan's stochastic localization and the KLS conjecture: Isoperimetry, concentration and mixing

We show that the Cheeger constant for $n$-dimensional isotropic logconcave measures is $O(n^{1/4})$, improving on the previous best bound of $O(n^{1/3}\sqrt{\log n}).$ As corollaries we obtain the same improved bound on the thin-shell estimate, Poincare 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 R}^{n}$ converges in $O^{*}(n^{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 ${\bf R}^{n}$ 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/D^{2})$ by Kannan-Lovasz-Montenegro. It follows that for any isotropic logconcave density, the ball walk with step size $\delta=\Theta(1/\sqrt{n})$ mixes in $O\left(n^{2}D\right)$ proper steps from \emph{any }starting point. This improves on the previous best bound of $O(n^{2}D^{2})$ 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$, \[ 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 $\bar{g}$ is the median or mean of $g$ for $x\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.

[1]  J. Cheeger A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[2]  M. Gromov,et al.  A topological application of the isoperimetric inequality , 1983 .

[3]  Jean Bourgain,et al.  ON HIGH DIMENSIONAL MAXIMAL FUNCTIONS ASSOCIATED TO CONVEX BODIES , 1986 .

[4]  B. Øksendal Stochastic differential equations : an introduction with applications , 1987 .

[5]  K. Ball Logarithmically concave functions and sections of convex sets in $R^{n}$ , 1988 .

[6]  Miklós Simonovits,et al.  The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  J. Bourgain On the distribution of polynomials on high dimensional convex sets , 1991 .

[8]  Miklós Simonovits,et al.  On the randomized complexity of volume and diameter , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[10]  M. Ledoux A simple analytic proof of an inequality by P. Buser , 1994 .

[11]  Miklós Simonovits,et al.  Isoperimetric problems for convex bodies and a localization lemma , 1995, Discret. Comput. Geom..

[12]  P. Diaconis,et al.  LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[13]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[14]  A. Frieze,et al.  Log-Sobolev inequalities and sampling from log-concave distributions , 1999 .

[15]  M. Ledoux Concentration of measure and logarithmic Sobolev inequalities , 1999 .

[16]  Keith Ball,et al.  The central limit problem for convex bodies , 2003 .

[17]  Sergey G. Bobkov,et al.  On the Central Limit Property of Convex Bodies , 2003 .

[18]  M. Ledoux Spectral gap, logarithmic Sobolev constant, and geometric bounds , 2004 .

[19]  G. Paouris Concentration of mass on convex bodies , 2006 .

[20]  B. Klartag,et al.  Power-law estimates for the central limit theorem for convex sets , 2006, math/0611577.

[21]  László Lovász,et al.  Blocking Conductance and Mixing in Random Walks , 2006, Combinatorics, Probability and Computing.

[22]  Santosh S. Vempala,et al.  Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[23]  B. Klartag On convex perturbations with a bounded isotropic constant , 2006 .

[24]  S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007 .

[25]  S. Bobkov On isoperimetric constants for log-concave probability distributions , 2007 .

[26]  E. Milman On the role of convexity in isoperimetry, spectral gap and concentration , 2007, 0712.4092.

[27]  B. Klartag A central limit theorem for convex sets , 2006, math/0605014.

[28]  B. Fleury,et al.  Concentration in a thin Euclidean shell for log-concave measures , 2010 .

[29]  O. Guédon,et al.  Interpolating Thin-Shell and Sharp Large-Deviation Estimates for Lsotropic Log-Concave Measures , 2010, 1011.0943.

[30]  B. Klartag,et al.  Approximately gaussian marginals and the hyperplane conjecture , 2010, 1001.0875.

[31]  G. Paouris Small ball probability estimates for log-concave measures , 2012 .

[32]  Ronen Eldan,et al.  Thin Shell Implies Spectral Gap Up to Polylog via a Stochastic Localization Scheme , 2012, 1203.0893.

[33]  R. Vershynin,et al.  Covariance estimation for distributions with 2+ε moments , 2011, 1106.2775.

[34]  Ronen Eldan,et al.  Bounding the Norm of a Log-Concave Vector Via Thin-Shell Estimates , 2013, 1306.3696.

[35]  Gábor Lugosi,et al.  Regret in Online Combinatorial Optimization , 2012, Math. Oper. Res..

[36]  Santosh S. Vempala,et al.  A Cubic Algorithm for Computing Gaussian Volume , 2013, SODA.

[37]  James R. Lee,et al.  Talagrand's Convolution Conjecture on Gaussian Space , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[38]  Zeyuan Allen Zhu,et al.  Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates , 2015, STOC.

[39]  Santosh S. Vempala,et al.  Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm , 2015, STOC.

[40]  Yin Tat Lee,et al.  Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[41]  Yin Tat Lee,et al.  Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver , 2015, SODA.

[42]  Yin Tat Lee,et al.  An SDP-based algorithm for linear-sized spectral sparsification , 2017, STOC.

[43]  Santosh S. Vempala,et al.  Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).