Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
From MaRDI portal
Publication:6601372
DOI10.1145/3589505MaRDI QIDQ6601372
Elias P. Tsigaridas, Marios Papachristou, Apostolos Chalkis, Vissarion Fisikopoulos
Publication date: 10 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random sampling: billiard walk algorithm
- A practical volume algorithm
- Some properties of the Hessian of the logarithmic barrier function
- Group truncated ordinal regression
- Slice sampling. (With discussions and rejoinder)
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Inference from iterative simulation using multiple sequences
- Recycling intermediate steps to improve Hamiltonian Monte Carlo
- Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity
- High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
- Proximal Markov chain Monte Carlo algorithms
- On inference for partially observed nonlinear diffusion models using the Metropolis-Hastings algorithm
- A Fast and Well-Conditioned Spectral Method
- Bypassing KLS
- Systems Biology
- A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
- A SIMPLICIAL POLYTOPE THAT MAXIMIZES THE ISOTROPIC CONSTANT MUST BE A SIMPLEX
- Markov Chains and Stochastic Stability
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Practical Polytope Volume Approximation
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Adaptive Rejection Sampling for Gibbs Sampling
- Algorithms for Convex Optimization
- Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics
- Sampling the feasible sets of SDPs and volume approximation
- Equation of State Calculations by Fast Computing Machines
- Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
- Geometric integrators and the Hamiltonian Monte Carlo method
- Blocking Conductance and Mixing in Random Walks
- Theoretical Numerical Analysis
- A Cubic Algorithm for Computing Gaussian Volume
- Simulated Annealing for Convex Optimization
- A General Metric for Riemannian Manifold Hamiltonian Monte Carlo
- Hit-and-Run from a Corner
- Monte Carlo sampling methods using Markov chains and their applications
- Dynamical systems with elastic reflections
- Expansion of the global error for numerical schemes solving stochastic differential equations
- 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