Log-concave sampling: Metropolis-Hastings algorithms are fast
From MaRDI portal
Recommendations
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- The geometry of logconcave functions and sampling algorithms
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
Cites work
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 646825 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- scientific article; zbMATH DE number 5019925 (Why is no real title available?)
- A convex/log-concave correlation inequality for Gaussian measure and an application to abstract Wiener spaces
- A cubic algorithm for computing Gaussian volume
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A tail inequality for quadratic forms of subgaussian random vectors
- Computable bounds for geometric convergence rates of Markov chains
- Convergence of Langevin MCMC in KL-divergence
- Convex optimization: algorithms and complexity
- Coupling and convergence for Hamiltonian Monte Carlo
- Couplings and quantitative contraction rates for Langevin dynamics
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
- Equation of state calculations by fast computing machines
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
- Expansion of the global error for numerical schemes solving stochastic differential equations
- Exponential convergence of Langevin distributions and their discrete approximations
- Fast MCMC sampling algorithms on polytopes
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- General state space Markov chains and MCMC algorithms
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric ergodicity of Metropolis algorithms
- Handbook of Markov Chain Monte Carlo
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Hit-and-Run from a Corner
- Hit-and-run mixes fast
- Isoperimetric problems for convex bodies and a localization lemma
- Langevin diffusions and Metropolis-Hastings algorithms
- Markov Chains and Stochastic Stability
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
- Monte Carlo sampling methods using Markov chains and their applications
- Nonasymptotic mixing of the MALA algorithm
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Optimal scaling for various Metropolis-Hastings algorithms.
- Proximal Markov chain Monte Carlo algorithms
- Random walks in a convex body and an improved volume algorithm
- Randomized interior point methods for sampling and optimization
- Rates of convergence of the Hastings and Metropolis algorithms
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Sampling from log-concave distributions
- The Markov moment problem and de Finetti's theorem. II
- The geometry of logconcave functions and sampling algorithms
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
Cited in
(53)- HMC and underdamped Langevin united in the unadjusted convex smooth case
- Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions
- scientific article; zbMATH DE number 7626720 (Why is no real title available?)
- Finite-sample complexity of sequential Monte Carlo estimators
- scientific article; zbMATH DE number 7370559 (Why is no real title available?)
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Reliable simulation of extremely-truncated log-concave distributions
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
- High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
- Lower bounds on the rate of convergence for accept-reject-based Markov chains in Wasserstein and total variation distances
- Optimal scaling results for Moreau-Yosida Metropolis-adjusted Langevin algorithms
- Normalizing constants of log-concave densities
- Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
- An entropic approach for Hamiltonian Monte Carlo: the idealized case
- Convergence speed and approximation accuracy of numerical MCMC
- Scalable Bayesian computation for crossed and nested hierarchical models
- Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity
- Oracle lower bounds for stochastic gradient sampling algorithms
- Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference
- Mixing of Metropolis-adjusted Markov chains via couplings: the high acceptance regime
- Constrained ensemble Langevin Monte Carlo
- Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models
- Quantum Langevin dynamics for optimization
- Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
- Learning variational autoencoders via MCMC speed measures
- Multielement polynomial chaos kriging-based metamodelling for Bayesian inference of non-smooth systems
- Data-free likelihood-informed dimension reduction of Bayesian inverse problems
- scientific article; zbMATH DE number 7650131 (Why is no real title available?)
- Ensemble Kalman sampler: mean-field limit and convergence analysis
- Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
- Provably Efficient Posterior Sampling for Sparse Linear Regression via Measure Decomposition
- Complexity of zigzag sampling algorithm for strongly log-concave distributions
- Optimal regularization for a data source
- Dimension-free relaxation times of informed MCMC samplers on discrete spaces
- Is there an analog of Nesterov acceleration for gradient-based MCMC?
- Ergodicity of the infinite swapping algorithm at low temperature
- Weak Poincaré inequalities for Markov chains: theory and applications
- Nonasymptotic mixing of the MALA algorithm
- On Irreversible Metropolis Sampling Related to Langevin Dynamics
- Gradient-adjusted underdamped Langevin dynamics for sampling
- Convergence rates of Metropolis-Hastings algorithms
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Adaptive reduced tempering for Bayesian inverse problems and rare event simulation
- Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs
- On the limitations of single-step drift and minorization in Markov chain convergence analysis
- Optimal convergence rate of Hamiltonian Monte Carlo for strongly logconcave distributions
- Complexity results for MCMC derived from quantitative bounds
- On sampling from a log-concave density using kinetic Langevin diffusions
- Tensor train based sampling algorithms for approximating regularized Wasserstein proximal operators
- Laplacian smoothing stochastic gradient Markov chain Monte Carlo
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Analysis of Langevin Monte Carlo from Poincaré to log-Sobolev
- Unadjusted Langevin algorithm for non-convex weakly smooth potentials
This page was built for publication: Log-concave sampling: Metropolis-Hastings algorithms are fast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214293)
