Optimal Quantum Sample Complexity of Learning Algorithms.
Srinivasan ArunachalamRonald de WolfPublished in: Computational Complexity Conference (2017)
Keyphrases
- sample complexity
- learning algorithm
- learning problems
- theoretical analysis
- generalization error
- supervised learning
- active learning
- pac learning
- vc dimension
- special case
- upper bound
- machine learning algorithms
- lower bound
- dynamic programming
- sample size
- training examples
- training data
- linear threshold
- learning tasks
- concept classes
- uniform convergence
- optimal solution
- objective function
- reinforcement learning
- worst case
- learning process
- high dimensional
- pac learning model
- number of irrelevant features