轻量级多任务学习框架,提升电商搜索排序效果
Residual Multi-Task Learner for Applied Ranking
- 通过残差连接实现任务间高效信息共享
- 线上测试提升1.29%订单转化率,无延迟增加
- 适合需要高效部署的工业级推荐系统
现代电商平台依赖建模多种用户反馈以提供个性化服务,多任务学习已成为其排序系统的核心。然而,现有方法存在两大问题:部分未显式建模任务间关系,导致性能不佳;另一些则因计算复杂、可扩展性差或依赖强假设而适用性受限。为应对这些挑战并契合虾皮搜索预排序的实际场景,本文提出ResFlow——一种轻量级多任务学习框架,通过任务网络对应层间的残差连接实现高效的跨任务信息共享。在多种场景与模态的数据集上进行的大量实验表明,其性能优于当前最优方法。虾皮搜索的在线A/B测试验证了其实际价值:在不增加系统延迟的前提下,订单转化率(OPU)提升1.29%。目前ResFlow已全面部署于虾皮搜索的预排序模块。为支持高效在线部署,我们提出新的离线指标Weighted Recall@K,与线上指标OPU高度一致,解决了长期存在的线上线下指标不匹配问题。此外,我们采用任务得分加法融合方式,优于传统的乘法融合。代码已开源。
原文摘要 · Abstract (English)
Modern e-commerce platforms rely heavily on modeling diverse user feedback to provide personalized services. Consequently, multi-task learning has become an integral part of their ranking systems. However, existing multi-task learning methods encounter two main challenges: some lack explicit modeling of task relationships, resulting in inferior performance, while others have limited applicability due to being computationally intensive, having scalability issues, or relying on strong assumptions. To address these limitations and better fit our real-world scenario, pre-rank in Shopee Search, we introduce in this paper ResFlow, a lightweight multi-task learning framework that enables efficient cross-task information sharing via residual connections between corresponding layers of task networks. Extensive experiments on datasets from various scenarios and modalities demonstrate its superior performance and adaptability over state-of-the-art methods. The online A/B tests in Shopee Search showcase its practical value in large-scale industrial applications, evidenced by a 1.29% increase in OPU (order-per-user) without additional system latency. ResFlow is now fully deployed in the pre-rank module of Shopee Search. To facilitate efficient online deployment, we propose a novel offline metric Weighted Recall@K, which aligns well with our online metric OPU, addressing the longstanding online-offline metric misalignment issue. Besides, we propose to fuse scores from the multiple tasks additively when ranking items, which outperforms traditional multiplicative fusion. The code is released at https://github.com/BrunoTruthAlliance/ResFlow
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。