Counter-Adversarial Learning with Inverse Unscented Kalman Filter

• URL: http://arxiv.org/abs/2210.00359v2
• Date: Fri, 24 Mar 2023 09:08:56 GMT
• Title: Counter-Adversarial Learning with Inverse Unscented Kalman Filter
• Authors: Himali Singh, Kumar Vijay Mishra and Arpan Chattopadhyay
• Abstract summary: In counter-adversarial systems, to infer the strategy of an intelligent adversarial agent, the defender agent needs to cognitively sense the information that the adversary has gathered about the latter. We formulate inverse cognition as a nonlinear Gaussian state-space model. We then derive theoretical guarantees for the stability of IUKF in the mean-squared boundedness sense.
• Score: 18.244578289687123
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In counter-adversarial systems, to infer the strategy of an intelligent adversarial agent, the defender agent needs to cognitively sense the information that the adversary has gathered about the latter. Prior works on the problem employ linear Gaussian state-space models and solve this inverse cognition problem by designing inverse stochastic filters. However, in practice, counter-adversarial systems are generally highly nonlinear. In this paper, we address this scenario by formulating inverse cognition as a nonlinear Gaussian state-space model, wherein the adversary employs an unscented Kalman filter (UKF) to estimate the defender's state with reduced linearization errors. To estimate the adversary's estimate of the defender, we propose and develop an inverse UKF (IUKF) system. We then derive theoretical guarantees for the stochastic stability of IUKF in the mean-squared boundedness sense. Numerical experiments for multiple practical applications show that the estimation error of IUKF converges and closely follows the recursive Cram\'{e}r-Rao lower bound.

Related papers

• Rectified Diffusion Guidance for Conditional Generation [62.00207951161297]
  We revisit the theory behind CFG and rigorously confirm that the improper configuration of the combination coefficients (i.e., the widely used summing-to-one version) brings about expectation shift of the generative distribution. We propose ReCFG with a relaxation on the guidance coefficients such that denoising with ReCFG strictly aligns with the diffusion theory. That way the rectified coefficients can be readily pre-computed via traversing the observed data, leaving the sampling speed barely affected.
  arXiv  Detail & Related papers  (2024-10-24T13:41:32Z)
• Inverse Particle Filter [16.975704972827305]
  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 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.
  arXiv  Detail & Related papers  (2024-07-23T16:32:38Z)
• Inverse Unscented Kalman Filter [16.975704972827305]
  A cognitive 'adversary' tracks its target of interest via a framework such as a Kalman filter (KF) The target or 'defender' then employs another inverse unscented filter to infer the forward filter estimates of the defender computed by the adversary. For linear systems, the inverse Kalman filter (I-KF) has been recently shown to be effective in these counter-adversarial applications.
  arXiv  Detail & Related papers  (2023-04-04T10:51:43Z)
• Inverse Cubature and Quadrature Kalman filters [16.975704972827305]
  We develop inverse cubature KF (I-CKF), inverse quadrature KF (I-QKF), and inverse cubature-quadrature KF (I-CQKF) We derive the stability conditions for the proposed filters in the exponential-mean-squared-boundedness sense and prove the filters' consistency.
  arXiv  Detail & Related papers  (2023-03-18T03:48:39Z)
• Decomposed Diffusion Sampler for Accelerating Large-Scale Inverse Problems [64.29491112653905]
  We propose a novel and efficient diffusion sampling strategy that synergistically combines the diffusion sampling and Krylov subspace methods. Specifically, we prove that if tangent space at a denoised sample by Tweedie's formula forms a Krylov subspace, then the CG with the denoised data ensures the data consistency update to remain in the tangent space. Our proposed method achieves more than 80 times faster inference time than the previous state-of-the-art method.
  arXiv  Detail & Related papers  (2023-03-10T07:42:49Z)
• Inverse Extended Kalman Filter -- Part II: Highly Non-Linear and Uncertain Systems [18.244578289687123]
  This paper proposes an inverse extended Kalman filter (I-EKF) to address the inverse filtering problem in non-linear systems. Part I: Theory of I-EKF (with and without unknown inputs) and I-KF (with unknown inputs) Part II: Theory of I-EKF (with and without unknown inputs) and I-KF (with unknown inputs)
  arXiv  Detail & Related papers  (2022-08-13T16:55:39Z)
• Learning Dynamical Systems via Koopman Operator Regression in Reproducing Kernel Hilbert Spaces [52.35063796758121]
  We formalize a framework to learn the Koopman operator from finite data trajectories of the dynamical system. We link the risk with the estimation of the spectral decomposition of the Koopman operator. Our results suggest RRR might be beneficial over other widely used estimators.
  arXiv  Detail & Related papers  (2022-05-27T14:57:48Z)
• Optimal variance-reduced stochastic approximation in Banach spaces [114.8734960258221]
  We study the problem of estimating the fixed point of a contractive operator defined on a separable Banach space. We establish non-asymptotic bounds for both the operator defect and the estimation error.
  arXiv  Detail & Related papers  (2022-01-21T02:46:57Z)
• Inverse Extended Kalman Filter -- Part I: Fundamentals [19.078991171384015]
  In this paper, we develop the theory of inverse extended Kalman filter (I-EKF) in detail. We provide theoretical stability guarantees using both bounded non-linearity and unknown matrix approaches. In the companion paper (Part II), we propose reproducing kernel Hilbert space-based EKF to handle incomplete system model information.
  arXiv  Detail & Related papers  (2022-01-05T10:56:58Z)
• On the Practicality of Differential Privacy in Federated Learning by Tuning Iteration Times [51.61278695776151]
  Federated Learning (FL) is well known for its privacy protection when training machine learning models among distributed clients collaboratively. Recent studies have pointed out that the naive FL is susceptible to gradient leakage attacks. Differential Privacy (DP) emerges as a promising countermeasure to defend against gradient leakage attacks.
  arXiv  Detail & Related papers  (2021-01-11T19:43:12Z)
• Gaussian MRF Covariance Modeling for Efficient Black-Box Adversarial Attacks [86.88061841975482]
  We study the problem of generating adversarial examples in a black-box setting, where we only have access to a zeroth order oracle. We use this setting to find fast one-step adversarial attacks, akin to a black-box version of the Fast Gradient Sign Method(FGSM) We show that the method uses fewer queries and achieves higher attack success rates than the current state of the art.
  arXiv  Detail & Related papers  (2020-10-08T18:36:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.