解决工业级多任务推荐中任务间负迁移问题,提升推荐效果。
MultiBalance: Multi-Objective Gradient Balancing in Industrial-Scale Multi-Task Recommendation System
- 通过梯度平衡机制动态调节各任务优化方向。
- 在Meta大规模推荐系统上实现0.738%的熵指标提升。
- 无需调参且不降低推理速度,适合实际部署。
在工业级推荐系统中,多任务学习通过联合训练多个任务以节省资源并提升性能,但常因负迁移导致部分任务优化不佳。为此,本文提出适用于工业规模的梯度平衡方法MultiBalance,通过平衡每个任务对共享特征表示的梯度,缓解负迁移问题,避免昂贵的网格搜索或人工调参。与以往仅平衡共享参数梯度的方法相比,MultiBalance仅需访问任务关于共享特征表示的梯度,效率更高。在Meta的大规模广告与内容流多任务推荐系统上实验显示,该方法在查询每秒(QPS)不变的情况下,实现了0.738%的归一化熵(NE)提升,显著优于以往方法(其性能下降70~80% QPS)。
原文摘要 · Abstract (English)
In industrial recommendation systems, multi-task learning (learning multiple tasks simultaneously on a single model) is a predominant approach to save training/serving resources and improve recommendation performance via knowledge transfer between the joint learning tasks. However, multi-task learning often suffers from negative transfer: one or several tasks are less optimized than training them separately. To carefully balance the optimization, we propose a gradient balancing approach called MultiBalance, which is suitable for industrial-scale multi-task recommendation systems. It balances the per-task gradients to alleviate the negative transfer, while saving the huge cost for grid search or manual explorations for appropriate task weights. Moreover, compared with prior work that normally balance the per-task gradients of shared parameters, MultiBalance is more efficient since only requiring to access per-task gradients with respect to the shared feature representations. We conduct experiments on Meta's large-scale ads and feeds multi-task recommendation system, and observe that MultiBalance achieves significant gains (e.g., 0.738% improvement for normalized entropy (NE)) with neutral training cost in Queries Per Second (QPS), which is significantly more efficient than prior methods that balance per-task gradients of shared parameters with 70~80% QPS degradation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。