paper-with-me

홈 › Papers

A Tutorial on Concentration Bounds for System Identification

2019-06-27 · Nikolai Matni, Stephen Tu

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.

📄 PDF Abstract BibTeX arXiv:1906.11395

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions

2019-01-04 · ICML 2020 1 · Prashanth L. A., Krishna Jagannathan, Ravi Kumar Kolla

Conditional Value-at-Risk (CVaR) is a widely used risk metric in applications such as finance. We derive concentration bounds for CVaR estimates, considering separately the cases of light-tailed and heavy-tailed distribu…

Multi-Armed Bandits

Improved rates for prediction and identification for partially observed linear dynamical systems

2021-05-21 · NeurIPS 2021 12 · Holden Lee

Identification of a linear time-invariant dynamical system from partial observations is a fundamental problem in control theory. Particularly challenging are systems exhibiting long-term memory. A natural question is ho…

Improved rates for prediction and identification of partially observed linear dynamical systems

2020-11-19 · Holden Lee

Identification of a linear time-invariant dynamical system from partial observations is a fundamental problem in control theory. Particularly challenging are systems exhibiting long-term memory. A natural question is how…

PAC-Bayes Mini-tutorial: A Continuous Union Bound

2014-05-07 · Tim van Erven

When I first encountered PAC-Bayesian concentration inequalities they seemed to me to be rather disconnected from good old-fashioned results like Hoeffding's and Bernstein's inequalities. But, at least for one flavour of…

BIG-bench Machine LearningRelation

Concentration Bounds for Optimized Certainty Equivalent Risk Estimation

2024-05-31 · Ayon Ghosh, L. A. Prashanth, Krishna Jagannathan

We consider the problem of estimating the Optimized Certainty Equivalent (OCE) risk from independent and identically distributed (i.i.d.) samples. For the classic sample average approximation (SAA) of OCE, we derive mean…