Fetching the paper…
Reading the bibliography…
We present a new finite-time analysis of the estimation error of the Ordinary Least Squares (OLS) estimator for stable linear time-invariant systems.
1902
Earlier work this paper cites.
1912
Earlier work this paper cites.
D. L. Hanson and F. T. Wright, “A bound on tail probabilities for quadratic forms in independent random variables,” The Annals of Mathematical Statistics , vol. 42, no. 3, pp. 1079–1083, 1971
1971
Earlier work this paper cites.
F. T. Wright, “A bound on tail probabilities for quadratic forms in independent random variables whose distributions are not necessarily symmetric,” Ann. Probab. , vol. 1, no. 6, pp. 1068–1070, 12 1973. [Online]. Available: https://doi.org/10.1214/aop/1176996815
1973
Earlier work this paper cites.
L. Ljung, “Consistency of the least-squares identification method,” IEEE Transactions on Automatic Control , vol. 21, no. 5, pp. 779–781, October 1976
1976
Earlier work this paper cites.
L. Ljung, “On the consistency of prediction error identification methods,” in System Identification Advances and Case Studies , ser. Mathematics in Science and Engineering, R. K. Mehra and D. G. Lainiotis, Eds. Elsevier, 1976, vol. 126, pp. 121 – 164. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0076539208608711
1976
Earlier work this paper cites.
G. C. Goodwin and R. L. Payne, Dynamic system identification: experiment design and data analysis . Academic press New York, 1977, vol. 136
1977
Earlier work this paper cites.
N. Young, “The rate of convergence of a matrix power series,” Linear Algebra and its Applications , vol. 35, pp. 261 – 278, 1981. [Online]. Available: http://www.sciencedirect.com/science/article/pii/0024379581902780
1981
Earlier work this paper cites.
A. Litvak, A. Pajor, M. Rudelson, and N. Tomczak-Jaegermann, “Smallest singular value of random matrices and geometry of random polytopes,” Advances in Mathematics , vol. 195, no. 2, pp. 491 – 523, 2005. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0001870804002750
2005
Earlier work this paper cites.
V. H. Peña, T. L. Lai, and Q.-M. Shao, Self-normalized processes: Limit theory and Statistical Applications . Springer Science & Business Media, 2008
2008
Earlier work this paper cites.
2008
Cited alongside, same era.
Y. Abbasi-Yadkori, D. Pál, and C. Szepesvári, “Improved algorithms for linear stochastic bandits,” in Advances in Neural Information Processing Systems , 2011, pp. 2312–2320
2011
Cited alongside, same era.
R. Vershynin, Introduction to the non-asymptotic analysis of random matrices . Cambridge University Press, 2012, p. 210–268
2012
Cited alongside, same era.
T. Tao, Topics in random matrix theory . American Mathematical Soc., 2012, vol. 132
2012
Cited alongside, same era.
A. Böttcher and B. Silbermann, Introduction to large truncated Toeplitz matrices . Springer Science & Business Media, 2012
2012
Cited alongside, same era.
M. Simchowitz, H. Mania, S. Tu, M. I. Jordan, and B. Recht, “Learning without mixing: Towards a sharp analysis of linear system identification,” in Conference On Learning Theory , 2018, pp. 439–473
2018
Later among the works it cites.
A. Rantzer, “Concentration bounds for single parameter adaptive control,” in 2018 Annual American Control Conference (ACC) . IEEE, 2018, pp. 1862–1866
2018
Later among the works it cites.
M. K. S. Faradonbeh, A. Tewari, and G. Michailidis, “Finite time identification in unstable linear systems,” Automatica , vol. 96, pp. 342–353, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Rudelson, R. Vershynin et al. , “Hanson-wright inequality and sub-gaussian concentration,” Electronic Communications in Probability , vol. 18, 2013
2013
Cited alongside, same era.
S. Mendelson, “Learning without concentration,” in Proceedings of The 27th Conference on Learning Theory , ser. Proceedings of Machine Learning Research, M. F. Balcan, V. Feldman, and C. Szepesvári, Eds., vol. 35. Barcelona, Spain: PMLR, 13–15 Jun 2014, pp. 25–39. [Online]. Available: http://proceedings.mlr.press/v35/mendelson14.html
2014
Cited alongside, same era.
F. Krahmer, S. Mendelson, and H. Rauhut, “Suprema of chaos processes and the restricted isometry property,” Communications on Pure and Applied Mathematics , vol. 67, no. 11, pp. 1877–1904, 2014
2014
Cited alongside, same era.
S. Mendelson, “Learning without concentration,” in Conference on Learning Theory , 2014, pp. 25–39
2014
Cited alongside, same era.
2018
Later among the works it cites.
M. K. S. Faradonbeh, A. Tewari, and G. Michailidis, “Finite time identification in unstable linear systems,” Automatica , vol. 96, pp. 342 – 353, 2018. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0005109818303546
2018
Later among the works it cites.
R. Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science , ser. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2018
2018
Later among the works it cites.
Y. Jedra and A. Proutiere, “Sample complexity lower bounds for linear system identification,” in IEEE Conference on Decision and Control , 2019
2019
Later among the works it cites.
T. Sarkar and A. Rakhlin, “Near optimal finite time identification of arbitrary linear dynamical systems,” in Proceedings of the 36th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, K. Chaudhuri and R. Salakhutdinov, Eds., vol. 97. Long Beach, California, USA: PMLR, 09–15 Jun 2019, pp. 5610–5618. [Online]. Available: http://proceedings.mlr.press/v97/sarkar19a.html
2019
Later among the works it cites.