A Parameter Update Balancing Algorithm for Multi-task Ranking Models in Recommendation Systems
Jun Yuan, Guohao Cai, Zhenhua Dong

TL;DR
This paper introduces PUB, a novel parameter update balancing algorithm for multi-task ranking models that improves performance across various scenarios and is effective in real-world industrial applications.
Contribution
PUB is the first method to optimize multi-task learning through parameter update balancing, addressing limitations of gradient-based approaches especially with momentum optimizers.
Findings
PUB improves multi-task ranking models on benchmark datasets.
PUB achieves state-of-the-art performance in multi-task learning.
PUB significantly enhances online ranking in a commercial platform.
Abstract
Multi-task ranking models have become essential for modern real-world recommendation systems. While most recommendation researches focus on designing sophisticated models for specific scenarios, achieving performance improvement for multi-task ranking models across various scenarios still remains a significant challenge. Training all tasks naively can result in inconsistent learning, highlighting the need for the development of multi-task optimization (MTO) methods to tackle this challenge. Conventional methods assume that the optimal joint gradient on shared parameters leads to optimal parameter updates. However, the actual update on model parameters may deviates significantly from gradients when using momentum based optimizers such as Adam, and we design and execute statistical experiments to support the observation. In this paper, we propose a novel Parameter Update Balancing…
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
TopicsRecommender Systems and Techniques
MethodsAdam · Focus
