Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration.
Lijie ChenAnupam GuptaJian LiMingda QiaoRuosong WangPublished in: CoRR (2017)
Keyphrases
- theoretical analysis
- orders of magnitude
- data structure
- worst case
- learning algorithm
- computational complexity
- dynamic programming
- computational cost
- computationally efficient
- recently developed
- approximately optimal
- sampling algorithm
- graph theory
- search strategies
- convergence rate
- combinatorial optimization
- monte carlo
- optimization problems
- significant improvement
- reinforcement learning
- image segmentation