Efficient Random-Walk Methods for Approximating Polytope Volume
arXiv:1312.2873 · doi:10.1145/3194656
Abstract
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the polytope's volume in high dimensions (e.g. one hundred). To carry out this efficiently we experimentally correlate the effect of parameters, such as random walk length and number of sample points, on accuracy and runtime. Moreover, we exploit the problem's geometry by implementing an iterative rounding procedure, computing partial generations of random points and designing fast polytope boundary oracles. Our publicly available code is significantly faster than exact computation and more accurate than existing approximation methods. We provide volume approximations for the Birkhoff polytopes B_11,...,B_15, whereas exact methods have only computed that of B_10.
15 pages, 2 figures, 8 tables, in Proc. of SoCG'14
References in corpus (1)
Cited by in corpus (7)
- Hepp's bound for Feynman graphs and matroids
- Volesti: Volume Approximation and Sampling for Convex Polytopes in R
- Illumination depth
- Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo
- Lower bounds for contingency tables via Lorentzian polynomials
- Randomized geometric tools for anomaly detection in stock markets
- Efficient Sampling from Feasible Sets of SDPs and Volume Approximation