Sample Complexity of Probabilistic Roadmaps via ε-nets.
Matthew TsaoKiril SoloveyMarco PavonePublished in: ICRA (2020)
Keyphrases
- sample complexity
- theoretical analysis
- upper bound
- pac learning
- learning problems
- special case
- active learning
- lower bound
- vc dimension
- learning algorithm
- generalization error
- sample size
- pac learnability
- probabilistic model
- training examples
- supervised learning
- concept classes
- sample complexity bounds
- irrelevant features
- covering numbers
- average case
- linear threshold
- number of irrelevant features