Accelerated Dimension-Independent Adaptive Metropolis
DOI10.1137/15M1026432zbMath1352.65029arXiv1506.05741OpenAlexW3100328536MaRDI QIDQ2830629
Yuxin Chen, Hatem Ltaief, Kody J. H. Law, David E. Keyes
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.05741
algorithmconvergencenumerical exampleMarkov chain Monte Carloparallel computationhigh performance computingBayesian inferenceMetropolis-Hastingsbig dataGPU accelerationadaptive Metropolisblas
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust adaptive Metropolis algorithm with coerced acceptance rate
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Equi-energy sampler with applications in statistical inference and statistical mechanics
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- Markov chains and stochastic stability
- On the ergodicity properties of some adaptive MCMC algorithms
- A note on Metropolis-Hastings kernels for general state spaces
- Exponential convergence of Langevin distributions and their discrete approximations
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Inference from iterative simulation using multiple sequences
- Convergence rates of posterior distributions.
- Bayesian learning for neural networks
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Proposals which speed up function-space MCMC
- Dimension-independent likelihood-informed MCMC
- Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Optimal tuning of the hybrid Monte Carlo algorithm
- Efficient parallelisation of Metropolis-Hastings algorithms using a prefetching approach
- A central limit theorem for adaptive and interacting Markov chains
- Componentwise adaptation for high dimensional MCMC
- Efficient MCMC for climate model parameter estimation: parallel adaptive chains and early rejection
- Inverse problems: A Bayesian perspective
- A Stochastic Newton MCMC Method for Large-Scale Statistical Inverse Problems with Application to Seismic Inversion
- Solving large-scale PDE-constrained Bayesian inverse problems with Riemann manifold Hamiltonian Monte Carlo
- Likelihood-informed dimension reduction for nonlinear inverse problems
- Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
- Scaling limits in computational Bayesian inversion
- Large‐Scale Inverse Problems and Quantification of Uncertainty
- Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC
- Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian Approximations
- Sequential Monte Carlo Samplers
- MCMC METHODS FOR DIFFUSION BRIDGES
- Spectral Methods for Uncertainty Quantification
- LAPACK Users' Guide
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Statistical inversion and Monte Carlo sampling methods in electrical impedance tomography
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Robust and Scalable Bayes via a Median of Subset Posterior Measures
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Equation of State Calculations by Fast Computing Machines
- KBLAS
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Monte Carlo sampling methods using Markov chains and their applications
- On Information and Sufficiency
- Stochastic differential equations. An introduction with applications.
- An adaptive Metropolis algorithm
- MCMC methods for functions: modifying old algorithms to make them faster
This page was built for publication: Accelerated Dimension-Independent Adaptive Metropolis