Exponential contractions and robustness for approximate Wonham filters

05/03/2023
by   Samuel N. Cohen, et al.
0

We consider the problem of estimating the state of a continuous-time Markov chain from noisy observations. We show that the corresponding optimal filter is strictly contracting pathwise, when considered in the Hilbert projective space, and give explicit deterministic and pathwise rates of convergence. Using this, we provide alternative proofs of the robustness of optimal filters, improving on known error estimates, and derive rigorous and computable error bounds for approximate filters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2019

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters

The Bloom filter provides fast approximate set membership while using li...
research
06/22/2019

Semi-tractability of optimal stopping problems via a weighted stochastic mesh algorithm

In this article we propose a Weighted Stochastic Mesh (WSM) Algorithm fo...
research
04/04/2018

An Imprecise Probabilistic Estimator for the Transition Rate Matrix of a Continuous-Time Markov Chain

We consider the problem of estimating the transition rate matrix of a co...
research
10/25/2017

New results on approximate Hilbert pairs of wavelet filters with common factors

In this paper, we consider the design of wavelet filters based on the Th...
research
09/15/2018

On stability of a class of filters for non-linear stochastic systems

This article considers stability properties of a broad class of commonly...
research
07/16/2015

Recursive Sparse Point Process Regression with Application to Spectrotemporal Receptive Field Plasticity Analysis

We consider the problem of estimating the sparse time-varying parameter ...
research
07/24/2020

McKean-Vlasov SDEs in nonlinear filtering

Various particle filters have been proposed over the last couple of deca...

Please sign up or login with your details

Forgot password? Click here to reset