7 citations · 29 across the 42 of their papers we have counts for
4 papers · 1 filter
How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?
Aadirupa Saha, Rakesh Shivanna, Chiranjib Bhattacharyya
We consider the problem of optimal recovery of true ranking of items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assu…
Active Ranking with Subset-wise Preferences
Aadirupa Saha, Aditya Gopalan
We consider the problem of probably approximately correct (PAC) ranking items by adaptively eliciting subset-wise preference feedback. At each round, the learner chooses a subs…
PAC Battling Bandits in the Plackett-Luce Model
Aadirupa Saha, Aditya Gopalan
We introduce the probably approximately correct (PAC) \emph{Battling-Bandit} problem with the Plackett-Luce (PL) subset choice model--an online learning framework where at each tri…
Ranking with Features: Algorithm and A Graph Theoretic Analysis
Aadirupa Saha, Arun Rajkumar
We consider the problem of ranking a set of items from pairwise comparisons in the presence of features associated with the items. Recent works have established that …