A Theoretical-Empirical Approach to Estimating Sample Complexity of DNNs.
Devansh BislaApoorva Nandini SaridenaAnna ChoromanskaPublished in: CVPR Workshops (2021)
Keyphrases
- sample complexity
- theoretical analysis
- vc dimension
- pac learning
- uniform convergence
- upper bound
- special case
- learning problems
- pac learnability
- supervised learning
- learning algorithm
- concept classes
- number of irrelevant features
- active learning
- generalization error
- linear threshold
- lower bound
- average case
- irrelevant features
- sample complexity bounds
- sample size
- semi supervised learning
- concept class
- computational learning theory
- face recognition