Sample Complexity of Probabilistic Roadmaps via ε-nets.
Matthew TsaoKiril SoloveyMarco PavonePublished in: CoRR (2019)
Keyphrases
- sample complexity
- theoretical analysis
- pac learning
- learning algorithm
- learning problems
- generalization error
- vc dimension
- special case
- supervised learning
- upper bound
- active learning
- lower bound
- sample size
- probabilistic model
- sample complexity bounds
- pac learnability
- irrelevant features
- concept classes
- training examples
- linear threshold
- covering numbers
- number of irrelevant features
- cross validation
- average case
- noisy data
- data sets
- np hard
- feature selection
- machine learning