Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview

DOI10.3166/EJC.7.287-310zbMATH Open1293.93321OpenAlexW2065275043MaRDI QIDQ2512151FDOQ2512151

Authors: M. Vidyasagar 

Publication date: 7 August 2014

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/ejc.7.287-310

Recommendations

• Randomized algorithms for robust controller synthesis using statistical learning theory
• Randomized algorithms for robust controller synthesis using statistical learning theory
• Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
• scientific article; zbMATH DE number 1979753
• Stochastic algorithms for robustness of control performances

zbMATH Keywords

computational complexityrandomized algorithmrobust controlstatistical learning theory

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Synthesis problems (93B50) Stochastic learning and adaptive control (93E35)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Checking robust nonsingularity is NP-hard
• Title not available (Why is that?)
• Computational complexity of μ calculation
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Title not available (Why is that?)
• A survey of computational complexity results in systems and control
• Feedforward Neural Network Methodology
• NP-Hardness of Some Linear Control Design Problems
• Some applications of randomized algorithms for control system design
• Title not available (Why is that?)
• Empirical discrepancies and subadditive processes
• Several NP-hard problems arising in robust stability analysis
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic solutions to some NP-hard matrix problems
• Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
• Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
• Randomized algorithms for robust controller synthesis using statistical learning theory
• Stochastic robustness of linear time-invariant control systems
• Finiteness results for sigmoidal “neural” networks
• The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
• Vapnik-Chervonenkis bounds for generalization
• Probabilistic search algorithms for robust stability analysis and their complexity properties

Cited In (8)

• Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
• Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
• Entropy dimension reduction method for randomized machine learning problems
• Randomized algorithms for the synthesis of cautious adaptive controllers
• Control analysis and design via randomised coordinate polynomial minimisation
• Title not available (Why is that?)
• Randomized algorithms for robust controller synthesis using statistical learning theory
• On a probabilistic approach to synthesize control policies from example datasets

This page was built for publication: Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512151)