Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
From MaRDI portal
(Redirected from Publication:5230366)
Abstract: We give the first rigorous proof of the convergence of Riemannian Hamiltonian Monte Carlo, a general (and practical) method for sampling Gibbs distributions. Our analysis shows that the rate of convergence is bounded in terms of natural smoothness parameters of an associated Riemannian manifold. We then apply the method with the manifold defined by the log barrier function to the problems of (1) uniformly sampling a polytope and (2) computing its volume, the latter by extending Gaussian cooling to the manifold setting. In both cases, the total number of steps needed is O^{*}(mn^{frac{2}{3}}), improving the state of the art. A key ingredient of our analysis is a proof of an analog of the KLS conjecture for Gibbs distributions over manifolds.
Recommendations
- Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics
- Gibbs/Metropolis algorithms on a convex polytope
- Geodesic walks in polytopes
- Fast MCMC sampling algorithms on polytopes
- Random walks in a convex body and an improved volume algorithm
Cited in
(28)- Simulating Coulomb and log-gases with hybrid Monte Carlo algorithms
- Mixing time guarantees for unadjusted Hamiltonian Monte Carlo
- Efficient sampling in spectrahedra and volume approximation
- High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
- Fast MCMC sampling algorithms on polytopes
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Global convergence of stochastic gradient Hamiltonian Monte Carlo for nonconvex stochastic optimization: nonasymptotic performance bounds and momentum-based acceleration
- Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- Optimal convergence rate of Hamiltonian Monte Carlo for strongly logconcave distributions
- On the mixing time of coordinate Hit-and-Run
- Randomized time Riemannian manifold Hamiltonian Monte Carlo
- A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
- Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
- Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices
- The sparseness of g-convex functions
- A splitting Hamiltonian Monte Carlo method for efficient sampling
- Unadjusted Langevin algorithm for non-convex weakly smooth potentials
- Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling
- Novel matrix hit and run for sampling polytopes and its GPU implementation
- High-dimensional nonlinear Bayesian inference of poroelastic fields from pressure data
- In-and-out: algorithmic diffusion for sampling convex bodies
- Geometric algorithms for sampling the flux space of metabolic networks
- Reducing isotropy and volume to KLS: faster rounding and volume algorithms
- Hit-and-run mixing via localization schemes
- Geodesic slice sampling on the sphere
- Space-time divergence lemmas and optimal non-reversible lifts of diffusions on Riemannian manifolds with boundary
This page was built for publication: Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230366)
