{"ID":2884431,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.07037","arxiv_id":"2508.07037","title":"Differentiable Adaptive Kalman Filtering via Optimal Transport","abstract":"Learning-based filtering has demonstrated strong performance in non-linear dynamical systems, particularly when the statistics of noise are unknown. However, in real-world deployments, environmental factors, such as changing wind conditions or electromagnetic interference, can induce unobserved noise-statistics drift, leading to substantial degradation of learning-based methods. To address this challenge, we propose OTAKNet, the first online solution to noise-statistics drift within learning-based adaptive Kalman filtering. Unlike existing learning-based methods that perform offline fine-tuning using batch pointwise matching over entire trajectories, OTAKNet establishes a connection between the state estimate and the drift via one-step predictive measurement likelihood, and addresses it using optimal transport. This leverages OT's geometry - aware cost and stable gradients to enable fully online adaptation without ground truth labels or retraining. We compare OTAKNet against classical model-based adaptive Kalman filtering and offline learning-based filtering. The performance is demonstrated on both synthetic and real-world NCLT datasets, particularly under limited training data.","short_abstract":"Learning-based filtering has demonstrated strong performance in non-linear dynamical systems, particularly when the statistics of noise are unknown. However, in real-world deployments, environmental factors, such as changing wind conditions or electromagnetic interference, can induce unobserved noise-statistics drift,...","url_abs":"https://arxiv.org/abs/2508.07037","url_pdf":"https://arxiv.org/pdf/2508.07037v1","authors":"[\"Yangguang He\",\"Wenhao Li\",\"Minzhe Li\",\"Juan Zhang\",\"Xiangfeng Wang\",\"Bo Jin\"]","published":"2025-08-09T16:36:33Z","proceeding":"cs.LG","tasks":"[\"cs.LG\",\"eess.SP\"]","methods":"[]","has_code":false}
