Corpus ID: 220968699

# Reducing Isotropy and Volume to KLS: An $O(n^3\psi^2)$ Volume Algorithm

@inproceedings{Jia2020ReducingIA,
title={Reducing Isotropy and Volume to KLS: An \$O(n^3\psi^2)\$ Volume Algorithm},
year={2020}
}
We show that the the volume of a convex body in R in the general membership oracle model can be computed with Õ(nψ/ε) oracle queries, where ψ is the KLS constant. With the current bound of ψ . n 1 4 , this gives an Õ(n/ε) algorithm, the first general improvement on the Lovász-Vempala Õ(n/ε) algorithm from 2003. The main new ingredient is an Õ(nψ) algorithm for isotropic transformation, following which we can apply the Õ(n/ε) volume algorithm of Cousins and Vempala for well-rounded convex bodies… Expand

#### References

SHOWING 1-10 OF 25 REFERENCES
Gaussian Cooling and O*(n3) Algorithms for Volume and Gaussian Volume
• Mathematics, Computer Science
• SIAM J. Comput.
• 2018
An randomized algorithm for estimating the volume of a well-rounded convex body given by a membership oracle is presented, improving on the previous best complexity of O^*(n^4) and the KLS conjecture holds. Expand
Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm
• Mathematics, Computer Science
• STOC
• 2015
We present an O*(n3) randomized algorithm for estimating the volume of a well-rounded convex body given by a membership oracle, improving on the previous best complexity of O*(n4). The newExpand
Random Walks in a Convex Body and an Improved Volume Algorithm
• Mathematics, Computer Science
• Random Struct. Algorithms
• 1993
A randomized algorithm using O(n7 log’ n) separation calls to approximate the volume of a convex body with a fixed relative error is given and the mixing rate of Markov chains from finite to arbitrary Markov Chains is analyzed. Expand
Random walks and an O*(n5) volume algorithm for convex bodies
• Computer Science
• Random Struct. Algorithms
• 1997
This work introduces three new ideas: the use of the isotropic position (or at least an approximation of it) for rounding, the separation of global obstructions and local obstructions for fast mixing, and a stepwise interlacing of rounding and sampling. Expand
Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk
• Mathematics, Computer Science
• 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
A novel method of computing polytope membership, where one avoids checking inequalities which are estimated to have a very low probability of being violated is proposed, likely to be of independent interest for constrained sampling and optimization problems. Expand
Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion
• Mathematics, Computer Science
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
It follows that the ball walk for sampling from an isotropic logconcave density in \R^{n} converges in O^{*}(n^{2.5})steps from a warm start, and the same improved bound on the thin-shell estimate, Poincar constant and Lipschitz concentration constant is obtained. Expand
Covariance estimation for distributions with 2+ε moments
• Mathematics
• 2013
We study the minimal sample size N=N(n) that suffices to estimate the covariance matrix of an n-dimensional distribution by the sample covariance matrix in the operator norm, with an arbitrary fixedExpand
Simulated annealing in convex bodies and an O*(n4) volume algorithm
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2006
A new algorithm for computing the volume of a convex body in R^n is presented, improving on the previous best algorithm by a factor of n and using a ''morphing'' technique that can be viewed as a variant of simulated annealing. Expand
The geometry of logconcave functions and sampling algorithms
• Computer Science
• Random Struct. Algorithms
• 2007
Borders match previous bounds for the special case when the distribution to sample from is the uniform distribution over a convex body, with no assumptions on the local smoothness of the density function. Expand
Isoperimetric problems for convex bodies and a localization lemma
• Computer Science, Mathematics
• Discret. Comput. Geom.
• 1995
This lemma is a general “Localization Lemma” that reduces integral inequalities over then-dimensional space to integral inequalities in a single variable and is illustrated by showing how a number of well-known results can be proved using it. Expand