ConceptAI & ML
Sample complexity
The number of samples required by an algorithm to achieve a certain level of performance with high probability.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Empirical error1Estimation1Probability1Probability bounds1Reinforcement learning1Reinforcement learning algorithms1Risk minimization1Statistical learning1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Shahar Mendelson
The cardinality of the sample needed to ensure a desired accuracy with a given high probability.Nika Haghtalab
The number of samples and the quality of the estimator needed to achieve convergence in the game-playing dynamics.Andrea Zanette
The number of samples an algorithm needs to achieve a desired level of performance.
Lectures that assume it
2Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Probability
- Reinforcement learning
- VC dimension
- Data-driven algorithm design
- Empirical risk minimization
- IID sampling structure
Show 1 moreShow fewer
Lectures6
- RL Theory
- AI in Science and Engineering: The Role of Academia in Understanding AI
- Multi-objective Learning: An Algorithmic Toolbox for Optimal Predictions Anytime Anywhere
- Towards a Statistical Foundation for Reinforcement Learning
- Theory of Modern AI: Learning Theoretic, Game Theoretic, and Algorithmic Perspectives
- Red Points and Blue Points