The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
On the Sample Complexity of the Linear Quadratic Regulator
Open accessAbstract
This paper addresses the optimal control problem known as the linear quadratic regulator in the case when the dynamics are unknown. We propose a multistage procedure, called Coarse-ID control, that estimates a model from a few experimental trials, estimates the error in that model with respect to the truth, and then designs a controller using both the model and uncertainty estimate. Our technique uses contemporary tools from random matrix theory to bound the error in the estimation procedure. We also employ a recently developed approach to control synthesis called System Level Synthesis that enables robust control design by solving a quasi-convex optimization problem. We provide end-to-end bounds on the relative error in control cost that are optimal in the number of parameters and that highlight salient properties of the system to be controlled such as closed-loop sensitivity and optimal control magnitude. We show experimentally that the Coarse-ID approach enables efficient computation of a stabilizing controller in regimes where simple control schemes that do not take the model uncertainty into account fail to stabilize the true system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
System Identification: Theory for the User
Lennart Ljung, A. (1987) · Cited by 17,690
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
System identification—Theory for the user
Sinha, N. K. (1989) · Automatica · doi:10.1016/0005-1098(89)90019-8 · Cited by 9,184
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Weiss, M. (1997) · Automatica · doi:10.1016/s0005-1098(97)00132-5 · Cited by 5,495
Time Series Analysis: Forecasting and Control.
Anderson, O. D., Box, G. E. P., & Jenkins, G. M. (1978) · The Statistician · doi:10.2307/2988198 · Cited by 5,298
Zhou, K., Doyle, J. C., & Glover, K. (1997) · Cited by 4,556
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
Analysis of feedback systems with structured uncertainties
Doyle, J. (1982) · IEE Proceedings D Control Theory and Applications · doi:10.1049/ip-d.1982.0053 · Cited by 2,059
Cited by
A Convergence Theory for Deep Learning via Over-Parameterization
Allen-Zhu, Z., Li, Y., & Song, Z. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.03962 · Cited by 657
Data-Enabled Predictive Control: In the Shallows of the DeePC
Coulson, J., Lygeros, J., & Dorfler, F. (2019) · 2019 18th European Control Conference (ECC) · doi:10.23919/ecc.2019.8795639 · Cited by 628
From Noisy Data to Feedback Controllers: Nonconservative Design via a Matrix S-Lemma
van Waarde, H. J., Camlibel, M. K., & Mesbahi, M. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3047577 · Cited by 383
Projection-based model reduction: Formulations for physics-based machine learning
Swischuk, R., Mainini, L., Peherstorfer, B., & Willcox, K. (2019) · Computers & Fluids · doi:10.1016/j.compfluid.2018.07.021 · Cited by 372
When to Trust Your Model: Model-Based Policy Optimization
Janner, M., Fu, J., Zhang, M., & Levine, S. (2019) · arXiv · doi:10.48550/arxiv.1906.08253 · Cited by 351
Metadata
- Authors
- Dean, S., Mania, H., Matni, N., Recht, B., & Tu, S.
- Venue
- Foundations of Computational Mathematics
- Published
- 2019-08-05
- Volume
- 20
- Issue
- 4
- Pages
- 633-679
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2966348706
- Cited by
- 436
- References
- 47
- FWCI
- 36.91
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Sample Complexity of the Linear Quadratic Regulator. https://app.cochat.ai/papers/10.1007/s10208-019-09426-y
- The paper
- Dean, S., Mania, H., Matni, N., Recht, B., & Tu, S. (2020). On the Sample Complexity of the Linear Quadratic Regulator. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-019-09426-y
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.