A note on the smallest eigenvalue of the empirical covariance of causal Gaussian processes
Not on the map. Why?
Abstract (arXiv)
We present a simple proof for bounding the smallest eigenvalue of the empirical covariance in a causal Gaussian process. Along the way, we establish a one-sided tail inequality for Gaussian quadratic forms using a causal decomposition. Our proof only uses elementary facts about the Gaussian distribution and the union bound. We conclude with an example in which we provide a performance guarantee for least squares identification of a vector autoregression.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 19 Dec 2022.
Builds on
8 of 19 references.
References · 8
- 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
- 2022Statistical Learning Theory for Control: A Finite Sample Perspectivecited by 52
- 2014Learning without Concentrationcited by 50
- 2022Learning with little mixingcited by 33
- 2022Learning from many trajectoriescited by 24
Built on by
Citing papers per year: 2023: 1.
1 paper.