Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels

DOI10.1007/S11222-014-9521-XMaRDI QIDQ2631344zbMATH OpenOpenAlexFDO

Authors Pierre Alquier, Nial Friel, Richard G. Everitt, Aidan Boland

Publication date 29 July 2016

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.5496, http://centaur.reading.ac.uk/37675/1/noisy_mcmc.pdf

zbMATH Keywords

intractable likelihoodsMarkov chain Monte Carlopseudo-marginal Monte Carlo

Mathematics Subject Classification ID

Convergence of probability measures (60B10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Directional data; spatial statistics (62H11) Monte Carlo methods (65C05)

Abstract: Monte Carlo algorithms often aim to draw from a distribution $pi$ by simulating a Markov chain with transition kernel $P$ such that $pi$ is invariant under $P$. However, there are many situations for which it is impractical or impossible to draw from the transition kernel $P$. For instance, this is the case with massive datasets, where is it prohibitively expensive to calculate the likelihood and is also the case for intractable likelihood models arising from, for example, Gibbs random fields, such as those found in spatial statistics and network analysis. A natural approach in these cases is to replace $P$ by an approximation $hatP$. Using theory from the stability of Markov chains we explore a variety of situations where it is possible to quantify how 'close' the chain given by the transition kernel $hatP$ is to the chain given by $P$. We apply these results to several examples from spatial statistics and network analysis.

Recommendations

• Markov Chain Monte Carlo Algorithms: Theory and Practice
• On nonlinear Markov chain Monte Carlo
• Approximations of geometrically ergodic reversible Markov chains
• Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution
• Stability of noisy Metropolis-Hastings

Cites work

• A Stochastic Approximation Method
• A theory of the learnable
• An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
• Approximate Bayesian computational methods
• Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
• Efficient recursions for general factorisable models
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Exponential convergence of Langevin distributions and their discrete approximations
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• scientific article; zbMATH DE number 3513115 (Why is no real title available?)
• scientific article; zbMATH DE number 1025906 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Langevin diffusions and Metropolis-Hastings algorithms
• Markov chains and stochastic stability
• Recursive computing and simulation-free inference for general factorizable models
• Regular Perturbation of V-Geometrically Ergodic Markov Chains
• Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
• Sensitivity and convergence of uniformly ergodic Markov chains
• Sparse regression learning by aggregation and Langevin Monte-Carlo
• Statistics for high-dimensional data. Methods, theory and applications.
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The pseudo-marginal approach for efficient Monte Carlo computations

Cited in

(65)

• Accelerating pseudo-marginal MCMC using Gaussian processes
• On coupling particle filter trajectories
• A rare event approach to high-dimensional approximate Bayesian computation
• Perturbation theory for Markov chains via Wasserstein distance
• Efficient MCMC for Gibbs random fields using pre-computation
• MEXIT: maximal un-coupling times for stochastic processes
• On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods
• Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlo
• Perturbation bounds for Monte Carlo within metropolis via restricted approximations
• A multilayer exponential random graph modelling approach for weighted networks
• Monte Carlo Markov chains constrained on graphs for a target with disconnected support
• A Bayesian approach to disease clustering using restricted Chinese restaurant processes
• Likelihood-free approximate Gibbs sampling
• Stability of doubly-intractable distributions
• Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization
• Bayesian model selection for high-dimensional Ising models, with applications to educational data
• User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
• Sequential Monte Carlo with transformations
• Subsampling MCMC -- an introduction for the survey statistician
• Informed sub-sampling MCMC: approximate Bayesian inference for large datasets
• Semiparametric Bayesian analysis for longitudinal mixed effects models with non-normal AR(1) errors
• Estimating promotion effects in email marketing using a large-scale cross-classified Bayesian joint model for nested imbalanced data
• The Monte Carlo computation error of transition probabilities
• Noisy Hamiltonian Monte Carlo for Doubly Intractable Distributions
• A Function Emulation Approach for Doubly Intractable Distributions
• Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution
• Stability of noisy Metropolis-Hastings
• Scalable Bayes via barycenter in Wasserstein space
• Bayesian inference in the presence of intractable normalizing functions
• Uncertainty quantification for Markov processes via variational principles and functional inequalities
• Approximations of geometrically ergodic reversible Markov chains
• scientific article; zbMATH DE number 7625191 (Why is no real title available?)
• Distributed Bayesian Inference in Linear Mixed-Effects Models
• Ensemble Kalman methods for high-dimensional hierarchical dynamic space-time models
• Exploiting multi-core architectures for reduced-variance estimation with intractable likelihoods
• Bayesian model comparison with un-normalised likelihoods
• Sequential tests for large-scale learning
• Markov Kernels Local Aggregation for Noise Vanishing Distribution Sampling
• Bayesian computation: a summary of the current state, and samples backwards and forwards
• Multivariate Conway-Maxwell-Poisson Distribution: Sarmanov Method and Doubly Intractable Bayesian Inference
• Distributed computation for marginal likelihood based model choice
• Perturbation and Inverse Problems of Stochastic Matrices
• Robustness of iterated function systems of Lipschitz maps
• An efficient adaptive MCMC algorithm for pseudo-Bayesian quantum tomography
• Bayesian inference, model selection and likelihood estimation using fast rejection sampling: the Conway-Maxwell-Poisson distribution
• An algorithm for distributed Bayesian inference
• A Bayesian multilevel model for populations of networks using exponential-family random graphs
• Computationally efficient inference for latent position network models
• Solving Fredholm integral equations of the second kind via Wasserstein gradient flows
• Perturbation analysis of Markov chain Monte Carlo for graphical models
• Empirical evaluation of normalizing flows in Markov chain Monte Carlo
• Estimation and inference in distributional reinforcement learning
• Energy distance-based subsampling Markov chain Monte Carlo
• A geometric perspective on Bayesian and generalized fiducial inference
• Approximate Gibbs sampler for efficient inference of hierarchical Bayesian models for grouped count data
• Computable bounds for solutions to Poisson's equation and perturbation of Markov kernels
• A survey of Monte Carlo methods for noisy and costly densities with application to reinforcement learning and ABC
• Bayesian exponential random graph modelling of interhospital patient referral networks
• Bayesian analysis of social influence
• Bayesian analysis of exponential random graph models using stochastic gradient Markov chain Monte Carlo
• Speeding up inference of homologous recombination in bacteria
• The clustered Mallows model
• Bayesian hierarchical spatial model for small-area estimation with non-ignorable nonresponses and its application to the NHANES dental caries data
• Optimizing large-scale educational assessment with a ``divide-and-conquer strategy: fast and efficient distributed Bayesian inference in IRT models
• Approximate Bayesian computation using the Fourier integral theorem

This page was built for publication: Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631344)