4 citations · 4 across the 2 of their papers we have counts for
8 papers
Optimizing Ranking Systems Online as Bandits
Chang Li
Ranking system is the core part of modern retrieval and recommender systems, where the goal is to rank candidate items given user contexts. Optimizing ranking systems online means…
Federated Unbiased Learning to Rank
Chang Li, Hua Ouyang
Unbiased Learning to Rank (ULTR) studies the problem of learning a ranking function based on biased user interactions. In this framework, ULTR algorithms have to rely on a large am…
Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity
Chang Li, Haoyun Feng, Maarten de Rijke
Relevance ranking and result diversification are two core areas in modern recommender systems. Relevance ranking aims at building a ranked list sorted in decreasing order of item r…
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model
Chang Li, Maarten de Rijke
Non-stationarity appears in many online applications such as web search and advertising. In this paper, we study the online learning to rank problem in a non-stationary environment…
Online Learning to Rank with List-level Feedback for Image Filtering
Chang Li, Artem Grotov, Ilya Markov +1
Online learning to rank (OLTR) via implicit feedback has been extensively studied for document retrieval in cases where the feedback is available at the level of individual items.…
MergeDTS: A Method for Effective Large-Scale Online Ranker Evaluation
Chang Li, Ilya Markov, Maarten de Rijke +1
Online ranker evaluation is one of the key challenges in information retrieval. While the preferences of rankers can be inferred by interleaving methods, the problem of how to effe…