Minimax sample complexity for turn-based stochastic game.
Qiwen CuiLin F. YangPublished in: UAI (2021)
Keyphrases
- evaluation function
- sample complexity
- minimax search
- game tree
- theoretical analysis
- pac learning
- learning problems
- learning algorithm
- vc dimension
- active learning
- upper bound
- supervised learning
- special case
- generalization error
- lower bound
- training examples
- imperfect information
- concept classes
- game playing
- pac learnability
- monte carlo
- sample size
- sample complexity bounds
- number of irrelevant features
- average case
- video games
- worst case
- e learning
- irrelevant features
- small number