Statistical learning theory: a pack-based strategy for uncertain feasibility and optimization problems

DOI10.1007/978-1-84800-155-8_1zbMATH Open1201.93135OpenAlexW65603591MaRDI QIDQ3053993FDOQ3053993

Authors: Eduardo F., T. Alamo, Roberto Tempo 

Publication date: 5 November 2010

Published in: Lecture Notes in Control and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-84800-155-8_1

Recommendations

• The optimal sample complexity of PAC learning
• General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Improved sample complexity estimates for statistical learning control of uncertain systems
• The bounds on the rate of uniform convergence of learning process based on complex random samples

zbMATH Keywords

randomized algorithmsuncertain systemsstatistical learning theoryprobabilistic robustness

Mathematics Subject Classification ID

Stochastic learning and adaptive control (93E35)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Title not available (Why is that?)
• Uncertain convex programs: randomized solutions and confidence levels
• The Scenario Approach to Robust Control Design
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
• Probabilistic robust design with linear quadratic regulators
• Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
• A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
• Randomized algorithms for robust controller synthesis using statistical learning theory
• An ellipsoid algorithm for probabilistic robust controller design
• Improved sample complexity estimates for statistical learning control of uncertain systems
• Title not available (Why is that?)
• Stochastic algorithms for exact and approximate feasibility of robust LMIs
• Probabilistic solutions to some NP-hard matrix problems
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
• Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
• Probabilistic design of LPV control systems.

Cited In (2)

• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
• A statistical learning theory approach for uncertain linear and bilinear matrix inequalities

This page was built for publication: Statistical learning theory: a pack-based strategy for uncertain feasibility and optimization problems

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