Linear dynamical systems (LDS) are applied to model data from various domains-including physics, smart cities, medicine, biology, chemistry and social science-as stochastic dynamic process. Whenever the model dynamics are allowed to change over time, the number of parameters can easily exceed millions. Hence, an estimation of such time-variant dynamics on a relatively small-compared to the number of variables-training sample typically results in dense, overfitted models. Existing regularization techniques are not able to exploit the temporal structure in the model parameters. We investigate a combined reparametrization and regularization approach which is designed to detect redundancies in the dynamics in order to leverage a new level of sparsity. On the basis of ordinary linear dynamical systems, the new model, called ST-LDS, is derived and a proximal parameter optimization procedure is presented. Differences to l1-regularization-based approaches are discussed and an evaluation on synthetic data is conducted. The results show, that the larger the considered system, the more sparsity can be achieved, compared to plain l1-regularization.
CITATION STYLE
Piatkowski, N., & Schnitzler, F. (2016). Compressible reparametrization of time-variant linear dynamical systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9580, pp. 234–250). Springer Verlag. https://doi.org/10.1007/978-3-319-41706-6_12
Mendeley helps you to discover research relevant for your work.