17 citations · 29 across the 5 of their papers we have counts for
Showing cs.LGShow all
3 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.LG2017★ 17 cited
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Lijie Chen, Jian Li, Mingda Qiao
In the Best--Arm problem, we are given stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the arms with the largest…
cs.LG2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Lijie Chen, Anupam Gupta, Jian Li
We study the pure exploration problem subject to a matroid constraint (Best-Basis) in a stochastic multi-armed bandit game. In a Best-Basis instance, we are given stochastic ar…