This paper is concerned with a general filtering scheme of a continuous-time dynamic system in which the state is not completely observable. The observation process consists of a function of the state with additive noise. Typically, such noise is assumed to be non-degenerate. In this case, various filtering schemes can be developed. For example, in a linear case, the Kalman–Bucy (KB) filter applies and leads to a recursive filtering equation for the conditional expectation of the state given the observation up to time t. Nevertheless, in applications, only some state variables are directly observable and the rest are not. This gives rise to filtering with degenerate observation noise. In this case, traditional filtering schemes fail. This paper develops a viable scheme to address possible degenerate observation noise. In this paper, we propose a recursive filtering equation in which the gain matrix is a matrix-valued parameter to be determined. We adopt the Monte Carlo training procedure used for deep filtering to determine the best gain matrix. In particular, given the state and observation equations, we generate their Monte Carlo samples. Given a gain matrix, we generate the corresponding state estimation samples, which leads to the error function of the state and its estimation. The problem is to choose the gain matrix to minimize the error function. We develop a stochastic approximation method for such a minimization task; we term the procedure the SA filter, where SA stands for stochastic approximation. We focus on computational experiments and demonstrate the performance of the SA filter and its robustness. We also compare the SA filter with the (extended) Kalman–Bucy filter and the deep filter in both linear and nonlinear models.
Read full abstract