Minimax Sample Complexity for Turn-based Stochastic Game.
Qiwen CuiLin F. YangPublished in: CoRR (2020)
Keyphrases
- sample complexity
- theoretical analysis
- game tree
- imperfect information
- learning problems
- vc dimension
- upper bound
- special case
- pac learning
- active learning
- minimax search
- learning algorithm
- supervised learning
- generalization error
- monte carlo
- lower bound
- sample size
- training examples
- game playing
- worst case
- pac learnability
- evaluation function
- concept classes
- video games
- machine learning algorithms
- irrelevant features
- sample complexity bounds
- uniform convergence
- data sets