Fast Robust Methods for Singular State-Space Models
Jonathan Jonker, Aleksandr Y. Aravkin, James V. Burke, Gianluigi, Pillonetto, and Sarah Webster

TL;DR
This paper introduces a new efficient convex optimization-based method for estimating singular and nonsingular state-space models, outperforming traditional interior point methods in runtime and robustness, especially outside Gaussian assumptions.
Contribution
It reformulates all state-space models as constrained convex optimization problems and develops a locally linear convergence algorithm that is robust to problem conditioning.
Findings
Outperforms existing methods in nonsingular models
Converges at a locally linear rate independent of problem conditioning
Runs faster than interior point methods in numerical tests
Abstract
State-space models are used in a wide range of time series analysis formulations. Kalman filtering and smoothing are work-horse algorithms in these settings. While classic algorithms assume Gaussian errors to simplify estimation, recent advances use a broader range of optimization formulations to allow outlier-robust estimation, as well as constraints to capture prior information. Here we develop methods on state-space models where either innovations or error covariances may be singular. These models frequently arise in navigation (e.g. for `colored noise' models or deterministic integrals) and are ubiquitous in auto-correlated time series models such as ARMA. We reformulate all state-space models (singular as well as nonsinguar) as constrained convex optimization problems, and develop an efficient algorithm for this reformulation. The convergence rate is {\it locally linear}, with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
