Learning Linear Dynamical Systems via Spectral Filtering

Author name not available (Why is that?)

Publication date: 2 November 2017

Abstract: We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex optimization problem using improper learning: carefully overparameterize the class of LDSs by a polylogarithmic factor, in exchange for convexity of the loss functions. From this arises a polynomial-time algorithm with a near-optimal regret guarantee, with an analogous sample complexity bound for agnostic learning. Our algorithm is based on a novel filtering technique, which may be of independent interest: we convolve the time series with the eigenvectors of a certain Hankel matrix.

Has companion code repository: https://github.com/catid/spectral_ssm

This page was built for publication: Learning Linear Dynamical Systems via Spectral Filtering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6293425)