Fetching the paper…
Reading the bibliography…
This paper establishes problem-specific sample complexity lower bounds for linear system identification problems.
1902
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.
T. L. Lai and H. Robbins, “Asymptotically efficient adaptive allocation rules,” Advances in applied mathematics , vol. 6, no. 1, pp. 4–22, 1985
1985
Earlier work this paper cites.
L. Ljung, System Identification: Theory for the User . Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1986
1986
Earlier work this paper cites.
A. Tikku and K. Poolla, “Sample complexity for worst-case system identification problems,” in 1993 American Control Conference , June 1993, pp. 141–145
1993
Earlier work this paper cites.
E. Weyer, R. C. Williamson, and I. M. Mareels, “Sample complexity of least squares identification of fir models,” IFAC Proceedings Volumes , vol. 29, no. 1, pp. 4664 – 4669, 1996, 13th World Congress of IFAC, 1996, San Francisco USA, 30 June - 5 July. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S1474667017584189
1996
Earlier work this paper cites.
E. Weyer, R. C. Williamson, and I. M. Y. Mareels, “Finite sample properties of linear model identification,” IEEE Transactions on Automatic Control , vol. 44, no. 7, pp. 1370–1383, July 1999
1999
Cited alongside, same era.
E. Weyer, “Brief finite sample properties of system identification of arx models under mixing conditions,” Automatica , vol. 36, no. 9, pp. 1291–1299, Sep. 2000. [Online]. Available: http://dx.doi.org/10.1016/S0005-1098(00)00039-X
2000
Cited alongside, same era.
P. Kuusela, D. Ocone, and E. D. Sontag, “Learning complexity dimensions for a continuous-time control system,” SIAM journal on control and optimization , vol. 43, no. 3, pp. 872–898, 2004
2004
Cited alongside, same era.
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
Cited alongside, same era.
S. Arora, E. Hazan, H. Lee, K. Singh, C. Zhang, and Y. Zhang, “Towards provable control for unknown linear dynamical systems,” 2018. [Online]. Available: https://openreview.net/forum?id=BygpQlbA-
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.
M. Simchowitz, H. Mania, S. Tu, M. I. Jordan, and B. Recht, “Learning without mixing: Towards a sharp analysis of linear system identification,” in Proceedings of the 31st Conference On Learning Theory , ser. Proceedings of Machine Learning Research, S. Bubeck, V. Perchet, and P. Rigollet, Eds., vol. 75. PMLR, 06–09 Jul 2018, pp. 439–473. [Online]. Available: http://proceedings.mlr.press/v75/simchowitz18a.html
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Raginsky, “Divergence-based characterization of fundamental limitations of adaptive dynamical systems,” in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , Sep. 2010, pp. 107–114
2010
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.
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.
2017
Cited alongside, same era.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Garivier, P. Ménard, and G. Stoltz, “Explore first, exploit next: The true shape of regret in bandit problems,” Mathematics of Operations Research , 2018
2018
Later among the works it cites.