Table of Contents
Fetching ...

Inverse Particle Filter

Himali Singh, Arpan Chattopadhyay, Kumar Vijay Mishra

TL;DR

The paper tackles inverse filtering in counter-adversarial systems, where a defender aims to infer the attacker’s estimate of the defender’s state. It introduces the inverse Particle Filter (I-PF), a global, Monte Carlo-based approach that can handle nonlinear, non-Gaussian dynamics by sampling from the optimal inverse density and applying SIS with resampling. It establishes $L^{4}$-convergence of I-PF to the optimal inverse filter under mild conditions, and extends the framework to unknown system dynamics via differentiable I-PF, enabling learning-based estimation of models and proposals. Numerical experiments across nonlinear, bearing-only, and non-Gaussian settings demonstrate improved estimation performance and credible uncertainty quantification (via RCRLB and NCI) compared to prior inverse filters, with practical considerations for computation time. Overall, the work broadens the applicability of inverse filtering to realistic, non-Gaussian scenarios and provides a pathway for learning-based adaptation when system models are not fully known.

Abstract

In cognitive systems, recent emphasis has been placed on studying the cognitive processes of the subject whose behavior was the primary focus of the system's cognitive response. This approach, known as inverse cognition, arises in counter-adversarial applications and has motivated the development of inverse Bayesian filters. In this context, a cognitive adversary, such as a radar, uses a forward Bayesian filter to track its target of interest. An inverse filter is then employed to infer the adversary's estimate of the target's or defender's state. Previous studies have addressed this inverse filtering problem by introducing methods like the inverse Kalman filter (KF), inverse extended KF, and inverse unscented KF. However, these filters typically assume additive Gaussian noise models and/or rely on local approximations of non-linear dynamics at the state estimates, limiting their practical application. In contrast, this paper adopts a global filtering approach and presents the development of an inverse particle filter (I-PF). The particle filter framework employs Monte Carlo (MC) methods to approximate arbitrary posterior distributions. Moreover, under mild system-level conditions, the proposed I-PF demonstrates convergence to the optimal inverse filter. Additionally, we propose the differentiable I-PF to address scenarios where system information is unknown to the defender. Using the recursive Cramer-Rao lower bound and non-credibility index (NCI), our numerical experiments for different systems demonstrate the estimation performance and time complexity of the proposed filter.

Inverse Particle Filter

TL;DR

The paper tackles inverse filtering in counter-adversarial systems, where a defender aims to infer the attacker’s estimate of the defender’s state. It introduces the inverse Particle Filter (I-PF), a global, Monte Carlo-based approach that can handle nonlinear, non-Gaussian dynamics by sampling from the optimal inverse density and applying SIS with resampling. It establishes -convergence of I-PF to the optimal inverse filter under mild conditions, and extends the framework to unknown system dynamics via differentiable I-PF, enabling learning-based estimation of models and proposals. Numerical experiments across nonlinear, bearing-only, and non-Gaussian settings demonstrate improved estimation performance and credible uncertainty quantification (via RCRLB and NCI) compared to prior inverse filters, with practical considerations for computation time. Overall, the work broadens the applicability of inverse filtering to realistic, non-Gaussian scenarios and provides a pathway for learning-based adaptation when system models are not fully known.

Abstract

In cognitive systems, recent emphasis has been placed on studying the cognitive processes of the subject whose behavior was the primary focus of the system's cognitive response. This approach, known as inverse cognition, arises in counter-adversarial applications and has motivated the development of inverse Bayesian filters. In this context, a cognitive adversary, such as a radar, uses a forward Bayesian filter to track its target of interest. An inverse filter is then employed to infer the adversary's estimate of the target's or defender's state. Previous studies have addressed this inverse filtering problem by introducing methods like the inverse Kalman filter (KF), inverse extended KF, and inverse unscented KF. However, these filters typically assume additive Gaussian noise models and/or rely on local approximations of non-linear dynamics at the state estimates, limiting their practical application. In contrast, this paper adopts a global filtering approach and presents the development of an inverse particle filter (I-PF). The particle filter framework employs Monte Carlo (MC) methods to approximate arbitrary posterior distributions. Moreover, under mild system-level conditions, the proposed I-PF demonstrates convergence to the optimal inverse filter. Additionally, we propose the differentiable I-PF to address scenarios where system information is unknown to the defender. Using the recursive Cramer-Rao lower bound and non-credibility index (NCI), our numerical experiments for different systems demonstrate the estimation performance and time complexity of the proposed filter.
Paper Structure (25 sections, 9 theorems, 63 equations, 5 figures, 4 tables)

This paper contains 25 sections, 9 theorems, 63 equations, 5 figures, 4 tables.

Key Result

Theorem 1

Consider the I-PF developed in Section subsec:ipf formulation (including the modification step). If the assumptions A1-A3 are satisfied, then the following hold: 1) For sufficiently large $N$, the algorithm will not run into an infinite loop in steps $1-2$. 2) For any $\phi$ satisfying A3, there exi where $\|\phi\|_{k,4}\doteq\textrm{max}\{1,\textrm{max}_{\;0\leq s\leq k}\langle\pi_{s|s},|\phi|^{4

Figures (5)

  • Figure 1: Graphical representation of the forward and inverse filters' recursions.
  • Figure 2: Graphical representation of posterior distributions in I-PF.
  • Figure 3: Time-averaged RMSE and RCRLB for (a) forward PF and EKF, and (b) I-PF and I-EKF, including mismatched forward filter cases, for non-linear system example.
  • Figure 4: (a) NCI for forward and inverse filters for non-linear system example; and (b) relative error for forward and inverse PF and EKF for bearing-only tracking system.
  • Figure 5: Time-averaged RMSE for (a) forward filters and inverse filters estimating the forward EKF estimates, and (b) inverse filters estimating the forward UKF and UPF estimates in a non-Gaussian system example.

Theorems & Definitions (22)

  • Remark 1: Threshold $\gamma_{k}$ intuition
  • Remark 2: I-PF's optimal importance density
  • Theorem 1: I-PF convergence
  • proof
  • Corollary 2
  • Remark 3: Dependence on state dimension
  • Remark 4: Bound on $C_{k|k}$
  • Remark 5: Trajectory Function of Time
  • Lemma 1
  • Lemma 2
  • ...and 12 more