2018
DOI: 10.48550/arxiv.1803.09186
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Finite-Data Performance Guarantees for the Output-Feedback Control of an Unknown System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 0 publications
0
12
0
Order By: Relevance
“…Lacking in the output feedback setting however is an analogous family of robustness results to those presented in Section 4.5. Although preliminary results exist [22], this remains in important direction for future work.…”
Section: Discussionmentioning
confidence: 95%
See 1 more Smart Citation
“…Lacking in the output feedback setting however is an analogous family of robustness results to those presented in Section 4.5. Although preliminary results exist [22], this remains in important direction for future work.…”
Section: Discussionmentioning
confidence: 95%
“…In particular, we know of no results in the literature that bound the degradation in performance of controlling an uncertain system in terms of the size of the perturbations affecting it. While traditional results in robust control considered fixed model uncertainty, in the data-driven and learning based control setting, analytic interpretability of the effects uncertainty size are essential in obtaining sample-complexity bounds for these methods [19,20,21,22].…”
Section: Robust Controlmentioning
confidence: 99%
“…For example, estimated models (Levine & Koltun, 2013;Gu et al, 2016;Kalweit & Boedecker, 2017) On the control theory side, Dean et al (2018; provide strong finite sample complexity bounds for solving linear quadratic regulator using model-based approach. Boczar et al (2018) provide finitedata guarantees for the "coarse-ID control" pipeline, which is composed of a system identification step followed by a robust controller synthesis procedure. Our method is inspired by the general idea of maximizing a low bound of the reward in (Dean et al, 2017).…”
Section: Additional Related Workmentioning
confidence: 99%
“…Several other authors [28,17,30] have derived similarly important results at the same time. Subsequently, a number of authors [11,1,14,15,3,7] have applied them to the (Linear-Quadratic, LQ) control of an unknown system, which underlies much of reinforcement learning.…”
Section: Related Workmentioning
confidence: 99%
“…In improper learning of such an LDS (which we refer to as an identification problem), one wishes to estimate ŷk such that ŷk are close to the best estimates y * k of y k possible at time k. When there is no hidden state, the identification problem is convex and a variety of methods work well. When there is a hidden state, the problem is non-convex and only rather recently spectral filtering [19,18] has been used to obtain identification procedures with regret bounded by Õ(log 7 √ k) at time k, where Õ(•) hides terms that depend polynomially on the dimension of the system and norms of the inputs and outputs and the noise.…”
Section: Introductionmentioning
confidence: 99%