Learning to Rank For Push Notifications Using Pairwise Expected Regret
Information Retrieval
2022-01-20 v1 Machine Learning
Abstract
Listwise ranking losses have been widely studied in recommender systems. However, new paradigms of content consumption present new challenges for ranking methods. In this work we contribute an analysis of learning to rank for personalized mobile push notifications and discuss the unique challenges this presents compared to traditional ranking problems. To address these challenges, we introduce a novel ranking loss based on weighting the pairwise loss between candidates by the expected regret incurred for misordering the pair. We demonstrate that the proposed method can outperform prior methods both in a simulated environment and in a production experiment on a major social network.
Cite
@article{arxiv.2201.07681,
title = {Learning to Rank For Push Notifications Using Pairwise Expected Regret},
author = {Yuguang Yue and Yuanpu Xie and Huasen Wu and Haofeng Jia and Shaodan Zhai and Wenzhe Shi and Jonathan J Hunt},
journal= {arXiv preprint arXiv:2201.07681},
year = {2022}
}