统一排序模型提升电商搜索多通道召回效果
Unified Learning-to-Rank for Multi-Channel Retrieval in Large-Scale E-Commerce Search
- 基于查询特征动态融合多通道结果,学习通道间交互关系
- 在线实验显示转化率提升2.85%,延迟低于50毫秒
- 适合关注电商搜索转化优化的工程与算法团队
大规模电商搜索需从海量商品中精准召回各类商品,包括畅销品、新品、趋势品及季节性商品。现代系统依赖多个专用检索通道满足不同目标,但现有基于排名的融合方法(如RRF、加权交错)采用固定全局权重,忽略查询相关的通道效用和跨通道交互。本文将多通道融合重新建模为面向异构候选源的查询相关学习排序问题,提出统一排序模型,联合优化点击、加购、购买等业务指标,并引入近期用户行为信号捕捉短期意图变化。线上A/B实验表明,该方法在保持生产级延迟(p95 < 50ms)的前提下,使用户转化率提升2.85%,已在Target.com上线部署。
原文摘要 · Abstract (English)
Large-scale e-commerce search must surface a broad set of items from a vast catalog, ranging from bestselling products to new, trending, or seasonal items. Modern systems therefore rely on multiple specialized retrieval channels to surface products, each designed to satisfy a specific objective. A key challenge is how to effectively merge documents from these heterogeneous channels into a single ranked list under strict latency constraints while optimizing for business KPIs such as user conversion. Rank-based fusion methods such as Reciprocal Rank Fusion (RRF) and Weighted Interleaving rely on fixed global channel weights and treat channels independently, failing to account for query-specific channel utility and cross-channel interactions. We observe that multi-channel fusion can be reformulated as a query-dependent learning-to-rank problem over heterogeneous candidate sources. In this paper, we propose a unified ranking model that learns to merge and rank documents from multiple retrieval channels. We formulate the problem as a channel-aware learning-to-rank task that jointly optimizes clicks, add-to-carts, and purchases while incorporating channel-specific objectives. We further incorporate recent user behavioral signals to capture short-term intent shifts that are critical for improving conversion in multi-channel ranking. Our online A/B experiments show that the proposed approach outperforms rank-based fusion methods, leading to a +2.85\% improvement in user conversion. The model satisfies production latency requirements, achieving a p95 latency of under 50\,ms, and is deployed on Target.com.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。