Learned Ranking Function: From Short-term Behavior Predictions to Long-term User Satisfaction
We present the Learned Ranking Function (LRF), a system that takes short-term user-item behavior predictions as input and outputs a slate of recommendations that directly optimizes for long-term user satisfaction. Most previous work is based on optimizing the hyperparameters of a heuristic function. We propose to model the problem directly as a slate optimization problem with the objective of maximizing long-term user satisfaction. We also develop a novel constraint optimization algorithm that stabilizes objective tradeoffs for multi-objective optimization. We evaluate our approach with live experiments and describe its deployment on YouTube.
Authors
- Lukasz Heldt (ORCID: https://orcid.org/0009-0003-0593-7345)
- Daryl Chang (ORCID: https://orcid.org/0009-0003-2100-6161)
- Li Wei (ORCID: https://orcid.org/0009-0008-9321-3983)
- Zhe Zhao (ORCID: https://orcid.org/0000-0002-6847-0186)
- Yi Wu (ORCID: https://orcid.org/0009-0005-9363-2086)
- Jennifer She
Institutions
- Google (United States) (US)
Publication Details
- Published
- 2024-10-08
- DOI
- https://doi.org/10.1145/3640457.3688184
- Primary Topic
- Recommender Systems and Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00