[10] C. Davis and W. M. Kahan. The rotation of eigenvectors by a perturbation. iii. SIAM Journal on Numerical Analysis, 7(1):1-46, 1970.
[11] J. Durbin. Estimation of parameters in time-series regression models. Journal of the royal statistical society: Series B (Methodological), 22(1):139-153, 1960.
[12] Facebook. Prophet. https://github.com/facebook/prophet, 2020.
[13] M. Gavish and D. L. Donoho. The optimal hard threshold for singular values is  $4 / \sqrt{3}$ . IEEE Transactions on Information Theory, 60(8):5040-5053, 2014.
[14] F. A. Gers, J. Schmidhuber, and F. Cummins. Learning to forget: Continual prediction with LSTM. 1999.
[15] N. Golyandina, A. Korobeynikov, and A. Zhigljavsky. Singular spectrum analysis with R. Springer, 2018.
[16] N. Golyandina, V. Nekrutkin, and A. A. Zhigljavsky. Analysis of time series structure: SSA and related techniques. Chapman and Hall/CRC, 2001.
[17] R. A. González and C. R. Rojas. A finite-sample deviation bound for stable autoregressive processes. In Learning for Dynamics and Control, pages 191-200. PMLR, 2020.
[18] H. Hassani and R. Mahmoudvand. Multivariate singular spectrum analysis: A general view and new vector forecasting approach. International Journal of Energy and Statistics, 1(01):55-83, 2013.
[19] Y. Jedra and A. Proutiere. Sample complexity lower bounds for linear system identification. In 2019 IEEE 58th Conference on Decision and Control (CDC), pages 2676-2681. IEEE, 2019.
[20] Y. Jedra and A. Proutiere. Finite-time identification of stable linear systems optimality of the least-squares estimator. In 2020 59th IEEE Conference on Decision and Control (CDC), pages 996-1001. IEEE, 2020.
[21] Y. Jedra and A. Proutiere. Finite-time identification of linear systems: Fundamental limits and optimal algorithms. IEEE Transactions on Automatic Control, 2022.
[22] Microsoft. nimbusml package, ssa class, 2020. https://docs.microsoft.com/en-us/python/api/nimbus/mlnimbusml.timeseries.ssachangepointdetector.
[23] D. Salinas, V. Flunkert, J. Gasthaus, and T. Januschowski. Deeper: Probabilistic forecasting with autoregressive recurrent networks. International Journal of Forecasting, 2019.
[24] T. Sarkar and A. Rakhlin. Near optimal finite time identification of arbitrary linear dynamical systems. In International Conference on Machine Learning, pages 5610-5618. PMLR, 2019.
[25] S. Seabold and J. Perktold. statsmodels: Econometric and statistical modeling with python. In 9th Python in Science Conference, 2010.
[26] R. H. Shumway, D. S. Stoffer, and D. S. Stoffer. Time series analysis and its applications, volume 3. Springer, 2000.
[27] M. Simchowitz, H. Mania, S. Tu, M. I. Jordan, and B. Recht. Learning without mixing: Towards a sharp analysis of linear system identification, 2018.
[28] S. J. Taylor and B. Letham. Forecasting at scale. The American Statistician, 72(1):37-45, 2018.
[29] R. Vershynin. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027, 2010.
[30] R. Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018.
[31] M. J. Wainwright. High-dimensional statistics: A non-asymptotic viewpoint, volume 48. Cambridge university press, 2019.