Can local particle filters beat the curse of dimensionality?

From MaRDI portal
Publication:81243

DOI10.1214/14-AAP1061zbMATH Open1325.60058arXiv1301.6585OpenAlexW1822984620MaRDI QIDQ81243FDOQ81243


Authors: Patrick Rebeschini, Ramon Van Handel, Patrick Rebeschini, Ramon van Handel Edit this on Wikidata


Publication date: 1 October 2015

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

Abstract: The discovery of particle filtering methods has enabled the use of nonlinear filtering in a wide array of applications. Unfortunately, the approximation error of particle filters typically grows exponentially in the dimension of the underlying model. This phenomenon has rendered particle filters of limited use in complex data assimilation problems. In this paper, we argue that it is often possible, at least in principle, to develop local particle filtering algorithms whose approximation error is dimension-free. The key to such developments is the decay of correlations property, which is a spatial counterpart of the much better understood stability property of nonlinear filters. For the simplest possible algorithm of this type, our results provide under suitable assumptions an approximation error bound that is uniform both in time and in the model dimension. More broadly, our results provide a framework for the investigation of filtering problems and algorithms in high dimension.


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




Recommendations




Cites Work


Cited In (59)





This page was built for publication: Can local particle filters beat the curse of dimensionality?

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