Allerton 2015 Paper Abstract


Paper ThC5.1

Kalogerias, Dionysios (Rutgers, The State University of New Jersey), Petropulu, Athina (Rutgers University)

On Pathwise Convergence of Particle & Grid Based Nonlinear Filters: Feller VS Conditional Regularity

Scheduled for presentation during the Regular Session "Detection and Estimation" (ThC5), Thursday, October 1, 2015, 13:30−13:50, Lower Level

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on August 4, 2020

Keywords Detection and Estimation, Stochastic Systems and Control


We present a theoretical comparison of the state-of-the-art sufficient conditions required for pathwise (almost sure type of) convergence between grid based and particle approximate filters, as well as discuss the implications of these conditions on the specific mode of convergence achieved. Focusing on general Markov processes observed in conditionally Gaussian noise, we have recently shown that a sufficient condition for pathwise convergence of grid based filters is conditional regularity of stochastic kernels. The respective condition for almost sure convergence of particle filters is the well known Feller property. While our analysis shows that the comparison between the aforementioned conditions may be indeed inconclusive, we identify a large class of systems for which conditional regularity may hold true, whereas the Feller property cannot. This is achieved through a structural analysis of both sufficient conditions. This work can be summarized in that there provably exist system classes supported by either grid based or particle filtering approximations, but not necessarily by both; for systems supported by both, grid based filters exhibit a theoretical advantage in terms of convergence robustness.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-08-04  07:39:10 PST  Terms of use