Searcharxiv⌕ Search

arXiv subjects

Xiuqiong Chen

Publications and source records attributed to Xiuqiong Chen.

2 recordsLinked to original sources

Neural Operator Approximation for Yau--Yau Nonlinear Filtering: Stability, Approximation, and Fast Computation

Since the introduction of the Kalman filter, nonlinear state estimation has become an important topic in areas such as aerospace engineering, sensor design, and target tracking. Within the optimal filtering framework described by the Duncan-Mortensen-Zakai (DMZ) equation, Yau-Yau filtering (YYF) employs an offline-online decomposition: the Fokker-Planck-Kolmogorov (FKE) equations, initialized by a prescribed set of basis functions, are solved offline, and the prior density is projected onto these basis functions during the online stage. However, this approach still faces two computational challenges: solving multiple FKEs offline can be computationally expensive, and the online projection becomes costly when filtering is performed repeatedly or in high-dimensional settings. To address these limitations, we develop a neural operator filter (NOF) that directly learns the mapping from the prior density to the posterior density, thereby eliminating both the expensive offline FKE solves and the online projection. The underlying operator is approximated using a Fourier neural operator (FNO). Numerical experiments on several challenging filtering systems verify both the effectiveness and accuracy of our method, and we further provide a rigorous theoretical analysis of its stability and approximation error.

math.OC↗

On the Convergence Analysis of Yau-Yau Nonlinear Filtering Algorithm: from a Probabilistic Perspective

At the beginning of this century, a real time solution of the nonlinear filtering problem without memory was proposed in [1, 2] by the third author and his collaborator, and it is later on referred to as Yau-Yau algorithm. During the last two decades, a great many nonlinear filtering algorithms have been put forward and studied based on this framework. In this paper, we will generalize the results in the original works and conduct a novel convergence analysis of Yau-Yau algorithm from a probabilistic perspective. Instead of considering a particular trajectory, we estimate the expectation of the approximation error, and show that commonly-used statistics of the conditional distribution (such as conditional mean and covariance matrix) can be accurately approximated with arbitrary precision by Yau-Yau algorithm, for general nonlinear filtering systems with very liberal assumptions. This novel probabilistic version of convergence analysis is more compatible with the development of modern stochastic control theory, and will provide a more valuable theoretical guidance for practical implementations of Yau-Yau algorithm.

math.OC↗