Pairwise Ranking Loss for Multi-Task Learning in Recommender Systems
Furkan Durmus, Hasan Saribas, Said Aldemir, Junyan Yang, Hakan, Cevikalp

TL;DR
This paper introduces a pairwise ranking loss for multi-task learning in recommender systems, improving the differentiation between conversion and click tasks, leading to better predictive performance.
Contribution
It proposes a novel pairwise ranking loss that leverages conversion exposure labels to enhance multi-task learning models in recommender systems.
Findings
The proposed loss outperforms BCE loss in most cases based on AUC.
Experiments on four public datasets and one industrial dataset validate the effectiveness.
The method improves task-specific differentiation in multi-task learning models.
Abstract
Multi-Task Learning (MTL) plays a crucial role in real-world advertising applications such as recommender systems, aiming to achieve robust representations while minimizing resource consumption. MTL endeavors to simultaneously optimize multiple tasks to construct a unified model serving diverse objectives. In online advertising systems, tasks like Click-Through Rate (CTR) and Conversion Rate (CVR) are often treated as MTL problems concurrently. However, it has been overlooked that a conversion () necessitates a preceding click (). In other words, while certain CTR tasks are associated with corresponding conversions, others lack such associations. Moreover, the likelihood of noise is significantly higher in CTR tasks where conversions do not occur compared to those where they do, and existing methods lack the ability to differentiate between these two scenarios. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Recommender Systems and Techniques · Machine Learning and Algorithms
