Overview

Chen proves the first subpolynomial-dimensional lower bound for the KLS isoperimetric coefficient (Chen, 2021). For a log-concave density in dimension , the earlier stochastic-localization estimate was in isotropic position. Chen replaces this fixed power by

The result is not a dimension-free proof of KLS: the lower bound still tends to zero. Its significance is that it decays more slowly than for every fixed .

The proof refines Eldan’s stochastic localization in an affine-normalized form. Its main innovation is a bootstrap: any power-law isoperimetric estimate in dimensions at most improves the covariance control along the localization process, and that improved covariance control feeds back into a better isoperimetric exponent. Iterating the feedback loop yields the almost-constant bound.

🏷️ Isoperimetric Preliminaries

Let be a probability density on . For a measurable set , define

The isoperimetric coefficient is

Chen denotes this lower-expansion quantity by . This post uses to remain consistent with on Eldan’s stochastic localization and the KLS conjecture, where denotes the inverse expansion scale.

A density is log-concave if

for all and . Write

The affine form of the KLS conjecture asserts

For an isotropic density, and , so KLS asks for a universal positive lower bound.

Affine Normalization and Hyperplanes

If is positive definite, the whitening map

sends to an isotropic log-concave density. The factor in the affine statement records the largest directional standard deviation before whitening.

For a unit vector and threshold , let

The boundary expansion of is governed by the one-dimensional log-concave marginal , whose expansion scale is its standard deviation. Thus an appropriate half-space has expansion of order . KLS asserts that no arbitrary measurable set has substantially smaller expansion than the best half-space, up to a universal factor. This is the hyperplane formulation.

For log-concave measures, Cheeger expansion and the Poincare constant satisfy

Chen’s theorem can therefore be read either as an isoperimetric lower bound or as a subpolynomial spectral-gap estimate.

Reduction to balanced sets

The isoperimetric profile

is concave for log-concave measures and symmetric under . Consequently, it suffices to control sets with . This is important because stochastic localization only has to keep one balanced set away from masses and .

Gaussian Domination

A density is more log-concave than a Gaussian with precision if

for a convex . Brascamp-Lieb and Gaussian comparison give

Stochastic localization increases deterministically while controlling the random covariance .

Martingale Time Change

For a continuous scalar martingale with , the Dambis-Dubins-Schwarz theorem gives a Brownian motion such that

The reflection principle then yields

This converts control of a martingale’s quadratic variation into control of the probability that it exits an interval.

The original KLS localization argument gives

Lee and Vempala improved this to

Chen’s theorem starts from this stochastic-localization framework but uses its current isoperimetric estimate recursively.

🏷️ Main Theorem

Almost-constant KLS bound

There is a universal constant such that, for every log-concave density on and every integer ,

In particular, for sufficiently large , choosing

gives

For isotropic , the factor disappears. The exponent

tends to zero, which is the meaning of .

Optimization of the Iteration Depth

Ignoring universal constants, the logarithm of the theorem’s denominator is

For the relevant range of ,

Balancing the two contributions gives

and hence

At this choice the total loss is

This calculation also explains why taking arbitrarily large is counterproductive: the explicit term improves, but the accumulated factor worsens.

🏷️ Preconditioned Stochastic Localization

Assume first that has compact support and nonsingular covariance . Chen fixes the preconditioner

and defines

Thus . The localized density is

with mean and covariance

Ito’s formula gives the measure-valued martingale identity

The fixed preconditioner makes the argument affine normalized from the outset. Define the dimensionless covariance process

Since , controlling measures precisely how much the current covariance has grown relative to the initial covariance.

The mean and normalized covariance satisfy

and

where . The martingale part is a normalized third centered moment. The negative drift comes from the bracket

At time , the density is more log-concave than the Gaussian with precision

The comparison Gaussian has covariance , so its largest variance is . Gaussian isoperimetry therefore gives

The remaining problem is to run the process long enough for this lower bound to become useful without allowing the mass of the test set to degenerate.

🏷️ Evolution of a Balanced Set

Fix with and put

Integrating the density SDE over gives

Consequently,

Cauchy-Schwarz implies

and hence

Balanced-mass control

For every ,

The Dambis-Dubins-Schwarz theorem represents as a Brownian motion evaluated at time . If the covariance integral is at most , the martingale has accumulated too little Brownian time to leave except with a fixed small probability.

On the balanced event, Gaussian isoperimetry for gives

Averaging the boundary inequality back to time zero yields

Thus an integrated bound on immediately becomes a lower bound on .

🏷️ Schatten Potential and Two Time Regimes

Directly controlling the largest eigenvalue of is difficult. For an integer , Chen uses the differentiable potential

Since is positive semidefinite,

Write its Ito differential as

For ,

and

Matrix Ito calculus therefore decomposes into

The central tensor estimate controls the positive correction without discarding the stabilizing drift.

Suppose inductively that, in every dimension ,

where

over compactly supported log-concave densities in . Set

The tensor estimates in the paper give

and the crucial two-sided choice of drift bounds

The first estimate contains the inductive isoperimetric hypothesis. It is strongest near the start of the process. The second estimate is independent of and has a singular but decaying coefficient ; it becomes effective after a positive initial time. Using the minimum rather than one estimate globally is the mechanism that extends the useful localization horizon.

The factor is the quantitative gain from the inductive hypothesis. Choosing ensures

The proof obtains this saving from tensor inequalities that bound the third-moment contractions using the assumed lower-dimensional isoperimetric constants. The choice of converts those inequalities into the displayed power saving; the accompanying estimates contribute the factor .

Initial-Time Control

For

Ito’s formula, the first drift bound, and martingale concentration control the maximum of up to

With high probability,

The negative-power transform is useful because large potential values are compressed into a bounded interval while its derivatives counteract the superlinear powers of in the SDE.

Later-Time Control

For

the second drift estimate yields

This permits growth after , but only at a controlled polynomial rate. Combining the two regimes extends the time to

while retaining

The balanced-set lemma then gives a fixed positive probability that remains between and .

🏷️ The Isoperimetric Bootstrap

Substituting into the Gaussian boundary scale gives

Taking the infimum over proves the inductive improvement

Feedback loop

The proof closes the following cycle:

The original KLS estimate supplies the starting exponent . At each round, choosing changes the exponent to

The exponent improves only slightly, and each round introduces factors involving , , and . Careful bookkeeping over the iteration packages the accumulated losses into

which is the parameterized form of the main theorem.

First Bootstrap Round

The initial KLS estimate has exponent

The prescription gives

After one application of the inductive lemma,

Thus the first round replaces by , apart from the new factor involving . This intermediate estimate is still weaker than Lee and Vempala’s separate bound; the example illustrates the internal induction rather than the best bound after one round. Repeated rounds eventually cross the threshold and then produce the subpolynomial exponent. Each round treats its new exponent as input to the next covariance estimate, while the prefactors accumulate.

🏷️ Removal of Compact Support

Compact support ensures standard existence and uniqueness for the localization SDE and uniform control of its coefficients. The final theorem applies to arbitrary log-concave densities by truncation. Intersect the support with expanding Euclidean balls and renormalize:

The densities remain log-concave, their covariance matrices converge to that of , and the relevant boundary estimates pass to the limit through neighborhood approximations. Degenerate covariance is handled by restricting to the affine hull.

🏷️ Consequences and Scope

For isotropic log-concave densities, the theorem gives

Through the known comparison principles among KLS, thin-shell, and slicing constants, this replaces fixed polynomial losses by subpolynomial ones. It likewise yields subpolynomial concentration scales for Lipschitz observables and improved conductance-based bounds for log-concave sampling algorithms.

Meaning of almost constant

The expression does not mean and does not imply a universal positive lower bound. It means that the logarithmic loss is . The result beats every fixed negative power of asymptotically, but it does not prove the dimension-free KLS conjecture.

Technical scope

Compact support is used to construct the SDE with globally controlled coefficients; truncation removes it from the final theorem. Positive-definite covariance is also temporary, since singular measures are treated on their affine hull. The choice involving is intended for sufficiently large , while the theorem parameterized by remains valid in every dimension.

The conceptual advance is broader than the numerical exponent. Earlier localization arguments inserted a Gaussian component and controlled covariance using a fixed collection of moment bounds. Chen makes the current isoperimetric knowledge itself an input to covariance control, creating a self-improving inequality. The two-regime potential estimate prevents this recursion from losing the gain before the Gaussian factor becomes strong enough.

🔗 See Also

📚 References

🐻  Chen, Y. 2021. An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture. Geometric and Functional Analysis 31(1), 34–61.