research
∙
10/27/2020
Adversarial Dueling Bandits
We introduce the problem of regret minimization in Adversarial Dueling B...
share
research
∙
04/14/2020
Improved Sleeping Bandits with Stochastic Actions Sets and Adversarial Rewards
In this paper, we consider the problem of sleeping bandits with stochast...
research
∙
02/20/2020
Regret Minimization in Stochastic Contextual Dueling Bandits
We consider the problem of stochastic K-armed dueling bandit in the cont...
research
∙
02/19/2020
Best-item Learning in Random Utility Models with Subset Choices
We consider the problem of PAC learning the most valuable item from a po...
research
∙
03/01/2019
From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model
We consider PAC learning for identifying a good item from subset-wise sa...
research
∙
03/01/2019
Regret Minimisation in Multinomial Logit Bandits
We consider two regret minimisation problems over subsets of a finite gr...
research
∙
11/06/2018
How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?
We consider the problem of optimal recovery of true ranking of n items f...
research
∙
10/23/2018
Active Ranking with Subset-wise Preferences
We consider the problem of probably approximately correct (PAC) ranking ...
research
∙
08/12/2018
PAC-Battling Bandits with Plackett-Luce: Tradeoff between Sample Complexity and Subset Size
We introduce the probably approximately correct (PAC) version of the pro...
research
∙
08/11/2018