scientific article; zbMATH DE number 7164783
From MaRDI portal
Publication:5214293
zbMath1440.62039arXiv1801.02309MaRDI QIDQ5214293
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1801.02309
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Oracle lower bounds for stochastic gradient sampling algorithms, Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity, Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference, Constrained ensemble Langevin Monte Carlo, Ergodicity of the infinite swapping algorithm at low temperature, Unnamed Item, On sampling from a log-concave density using kinetic Langevin diffusions, On Irreversible Metropolis Sampling Related to Langevin Dynamics, Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs, Multielement polynomial chaos kriging-based metamodelling for Bayesian inference of non-smooth systems, Complexity results for MCMC derived from quantitative bounds, Unnamed Item, Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions, Unnamed Item, Finite-sample complexity of sequential Monte Carlo estimators, Scalable Bayesian computation for crossed and nested hierarchical models, High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion, Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions, On the limitations of single-step drift and minorization in Markov chain convergence analysis, Unnamed Item, Is there an analog of Nesterov acceleration for gradient-based MCMC?, Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates, Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo, Ensemble Kalman Sampler: Mean-field Limit and Convergence Analysis, Data-free likelihood-informed dimension reduction of Bayesian inverse problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized interior point methods for sampling and optimization
- A tail inequality for quadratic forms of subgaussian random vectors
- General state space Markov chains and MCMC algorithms
- Sampling from log-concave distributions
- Computable bounds for geometric convergence rates of Markov chains
- Exponential convergence of Langevin distributions and their discrete approximations
- Langevin diffusions and Metropolis-Hastings algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Geometric ergodicity of Metropolis algorithms
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- The Markov moment problem and de Finetti's theorem. II
- A convex/log-concave correlation inequality for Gaussian measure and an application to abstract Wiener spaces
- Isoperimetric problems for convex bodies and a localization lemma
- Rates of convergence of the Hastings and Metropolis algorithms
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Hit-and-run mixes fast
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Couplings and quantitative contraction rates for Langevin dynamics
- Minimising MCMC variance via diffusion limits, with an application to simulated tempering
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
- Proximal Markov chain Monte Carlo algorithms
- Coupling and convergence for Hamiltonian Monte Carlo
- The geometry of logconcave functions and sampling algorithms
- Handbook of Markov Chain Monte Carlo
- Markov Chains and Stochastic Stability
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau
- Nonasymptotic mixing of the MALA algorithm
- Equation of State Calculations by Fast Computing Machines
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- A Cubic Algorithm for Computing Gaussian Volume
- Hit-and-Run from a Corner
- Monte Carlo sampling methods using Markov chains and their applications
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Expansion of the global error for numerical schemes solving stochastic differential equations
