Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
Not on the map. Why?
Abstract (arXiv)
We show that the volume of a convex body in ℝn in the general membership oracle model can be computed to within relative error varepsilon using widetildeO(n3.5psi2 + n3/varepsilon2) oracle queries, where psi is the KLS constant. With the current bound of psi=widetildeO(1), this gives an widetildeO(n3.5 + n3/varepsilon2) algorithm, improving on the Lov'asz-Vempala widetildeO(n4/varepsilon2) algorithm from 2003. The main new ingredient is an widetildeO(n3psi2) algorithm for isotropic transformation of a well-rounded convex body; we apply this iteratively to isotropicize a general convex body. Following this, we can apply the widetildeO(n3/varepsilon2) volume algorithm of Cousins and Vempala for well-rounded convex bodies. We also give an efficient implementation of the new algorithm for convex polytopes defined by m inequalities in ℝn: polytope volume can be estimated in time widetildeO(mnc/varepsilon2) where c<3.7 depends on the current matrix multiplication exponent and improves on the previous best bound.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 0; 2026: 6.
9 papers.
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodiescited by 18
- 2024Sampling and Integration of Logconcave Functions by Algorithmic Diffusioncited by 12
- 2024Covariance estimation using Markov chain Monte Carlocited by 2
- 2026Beyond the d2.5-mixing bound for Dikin walks on polytopescited by 1
- 2026The Geometry of Efficient Nonconvex Samplingcited by 0
- 2026Tight Bounds for Learning Polyhedra with a Margincited by 0
- 2026On two proofs of d2 mixing of weighted Dikin walkscited by 0
- 2026Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold startcited by 0
- 2026A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Modelcited by 0
- 2026A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model24 Sep 2026
- 2026Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start14 Sep 2026
- 2026On two proofs of d2 mixing of weighted Dikin walks28 Aug 2026
- 2026Beyond the d2.5-mixing bound for Dikin walks on polytopes15 Jul 2026
- 2026Tight Bounds for Learning Polyhedra with a Margin16 Apr 2026
- 2026The Geometry of Efficient Nonconvex Sampling26 Mar 2026
- 2024Sampling and Integration of Logconcave Functions by Algorithmic Diffusion20 Nov 2024
- 2024Covariance estimation using Markov chain Monte Carlo22 Oct 2024
- 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies2 May 2024