A Tutorial on Concentration Bounds for System Identification
Abstract¶
We provide a brief tutorial on the use of concentration inequalities as they apply to system identification of state-space parameters of linear time invariant systems, with a focus on the fully observed setting. We draw upon tools from the theories of large-deviations and self-normalized martingales, and provide both data-dependent and independent bounds on the learning rate.
Links¶
Knowledge Base
External
Tags¶
Similar Papers¶
1
84%
Learning without Mixing: Towards a Sharp Analysis of Linear System Identification
Learning without Mixing
2
84%
3
84%
4
81%
5
80%