Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview
From MaRDI portal
(Redirected from Publication:2512151)
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
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3668435 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263195 (Why is no real title available?)
- scientific article; zbMATH DE number 1322222 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- A survey of computational complexity results in systems and control
- Checking robust nonsingularity is NP-hard
- Computational complexity of μ calculation
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Empirical discrepancies and subadditive processes
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Feedforward Neural Network Methodology
- Finiteness results for sigmoidal “neural” networks
- NP-Hardness of Some Linear Control Design Problems
- Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Probabilistic search algorithms for robust stability analysis and their complexity properties
- Probabilistic solutions to some NP-hard matrix problems
- Probability Inequalities for Sums of Bounded Random Variables
- Randomized algorithms for robust controller synthesis using statistical learning theory
- Several NP-hard problems arising in robust stability analysis
- Some applications of randomized algorithms for control system design
- Stochastic robustness of linear time-invariant control systems
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Vapnik-Chervonenkis bounds for generalization
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
- scientific article; zbMATH DE number 1979753 (Why is no real title available?)
- 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)
