Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning.
Christoph DannEmma BrunskillPublished in: NIPS (2015)
Keyphrases
- sample complexity
- reinforcement learning
- learning problems
- learning algorithm
- supervised learning
- theoretical analysis
- vc dimension
- pac learning
- lower bound
- active learning
- upper bound
- special case
- generalization error
- pac learnability
- training examples
- machine learning
- sample complexity bounds
- concept classes
- irrelevant features
- covering numbers
- machine learning algorithms
- state space
- dynamic programming
- optimal policy
- markov decision processes
- sample size
- data mining
- sequential decision problems