
Adversarial Dueling Bandits
We introduce the problem of regret minimization in Adversarial Dueling B...
read it

Improved Sleeping Bandits with Stochastic Actions Sets and Adversarial Rewards
In this paper, we consider the problem of sleeping bandits with stochast...
read it

Regret Minimization in Stochastic Contextual Dueling Bandits
We consider the problem of stochastic Karmed dueling bandit in the cont...
read it

Bestitem Learning in Random Utility Models with Subset Choices
We consider the problem of PAC learning the most valuable item from a po...
read it

From PAC to InstanceOptimal Sample Complexity in the PlackettLuce Model
We consider PAC learning for identifying a good item from subsetwise sa...
read it

Regret Minimisation in Multinomial Logit Bandits
We consider two regret minimisation problems over subsets of a finite gr...
read it

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...
read it

Active Ranking with Subsetwise Preferences
We consider the problem of probably approximately correct (PAC) ranking ...
read it

PACBattling Bandits with PlackettLuce: Tradeoff between Sample Complexity and Subset Size
We introduce the probably approximately correct (PAC) version of the pro...
read it

Ranking with Features: Algorithm and A Graph Theoretic Analysis
We consider the problem of ranking a set of items from pairwise comparis...
read it
Aadirupa Saha
is this you? claim profile