Improved sample complexity estimates for statistical learning control of uncertain systems
From MaRDI portal
Publication:2730339
DOI10.1109/9.895579zbMath0991.93130OpenAlexW2162876875MaRDI QIDQ2730339
Dmitriy Panchenko, Peter Dorato, Marco Ariola, Vladimir I. Koltchinskii, Chaouki T. Abdallah
Publication date: 5 August 2001
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://digitalrepository.unm.edu/ece_fsp/65
Related Items
A survey of randomized algorithms for control synthesis and performance verification ⋮ Stochastic algorithms for robustness of control performances ⋮ Learning with side information: PAC learning bounds ⋮ FAST—Fast Algorithm for the Scenario Technique ⋮ Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ A statistical learning theory approach for uncertain linear and bilinear matrix inequalities ⋮ Control design with hard/soft performance specifications: aQ-parameter randomization approach ⋮ Probabilistic robust design with linear quadratic regulators ⋮ Statistical Learning Theory: A Pack-based Strategy for Uncertain Feasibility and Optimization Problems ⋮ Research on probabilistic methods for control system design ⋮ Unnamed Item ⋮ Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities ⋮ Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control ⋮ A new statistical approach for the analysis of uncertain systems ⋮ Statistical learning control of uncertain systems: theory and algorithms. ⋮ Randomized methods for design of uncertain systems: sample complexity and sequential algorithms ⋮ Statistical learning methods in linear algebra and control problems: The example of finite-time control of uncertain linear systems
