Combinatorial Pure Exploration with Bottleneck Reward Function

Neural Information Processing Systems 

In this paper, we study the Combinatorial Pure Exploration problem with the Bottleneck reward function (CPE-B) under the fixed-confidence (FC) and fixed-budget (FB) settings.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found