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

DOI10.3166/ejc.7.287-310zbMath1293.93321OpenAlexW2065275043MaRDI QIDQ2512151

Mathukumalli 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

zbMATH Keywords

computational complexityrobust controlrandomized algorithmstatistical learning theory

Mathematics Subject Classification ID

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

Related Items

Entropy dimension reduction method for randomized machine learning problems

Cites Work

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