Near optimal finite time identification of arbitrary linear dynamical systems

作者: Alexander Rakhlin , Tuhin Sarkar

DOI:

关键词:

摘要: We derive finite time error bounds for estimating general linear time-invariant (LTI) systems from a single observed trajectory using the method of least squares. provide first analysis case when eigenvalues LTI system are arbitrarily distributed in three regimes: stable, marginally and explosive. Our yields sharp upper each these cases separately. observe that although underlying process behaves quite differently regimes, systematic self--normalized martingale difference term helps bound identification up to logarithmic factors lower bound. On other hand, we demonstrate squares solution may be statistically inconsistent under certain conditions even signal-to-noise ratio is high.

参考文章(16)
Víctor De la Peña, Tze Leung Lai, Qi-Man Shao, Self-Normalized Processes: Limit Theory and Statistical Applications ,(2001)
Émilie Kaufmann, Improved Algorithms for Linear Stochastic Bandits neural information processing systems. ,vol. 24, pp. 2312- 2320 ,(2011)
Roman Vershynin, Introduction to the non-asymptotic analysis of random matrices arXiv: Probability. ,(2010)
M.C. Campi, E. Weyer, Finite sample properties of system identification methods IEEE Transactions on Automatic Control. ,vol. 47, pp. 1329- 1334 ,(2002) , 10.1109/TAC.2002.800750
Benjamin Recht, Tengyu Ma, Moritz Hardt, Gradient Descent Learns Linear Dynamical Systems arXiv: Learning. ,(2016)