π€ AI Summary
This work addresses the instability of conventional Gaussian sum filters and the high computational cost of particle filters in nonlinear or non-Gaussian state-space models by proposing an Augmented Gaussian Sum Filter (AGSF). The method introduces latent variables and tunable covariance parameters to construct a unified framework that enables continuous interpolation and adaptive switching between Gaussian approximation and particle filtering behaviors. By innovatively integrating augmented Gaussian approximation, adaptive mechanisms, and sequential Monte Carlo principles, AGSF dynamically adjusts its approximation strategy based on the local degree of nonlinearity. Experimental results demonstrate that the proposed approach achieves both efficiency and robustness in target tracking tasks, effectively avoiding failure modes of traditional methods, while toy experiments validate the efficacy of its adaptive mechanism.
π Abstract
State-space models (SSMs) are a broad class of probabilistic models for dynamical systems with many applications in engineering and science. Bayesian filtering is analytically tractable only in the linear-Gaussian setting, where the Kalman filter yields exact posterior distributions. For nonlinear or non-Gaussian SSMs, approximations are required. Two prominent families of approximate methods are Gaussian sum filters (GSFs), which rely on local Gaussian approximations and numerical integration schemes, and particle filters (PFs), which use sequential Monte Carlo sampling. Despite their success, GSFs can suffer from numerical instabilities and severe failures in strongly nonlinear regimes, while PFs are flexible and robust but often demand substantial computational resources to achieve accurate estimates. In this work, we propose the Augmented Gaussian Sum Filter (AGSF), a novel filtering framework that unifies GSFs and PFs through an augmented Gaussian approximation parameterized by latent variables and tunable covariance parameters. By adjusting these covariances, the AGSF interpolates continuously between GSF-like and PF-like behavior, recovering both as special cases. Building on this view, we develop an adaptive AGSF that automatically shifts its behavior according to the local nature of the nonlinearities, acting more like a GSF when Gaussian approximations are reliable and more like a PF when they are not. In a target-tracking application, we demonstrate that AGSF is efficient and robust to common failure modes of both GSFs and PFs. We empirically validate the switching behavior of the adaptive mechanism in a toy example.