We explore a general truncation scheme for the approximation of (possibly unstable) optimal filters. In particular, let be a state space model defined by a prior distribution , Markov kernels and potential functions , and let be a sequence of compact subsets of the state space. In the first part of the manuscript, we describe a systematic procedure to construct a system , where each potential is truncated to have null value outside the set , such that the optimal filters generated by and can be made arbitrarily close, with approximation errors independent of time . Then, in a second part, we investigate the stability of the approximately-optimal filters. Specifically, given a system with a prescribed prior , we seek sufficient conditions to guarantee that the truncated system (with {\em the same} prior ) generates a sequence of optimal filters which are stable and, at the same time, can attain arbitrarily small approximation errors. Besides the design of approximate filters, the methods and results obtained in this paper can be applied to determine whether a prescribed system yields a sequence of stable filters and to investigate topological properties of classes of optimal filters. As an example of the latter, we explicitly construct a metric space , where is a class of state space systems and is a proper metric on , which contains a dense subset such that every element is a state space system yielding a stable sequence of optimal filters.
View on arXiv