Tag: learning-theory
Concepts
- Agnostic PAC Learning
- Algorithmic Stability and Generalization
- Benign Overfitting and Harmless Interpolation
- Bernstein Bounds and Fast Rates
- Computational vs Statistical Limits of Learning
- Covering Numbers and Metric Entropy
- Generalization Bounds for Dependent Data
- Implicit Regularization
- Information-Theoretic Generalization Bounds
- Leave-One-Out Stability
- Margin-Based Generalization Bounds
- The No Free Lunch Theorem
- Nonparametric Convergence Rates
- Occam's Razor and Minimum Description Length
- PAC-Bayes Bounds
- PAC Learning
- Rademacher Complexity
- Sample Complexity Lower Bounds
- Shattering and the Growth Function
- Structural Risk Minimization
- The Dudley Entropy Integral
- The Fundamental Theorem of Statistical Learning
- The Generalization Gap
- The Perceptron Convergence Theorem
- The Sauer-Shelah Lemma
- The Statistical Query Model
- The Ugly Duckling Theorem
- The Union Bound and Finite Hypothesis Classes
- The VC Generalization Bound
- Uniform Convergence of Empirical Risk
- Universal Consistency of Learning Rules
- VC Dimension
- Weak vs Strong Learnability