Improved Sample Complexity for Incremental Autonomous Exploration in MDPs.
Jean TarbouriechMatteo PirottaMichal ValkoAlessandro LazaricPublished in: NeurIPS (2020)
Keyphrases
- sample complexity
- pac learning
- theoretical analysis
- learning problems
- upper bound
- markov decision processes
- learning algorithm
- special case
- vc dimension
- sample complexity bounds
- reinforcement learning
- active learning
- supervised learning
- lower bound
- covering numbers
- generalization error
- training examples
- dynamic programming
- irrelevant features
- sample size
- data mining
- number of irrelevant features
- machine learning algorithms
- computational complexity