Symmetric Linear Dynamical Systems are Learnable from Few Observations
Not on the map. Why?
Abstract (arXiv)
We consider the problem of learning the parameters of a N-dimensional stochastic linear dynamics under both full and partial observations from a single trajectory of time T. We introduce and analyze a new estimator that achieves a small maximum element-wise error on the recovery of symmetric dynamic matrices using only T=O(log N) observations, irrespective of whether the matrix is sparse or dense. This estimator is based on the method of moments and does not rely on problem-specific regularization. This is especially important for applications such as structure discovery.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 32 references that are in the map. First posted on arXiv 5 Dec 2025.
Builds on
15 of 32 references.
References · 15
- 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
- 2018Near optimal finite time identification of arbitrary linear dynamical systemscited by 89
- 2019Finite Sample Analysis of Stochastic System Identificationcited by 67
- 2017Finite Time Identification in Unstable Linear Systemscited by 66
- 2019Learning Linear Dynamical Systems with Semi-Parametric Least Squarescited by 58
- 2017Learning Graphical Models Using Multiplicative Weightscited by 43
- 2020Finite-time Identification of Stable Linear Systems: Optimality of the Least-Squares Estimatorcited by 26
- 2023A New Approach to Learning Linear Dynamical Systemscited by 23
- 2019Efficient Learning of Discrete Graphical Modelscited by 21
- 2019Sample Complexity Lower Bounds for Linear System Identificationcited by 20
- 2019Learning Sparse Dynamical Systems from a Single Sample Trajectorycited by 20
- 2013Oracle Inequalities for High Dimensional Vector Autoregressionscited by 11
Built on by
Not cited yet.