Approximating Bayes in the 21st Century
arXiv:2112.10342 · doi:10.1214/22-STS875
Abstract
The 21st century has seen an enormous growth in the development and use of approximate Bayesian methods. Such methods produce computational solutions to certain intractable statistical problems that challenge exact methods like Markov chain Monte Carlo: for instance, models with unavailable likelihoods, high-dimensional models, and models featuring large data sets. These approximate methods are the subject of this review. The aim is to help new researchers in particular -- and more generally those interested in adopting a Bayesian approach to empirical work -- distinguish between different approximate techniques; understand the sense in which they are approximate; appreciate when and why particular methods are useful; and see the ways in which they can can be combined.
arXiv admin note: text overlap with arXiv:2004.06425
References in corpus (16)
- The pseudo-marginal approach for efficient Monte Carlo computations
- From -entropy to KL-entropy: Analysis of minimum information complexity density estimation
- Approximate Bayesian computation with the Wasserstein distance
- On Markov chain Monte Carlo methods for tall data
- Three discussions of the paper "sequential quasi-Monte Carlo sampling", by M. Gerber and N. Chopin
- Bayesian Indirect Inference Using a Parametric Auxiliary Model
- Gibbs posterior for variable selection in high-dimensional classification and data mining
- astroABC: An Approximate Bayesian Computation Sequential Monte Carlo sampler for cosmological parameter estimation
- Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
- Bayesian nonparametric forecasting of monotonic functional time series
- Fast, Scalable Approximations to Posterior Distributions in Extended Latent Gaussian Models
- Integrated Nested Laplace Approximations (INLA)
- Computing Bayes: From Then 'Til Now'
- Generalized Posteriors in Approximate Bayesian Computation
- Validated Variational Inference via Practical Posterior Error Bounds
- Laplace and Saddlepoint Approximations in High Dimensions