Finite sample learning of moving targets
From MaRDI portal
Cites work
- A General Scenario Theory for Nonconvex Optimization and Decision Making
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Control of systems integrating logic, dynamics, and constraints
- Introduction to the Scenario Approach
- Learning and generalisation. With applications to neural networks.
- Learning changing concepts by exploiting the structure of change
- Learning with a drifting target concept
- On the complexity of learning from drifting distributions
- On the Connection Between Compression Learning and Scenario Based Single-Stage and Cascading Optimization Problems
- On the Exact Feasibility of Convex Scenario Programs With Discarded Constraints
- On the sample complexity of the linear quadratic regulator
- Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
- Probability Inequalities for Sums of Bounded Random Variables
- Probably Approximately Correct Nash Equilibrium Learning
- Random convex programs
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
- Risk and complexity in scenario optimization
- The complexity of learning according to two models of a drifting environment
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Scenario Approach to Robust Control Design
- Tracking drifting concepts by minimizing disagreements
- Wait-and-judge scenario optimization
This page was built for publication: Finite sample learning of moving targets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851110)
