Reasoning and predicting POMDP planning complexity via covering numbers.
Zongzhang ZhangQi-ming FuXiaofang ZhangQuan LiuPublished in: Frontiers Comput. Sci. (2016)
Keyphrases
- covering numbers
- planning problems
- uniform convergence
- partially observable markov decision processes
- partially observable
- decision problems
- vc dimension
- reinforcement learning
- worst case
- learning rate
- belief state
- state space
- gaussian kernels
- sample complexity
- lower bound
- optimal policy
- finite state
- semi supervised
- dynamic programming
- vapnik chervonenkis dimension
- machine learning