Sequentially adaptive Bayesian learning algorithms for inference and optimization

doi:10.1016/j.jeconom.2018.11.002

Return

Sequentially adaptive Bayesian learning algorithms for inference and optimization

2019-05-01

PRE

Geweke, John *

Durham, Garland

DOI：10.1016/j.jeconom.2018.11.002

Original

Original request for help

Save

Abstract

En 中文

The sequentially adaptive Bayesian learning algorithm (SABL) builds on and ties together ideas from sequential Monte Carlo and simulated annealing. The algorithm can be used to simulate from Bayesian posterior distributions, using either data tempering or power tempering, or for optimization. A key feature of SABL is that the introduction of information is adaptive and controlled, ensuring that the algorithm performs reliably and efficiently in a wide variety of applications with off-the-shelf settings, minimizing the need for tedious tuning, tinkering, trial and error by users. The algorithm is pleasingly parallel, and a Matlab toolbox implementing the algorithm is able to make efficient use of massively parallel computing environments such as graphics processing units (GPUs) with minimal user effort. This paper describes the algorithm, provides theoretical foundations, applies the algorithm to Bayesian inference and optimization problems illustrating key properties of its operation, and briefly describes the open source software implementation. (C) 2018 Elsevier B.V. All rights reserved.

Keywords:

Sequential Monte Carlo

Simulated annealing

Posterior simulation

Bayesian learning

Parallel computing

Particle filtering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.