Controlled sequential Monte Carlo

From MaRDI portal
Publication:2215764

DOI10.1214/19-AOS1914zbMATH Open1455.62162arXiv1708.08396OpenAlexW3087215779MaRDI QIDQ2215764FDOQ2215764


Authors: Jeremy Heng, Adrian N. Bishop, George Deligiannidis, Arnaud Doucet Edit this on Wikidata


Publication date: 14 December 2020

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Sequential Monte Carlo methods, also known as particle methods, are a popular set of techniques for approximating high-dimensional probability distributions and their normalizing constants. These methods have found numerous applications in statistics and related fields; e.g. for inference in non-linear non-Gaussian state space models, and in complex static models. Like many Monte Carlo sampling schemes, they rely on proposal distributions which crucially impact their performance. We introduce here a class of controlled sequential Monte Carlo algorithms, where the proposal distributions are determined by approximating the solution to an associated optimal control problem using an iterative scheme. This method builds upon a number of existing algorithms in econometrics, physics, and statistics for inference in state space models, and generalizes these methods so as to accommodate complex static models. We provide a theoretical analysis concerning the fluctuation and stability of this methodology that also provides insight into the properties of related algorithms. We demonstrate significant gains over state-of-the-art methods at a fixed computational complexity on a variety of applications.


Full work available at URL: https://arxiv.org/abs/1708.08396




Recommendations




Cites Work


Cited In (18)





This page was built for publication: Controlled sequential Monte Carlo

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