Bayesian computation: a perspective on the current state, and sampling backwards and forwards
arXiv:1502.01148
Abstract
The past decades have seen enormous improvements in computational inference based on statistical models, with continual enhancement in a wide range of computational tools, in competition. In Bayesian inference, first and foremost, MCMC techniques continue to evolve, moving from random walk proposals to Langevin drift, to Hamiltonian Monte Carlo, and so on, with both theoretical and algorithmic inputs opening wider access to practitioners. However, this impressive evolution in capacity is confronted by an even steeper increase in the complexity of the models and datasets to be addressed. The difficulties of modelling and then handling ever more complex datasets most likely call for a new type of tool for computational inference that dramatically reduce the dimension and size of the raw data while capturing its essential aspects. Approximate models and algorithms may thus be at the core of the next computational revolution.
30 pages (incl. 8 pages of references), 5 figures
References in corpus (12)
- Approximate Bayesian computation scheme for parameter inference and model selection in dynamical systems
- Expectation Propagation for approximate Bayesian inference
- Inferring population history with DIYABC: a user-friendly approach to Approximate Bayesian Computation
- A General Framework for the Parametrization of Hierarchical Models
- Convex Optimization for Big Data
- MCMC for doubly-intractable distributions
- Optimal scalings for local Metropolis--Hastings chains on nonproduct targets in high dimensions
- Optimizing The Integrator Step Size for Hamiltonian Monte Carlo
- Bayesian Computation and Model Selection in Population Genetics
- Unbiased Bayes for Big Data: Paths of Partial Posteriors
- Individual adaptation: an adaptive MCMC scheme for variable selection problems
- Stability of Noisy Metropolis-Hastings