U-rank: Utility-oriented Learning to Rank with Implicit Feedback
Learning to rank with implicit feedback is one of the most important tasks in many real-world information systems where the objective is some specific utility, e.g., clicks and revenue. However, we point out that existing methods based on probabilistic ranking principle do not necessarily achieve the highest utility. To this end, we propose a novel ranking framework called U-rank that directly optimizes the expected utility of the ranking list. With a position-aware deep click-through rate prediction model, we address the attention bias considering both query-level and item-level features. Due to the item-specific attention bias modeling, the optimization for expected utility corresponds to a maximum weight matching on the item-position bipartite graph. We base the optimization of this objective in an efficient Lambdaloss framework, which is supported by both theoretical and empirical analysis. We conduct extensive experiments for both web search and recommender systems over three benchmark datasets and two proprietary datasets, where the performance gain of U-rank over state-of-the-arts is demonstrated. Moreover, our proposed U-rank has been deployed on a large-scale commercial recommender and a large improvement over the production baseline has been observed in an online A/B testing.
Code (0)
등록된 구현이 없습니다.
Tasks
Click-Through Rate PredictionLearning-To-RankPositionRecommendation SystemsSimilar Papers 제목 키워드 기반
FairGAN: GANs-based Fairness-aware Learning for Recommendations with Implicit Feedback
Ranking algorithms in recommender systems influence people to make decisions. Conventional ranking algorithms based on implicit feedback data aim to maximize the utility to users by capturing users’ preferences over item…
Exposure FairnessFairnessRecommendation SystemsDensity-Ratio Based Personalised Ranking from Implicit Feedback
Learning from implicit user feedback is challenging as we can only observe positive samples but never access negative ones. Most conventional methods cope with this issue by adopting a pairwise ranking approach with nega…
Density Ratio EstimationControlling Fairness and Bias in Dynamic Learning-to-Rank
Rankings are the primary interface through which many online platforms match users to items (e.g. news, products, music, video). In these two-sided markets, not only the users draw utility from the rankings, but the rank…
ArticlesFairnessLearning-To-RankRankFormer: Listwise Learning-to-Rank Using Listwide Labels
Web applications where users are presented with a limited selection of items have long employed ranking models to put the most relevant results first. Any feedback received from users is typically assumed to reflect a re…
Knowledge DistillationLearning-To-RankPolicy-Gradient Training of Fair and Unbiased Ranking Functions
While implicit feedback (e.g., clicks, dwell times, etc.) is an abundant and attractive source of data for learning to rank, it can produce unfair ranking policies for both exogenous and endogenous reasons. Exogenous rea…
counterfactualDecision MakingFairnessLearning-To-Rank