# Regret Analysis with Almost Sure Convergence for OBF-ARX Filter

arXiv: https://arxiv.org/abs/2409.05390 · HTML: https://mlsanity.com/paper/2409.05390/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Sep 2024.

## Built on by (most cited first, 1 of 1)

- [Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret](https://mlsanity.com/paper/2505.08982/) (2025)

## Abstract (arXiv)

This paper considers the output prediction problem for an unknown Linear Time-Invariant (LTI) system. In particular, we focus our attention on the OBF-ARX filter, whose transfer function is a linear combination of Orthogonal Basis Functions (OBFs), with the coefficients determined by solving a least-squares regression. We prove that the OBF-ARX filter is an accurate approximation of the Kalman Filter (KF) by quantifying its online performance. Specifically, we analyze the average regret between the OBF-ARX filter and the KF, proving that the average regret over N time steps converges to the asymptotic bias at the speed of O(N-0.5+ε) almost surely for all ε>0. Then, we establish an upper bound on the asymptotic bias, demonstrating that it decreases exponentially with the number of OBF bases, and the decreasing rate τ(boldsymbolλ, boldsymbolμ) explicitly depends on the poles of both the KF and the OBF. Numerical results on diffusion processes validate the derived bounds.