An elementary analysis of a procedure for sampling points in a convex body

@article{Bubley1998AnEA,
title={An elementary analysis of a procedure for sampling points in a convex body},
author={Russ Bubley and Martin E. Dyer and Mark Jerrum},
journal={Random Struct. Algorithms},
year={1998},
volume={12},
pages={213-235}
}
• Published 1 May 1998
• Mathematics
• Random Struct. Algorithms
In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approaches have been based on estimating conductance via isoperimetric inequalities. We show that a more elementary coupling argument can be used to give a similar result. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 213–235, 1998

Figures from this paper

A Cubic Algorithm for Computing Gaussian Volume
• Computer Science, Mathematics
SODA
• 2014
Improvement comes from several aspects: better isoperimetry, smoother annealing, avoiding transformation to isotropic position and the use of the "speedy walk" in the analysis.
How to compute the volume in high dimension?
This paper is an introduction to the field of randomized polynomial approximation for the volume of a convex body K⊆ℝn, given by a membership oracle, and also a survey of the area.
Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm
• Mathematics, Computer Science
• 2015
For both constant and decreasing step sizes in the Euler discretization, non-asymptotic bounds for the convergence to the target distribution $\pi$ in total variation distance are obtained.
Surveys in Combinatorics, 1999: Random Walks on Combinatorial Objects
• Mathematics
• 1999
Approximate sampling from combinatorially-defined sets, using the Markov chain Monte Carlo method, is discussed from the perspective of combinatorial algorithms. We also examine the associated
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.
NONASYMPTOTIC CONVERGENCE ANALYSIS FOR THE UNADJUSTED LANGEVIN ALGORITHM1
For both constant and decreasing step sizes in the Euler discretization, nonasymptotic bounds are obtained for the convergence to the target distribution π in total variation distance and improve and extend the results of Dalalyan.
Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm
• 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 new
Variable length path coupling
• Mathematics
SODA '04
• 2004
The authors' main theorem is a generalization of the path coupling theorem of Bubley and Dyer, allowing the defining partial couplings to have length determined by a random stopping time, and can produce multi-step (non-Markovian) couplings.
High dimensional Markov chain Monte Carlo methods : theory, methods and applications
The analysis of Markov Chain Monte Carlo (MCMC) methods and the development of new methodologies to sample from a high dimensional distribution and new Metropolis-Hastings type algorithms which have a better optimal scaling compared the MALA algorithm are studied.
Hit-and-run from a corner
• Mathematics
STOC '04
• 2004
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, the ball walk can

References

SHOWING 1-10 OF 12 REFERENCES
Computing the volume of convex bodies : a case where randomness provably helps
• M. Dyer
• Computer Science, Mathematics
• 1991
The problem of computing the volume of a convex body K in R is discussed and worst-case results are reviewed and randomised approximation algorithms which show that with randomisation one can approximate very nicely are provided.
Approximating the Permanent
• Mathematics
SIAM J. Comput.
• 1989
A randomised approximation scheme for the permanent of a 0–1s presented, demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely c...
Sampling and integration of near log-concave functions
• Computer Science
STOC '91
• 1991
This work provides the first polynomial time algorithm to generate samples from a given log-concave distribution and proves a general isoperimetric inequality for convex sets and uses this together with recent developments in the theory of rapidly mixing Markov chains.
Markov chains and polynomial time algorithms
• R. Kannan
• Mathematics, Computer Science
Proceedings 35th Annual Symposium on Foundations of Computer Science
• 1994
This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial
Random walks on finite groups and rapidly mixing markov chains
© Springer-Verlag, Berlin Heidelberg New York, 1983, tous droits reserves. L’acces aux archives du seminaire de probabilites (Strasbourg) (http://www-irma. u-strasbg.fr/irma/semproba/index.shtml),
Lectures on the Coupling Method
Preliminaries Discrete Theory Continuous Theory Inequalities Intensity-Governed Processes Diffusions Appendix Frequently Used Notation References Index.
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
• Mathematics
WG
• 1987
The general techniques of the paper are used to derive an almost uniform generation procedure for labelled graphs with a given degree sequence which is valid over a much wider range of degrees than previous methods: this in turn leads to randomised approximate counting algorithms for these graphs with very good asymptotic behaviour.
A random polynomial-time algorithm for approximating the volume of convex bodies
• Mathematics
JACM
• 1989
The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within K within Euclidean space.