Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo

Cites Work

MCMC using Hamiltonian dynamics
Random sampling: billiard walk algorithm
Slice sampling. (With discussions and rejoinder)
Inference from iterative simulation using multiple sequences
Title not available (Why is that?)
Markov Chains and Stochastic Stability
Adaptive Rejection Sampling for Gibbs Sampling
Markov chain Monte Carlo. Stochastic simulation for Bayesian inference.
Monte Carlo sampling methods using Markov chains and their applications
Equation of state calculations by fast computing machines
Title not available (Why is that?)
Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
Title not available (Why is that?)
Expansion of the global error for numerical schemes solving stochastic differential equations
Title not available (Why is that?)
Random walks in a convex body and an improved volume algorithm
A random polynomial-time algorithm for approximating the volume of convex bodies
Title not available (Why is that?)
Hit-and-Run from a Corner
Dynamical systems with elastic reflections
On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
A fast and well-conditioned spectral method
Bypassing KLS: Gaussian cooling and an \(O^\ast(n^3)\) volume algorithm
A practical volume algorithm
A randomized cutting plane method with probabilistic geometric convergence
A cubic algorithm for computing Gaussian volume
Systems biology. Constraint-based reconstruction and analysis
Theoretical Numerical Analysis
Simulated Annealing for Convex Optimization
Some properties of the Hessian of the logarithmic barrier function
Practical polytope volume approximation
Blocking Conductance and Mixing in Random Walks
Sampling from a log-concave distribution with projected Langevin Monte Carlo
Group truncated ordinal regression
A SIMPLICIAL POLYTOPE THAT MAXIMIZES THE ISOTROPIC CONSTANT MUST BE A SIMPLEX
Log-concave sampling: Metropolis-Hastings algorithms are fast
A general metric for Riemannian manifold Hamiltonian Monte Carlo
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Proximal Markov chain Monte Carlo algorithms
Geometric integrators and the Hamiltonian Monte Carlo method
Recycling intermediate steps to improve Hamiltonian Monte Carlo
Title not available (Why is that?)
High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity
Hamiltonian Monte Carlo with energy conserving subsampling
Sampling the feasible sets of SDPs and volume approximation
Algorithms for convex optimization
Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics
On the mixing time of coordinate Hit-and-Run

This page was built for publication: Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601372)