Improved sample complexity estimates for statistical learning control of uncertain systems

Probabilistic methods and statistical learning theory have been shown to provide approximate solutions to "difficult" control problems. Unfortunately, the number of samples required in order to guarantee stringent performance levels may be prohibitively large. This paper introduces bootstr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control Vol. 45; no. 12; pp. 2383 - 2388
Main Authors: Koltchinskii, V., Abdallah, C.T., Ariola, M., Dorato, P., Panchenko, D.
Format: Journal Article
Language:English
Published: New York IEEE 01-12-2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Probabilistic methods and statistical learning theory have been shown to provide approximate solutions to "difficult" control problems. Unfortunately, the number of samples required in order to guarantee stringent performance levels may be prohibitively large. This paper introduces bootstrap learning methods and the concept of stopping times to drastically reduce the bound on the number of samples required to achieve a performance level. We then apply these results to obtain more efficient algorithms which probabilistically guarantee stability and robustness levels when designing controllers for uncertain systems.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/9.895579