75 citations · 200 across the 26 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2017★ 7 cited
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Lijie Chen, Anupam Gupta, Jian Li +2
We study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given arms with unknown reward distributions, as…
cs.LG2016★ 75 cited
Combinatorial Multi-Armed Bandit with General Reward Functions
Wei Chen, Wei Hu, Fu Li +3
In this paper, we study the stochastic combinatorial multi-armed bandit (CMAB) framework that allows a general nonlinear reward function, whose expected value may not depend only o…