7 citations · 8 across the 2 of their papers we have counts for
4 papers
Dueling Bandits: From Two-dueling to Multi-dueling
Yihan Du, Siwei Wang, Longbo Huang
We study a general multi-dueling bandit problem, where an agent compares multiple options simultaneously and aims to minimize the regret due to selecting suboptimal arms. This sett…
Combinatorial Pure Exploration with Bottleneck Reward Function
Yihan Du, Yuko Kuroki, Wei Chen
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. In CP…
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…
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} \…