提出PUB算法,通过平衡参数更新提升多任务推荐模型性能
A Parameter Update Balancing Algorithm for Multi-task Ranking Models in Recommendation Systems
- 基于参数更新而非梯度或损失融合进行多任务优化
- 在多个推荐数据集上超越现有方法,工业部署显著提升流量转化
- 适用于各类多任务学习场景,尤其适合使用Adam等动量优化器的系统
多任务排序模型已成为现代推荐系统的核心。尽管研究多聚焦于特定场景的复杂模型设计,但在多种场景下提升多任务排序模型性能仍是重大挑战。盲目训练所有任务可能导致学习不一致,亟需多任务优化(MTO)方法。传统方法假设共享参数的联合梯度最优即参数更新最优,但实验表明,在使用Adam等动量优化器时,实际参数更新与梯度存在显著偏差。本文提出首个基于参数更新平衡的多任务优化算法PUB。不同于基于梯度或损失融合的传统方法,PUB直接优化各任务间参数更新的平衡。在基准多任务排序数据集上的全面实验表明,PUB持续提升多个多任务骨干模型,并达到最先进性能。此外,在计算机视觉基准数据集上的实验也验证了PUB在多任务学习中的广泛潜力。最后,我们在真实商业平台HUAWEI AppGallery上进行工业评估,PUB显著提升了线上多任务排序模型表现,有效管理关键渠道的主要流量。
原文摘要 · Abstract (English)
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 algorithm for multi-task optimization, denoted as PUB. In contrast to traditional MTO method which are based on gradient level tasks fusion or loss level tasks fusion, PUB is the first work to optimize multiple tasks through parameter update balancing. Comprehensive experiments on benchmark multi-task ranking datasets demonstrate that PUB consistently improves several multi-task backbones and achieves state-of-the-art performance. Additionally, experiments on benchmark computer vision datasets show the great potential of PUB in various multi-task learning scenarios. Furthermore, we deployed our method for an industrial evaluation on the real-world commercial platform, HUAWEI AppGallery, where PUB significantly enhances the online multi-task ranking model, efficiently managing the primary traffic of a crucial channel.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。