7 citations · 17 across the 12 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.LG2020
A One-Size-Fits-All Solution to Conservative Bandit Problems
Yihan Du, Siwei Wang, Longbo Huang
In this paper, we study a family of conservative bandit problems (CBPs) with sample-path reward constraints, i.e., the learner's reward performance must be at least as well as a gi…
cs.LG2020★ 7 cited
Combinatorial Pure Exploration of Dueling Bandit
Wei Chen, Yihan Du, Longbo Huang +1
In this paper, we study combinatorial pure exploration for dueling bandits (CPE-DB): we have multiple candidates for multiple positions as modeled by a bipartite graph, and in each…
cs.LG2020★ 3 cited
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback
Yihan Du, Yuko Kuroki, Wei Chen
In this paper, we first study the problem of combinatorial pure exploration with full-bandit feedback (CPE-BL), where a learner is given a combinatorial action space $\mathcal{X} \…