Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
From MaRDI portal
Publication:6174808
DOI10.1007/s00454-023-00497-xzbMath1526.60042arXiv2009.11338MaRDI QIDQ6174808
Publication date: 17 August 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.11338
Cites Work
- Unnamed Item
- Unnamed Item
- A practical volume algorithm
- Gibbs/Metropolis algorithms on a convex polytope
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Isoperimetric problems for convex bodies and a localization lemma
- Hit-and-run mixes fast
- Hit and run as a unifying device
- Gibbs sampling, conjugate priors and coupling
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Bypassing KLS
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- The geometry of logconcave functions and sampling algorithms
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Random walks in a convex body and an improved volume algorithm
- Random walks and anO*(n5) volume algorithm for convex bodies
- Efficient Random-Walk Methods for Approximating Polytope Volume
- An Upper Bound for Spherical Caps
- Hit-and-Run from a Corner
- On the Computation of Multidimensional Integrals by the Monte-Carlo Method
- An inequality related to the isoperimetric inequality
- On the mixing time of coordinate Hit-and-Run
This page was built for publication: Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
