Convergence speed and approximation accuracy of numerical MCMC
From MaRDI portal
Cites work
- A computational framework for infinite-dimensional Bayesian inverse problems. I: The linearized case, with application to global seismic inversion
- A note on geometric ergodicity and floating-point roundoff error
- A Perturbation Theory for Ergodic Markov Chains and Application to Numerical Approximations
- Accelerating parallel tempering: quantile tempering algorithm (QuanTA)
- An introduction to MCMC for machine learning
- Analysis and geometry of Markov diffusion operators
- Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory
- Approximation of Bayesian Inverse Problems for PDEs
- Approximations of geometrically ergodic reversible Markov chains
- Complexity analysis of accelerated MCMC methods for Bayesian inversion
- Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
- Convergence Properties of Perturbed Markov Chains
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- Curvature, concentration and error estimates for Markov chain Monte Carlo
- Explicit error bounds for Markov chain Monte Carlo
- Exponential convergence of Langevin distributions and their discrete approximations
- scientific article; zbMATH DE number 1834589 (Why is no real title available?)
- Inverse problems: a Bayesian perspective
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- Markov chains for exploring posterior distributions. (With discussion)
- Multilevel sequential Monte Carlo with dimension-independent likelihood-informed proposals
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Numerical Methods for Ordinary Differential Equations
- On stationary-point hitting time and ergodicity of stochastic gradient Langevin dynamics
- On the infinite swapping limit for parallel tempering
- On the Markov chain central limit theorem
- Perturbation bounds for Monte Carlo within metropolis via restricted approximations
- Perturbation theory for Markov chains via Wasserstein distance
- Regular Perturbation of V-Geometrically Ergodic Markov Chains
- Replica exchange for non-convex optimization
- Spectral gap of replica exchange Langevin diffusion on mixture distributions
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- Spectral gaps in Wasserstein distances and the 2D stochastic Navier-Stokes equations
- The elements of physical biology.
- Transport map accelerated Markov chain Monte Carlo
- Weight-preserving simulated tempering
This page was built for publication: Convergence speed and approximation accuracy of numerical MCMC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008622)
