6 citations · 24 across the 9 of their papers we have counts for
7 papers · 1 filter
Online Learning to Rank with Top-k Feedback
Sougata Chaudhuri, Ambuj Tewari
We consider two settings of online learning to rank where feedback is restricted to top ranked items. The problem is cast as an online game between a learner and sequence of users,…
Generalization error bounds for learning to rank: Does the length of document lists matter?
Ambuj Tewari, Sougata Chaudhuri
We consider the generalization ability of algorithms for learning to rank at a query level, a problem also called subset ranking. Existing generalization error bounds necessarily d…
Online Learning to Rank with Feedback at the Top
Sougata Chaudhuri, Ambuj Tewari
We consider an online learning to rank setting in which, at each round, an oblivious adversary generates a list of documents, pertaining to a query, and the learner produces sc…
Perceptron like Algorithms for Online Learning to Rank
Sougata Chaudhuri, Ambuj Tewari
Perceptron is a classic online algorithm for learning a classification function. In this paper, we provide a novel extension of the perceptron algorithm to the learning to rank pro…
Online Ranking with Top-1 Feedback
Sougata Chaudhuri, Ambuj Tewari
We consider a setting where a system learns to rank a fixed set of items. The goal is produce good item rankings for users with diverse interests who interact online with the s…
Perceptron-like Algorithms and Generalization Bounds for Learning to Rank
Sougata Chaudhuri, Ambuj Tewari
Learning to rank is a supervised learning problem where the output space is the space of rankings but the supervision space is the space of relevance scores. We make theoretical co…
On Lipschitz Continuity and Smoothness of Loss Functions in Learning to Rank
Ambuj Tewari, Sougata Chaudhuri
In binary classification and regression problems, it is well understood that Lipschitz continuity and smoothness of the loss function play key roles in governing generalization err…