CaltechAUTHORS
  A Caltech Library Service

Regret-Optimal Filtering

Sabag, Oron and Hassibi, Babak (2021) Regret-Optimal Filtering. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20210225-132748732

[img]
Preview
PDF - Accepted Version
Creative Commons Attribution.

267Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20210225-132748732

Abstract

We consider the problem of filtering in linear state-space models (e.g., the Kalman filter setting) through the lens of regret optimization. Different assumptions on the driving disturbance and the observation noise sequences give rise to different estimators: in the stochastic setting to the celebrated Kalman filter, and in the deterministic setting of bounded energy disturbances to H∞ estimators. In this work, we formulate a novel criterion for filter design based on the concept of regret between the estimation error energy of a clairvoyant estimator that has access to all future observations (a so-called smoother) and a causal one that only has access to current and past observations. The regret-optimal estimator is chosen to minimize this worst-case difference across all bounded-energy noise sequences. The resulting estimator is adaptive in the sense that it aims to mimic the behavior of the clairvoyant estimator, irrespective of what the realization of the noise will be and thus interpolates between the stochastic and deterministic approaches. We provide a solution for the regret estimation problem at two different levels. First, we provide a solution at the operator level by reducing it to the Nehari problem. Second, for state-space models, we explicitly find the estimator that achieves the optimal regret. From a computational perspective, the regret-optimal estimator can be easily implemented by solving three Riccati equations and a single Lyapunov equation. For a state-space model of dimension n, the regret-optimal estimator has a state-space structure of dimension 3n. We demonstrate the applicability and efficacy of the estimator in a variety of problems and observe that the estimator has average and worst-case performances that are simultaneously close to their optimal values. We therefore argue that regret-optimality is a viable approach to estimator design.


Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription
http://arxiv.org/abs/2101.10357arXivDiscussion Paper
ORCID:
AuthorORCID
Sabag, Oron0000-0002-7907-1463
Additional Information:Attribution 4.0 International (CC BY 4.0). Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS) 2021, San Diego, California, USA. PMLR: Volume 130. Copyright 2021 by the author(s).
Record Number:CaltechAUTHORS:20210225-132748732
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20210225-132748732
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:108213
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:01 Mar 2021 15:00
Last Modified:01 Mar 2021 15:00

Repository Staff Only: item control page