Table of Contents
Fetching ...

Error Estimates of the Gain Approximation by Hermite-Galerkin Method in Feedback Particle Filter

Ruoyu Wang, Peng Sun, Xue Luo

Abstract

The feedback particle filter (FPF) is a promising nonlinear filtering (NLF) method, but its practical implementation is hindered by the intractability of the gain function, which satisfies a boundary value problem (BVP). This paper proposes a novel two-step Hermite-Galerkin spectral method to address this challenge. First, the unknown density in the BVP is approximated by a kernel density estimator, whose error bounds are well-established in the literature. Second, rather than directly approximating the gain function, we approximate an auxiliary variable via the Galerkin spectral method using generalized Hermite functions. This auxiliary variable inherits the rapid decay property of the density at infinity, which aligns perfectly with the exponential decay characteristic of generalized Hermite functions, thereby obviating the need for artificial boundary conditions or domain truncation. Furthermore, we rigorously establish two fundamental error estimates: the kernel approximation error decays at the rate $O(N_p^{-\frac{s}{2s+1}})$, while the spectral approximation error converges at $O(M^{-s+1}\log M)$, providing complete theoretical guarantees for the method's accuracy. Comprehensive numerical experiments validate the theoretical results and demonstrate that the proposed method outperforms existing gain approximation schemes in both accuracy and computational efficiency.

Error Estimates of the Gain Approximation by Hermite-Galerkin Method in Feedback Particle Filter

Abstract

The feedback particle filter (FPF) is a promising nonlinear filtering (NLF) method, but its practical implementation is hindered by the intractability of the gain function, which satisfies a boundary value problem (BVP). This paper proposes a novel two-step Hermite-Galerkin spectral method to address this challenge. First, the unknown density in the BVP is approximated by a kernel density estimator, whose error bounds are well-established in the literature. Second, rather than directly approximating the gain function, we approximate an auxiliary variable via the Galerkin spectral method using generalized Hermite functions. This auxiliary variable inherits the rapid decay property of the density at infinity, which aligns perfectly with the exponential decay characteristic of generalized Hermite functions, thereby obviating the need for artificial boundary conditions or domain truncation. Furthermore, we rigorously establish two fundamental error estimates: the kernel approximation error decays at the rate , while the spectral approximation error converges at , providing complete theoretical guarantees for the method's accuracy. Comprehensive numerical experiments validate the theoretical results and demonstrate that the proposed method outperforms existing gain approximation schemes in both accuracy and computational efficiency.

Paper Structure

This paper contains 16 sections, 5 theorems, 56 equations, 4 figures, 1 table, 1 algorithm.

Key Result

Lemma B.1

Let $f\in H^r(\mathbb{R})$ with $r\ge 0$ and $0\le \mu \le r$. Then for some constant $C=C(\mu,r)>0$ that is independent of $M$. $\blacktriangleleft$$\blacktriangleleft$

Figures (4)

  • Figure D1: Comparison of the exact solution and its approximations by Hermite-Galerkin method with $M = 1,4$ and $7$.
  • Figure D2: The log-log plot of the error estimates of the gain function approximated by the Hermite-Galerkin method. Top: the $\log(L^2)$-error v.s. $\log M$; Bottom: the $\log(L^1)$-error v.s. $\log N_p$.
  • Figure D3: The estimations of the true state (black) obtained by the FPF with the Hermite-Galerkin spectral method (red), the kernel-based approach (yellow) and the constant-gain approximation (blue), respectively.
  • Figure D4: The RMSEs of each MC run of the three FPFs.

Theorems & Definitions (11)

  • Lemma B.1: Projection Error
  • Lemma B.2: Theorem 1.3, T:09
  • Lemma B.3: Squared $L^1$-error bound
  • Theorem C.1
  • proof
  • Theorem C.2
  • proof
  • Example D.1: Section III, TM:16
  • Example D.2
  • Example D.3: Section V.B, YMM:13
  • ...and 1 more