# Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration

4 Jun 2017Lijie ChenAnupam GuptaJian LiMingda QiaoRuosong Wang

We study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given $n$ arms with unknown reward distributions, as well as a family $\mathcal{F}$ of feasible subsets over the arms... (read more)

PDF Abstract

No code implementations yet. Submit your code now