通过GPU加速的特征交互,提升广告召回精度并降低计算开销。
An Efficient Embedding Based Ad Retrieval with GPU-Powered Feature Interaction
- 在双塔模型中引入压缩倒排索引,实现大规模高效特征交互。
- 在腾讯广告系统中,离线效果优于现有方法,上线后显著提升性能。
- 首个工业级在召回阶段部署宽深模型的框架,适合大规模推荐系统优化。
在大规模广告推荐系统中,召回是关键环节,需从海量广告库中高效筛选出与用户行为相关的候选广告。基于嵌入的召回(EBR)方法普遍采用双塔网络,在保持召回效率和精度方面表现优异。然而,双塔模型存在明显局限:用户与广告的嵌入仅在最终内积计算时交互,导致特征交互能力不足。尽管已有基于DNN的模型在排序阶段引入用户与广告的早期特征交互以缓解此问题,但其计算开销过大,难以应用于召回阶段。为此,本文提出一种高效的基于GPU的特征交互机制,在双塔网络中显著提升召回准确率,同时大幅降低计算成本。具体而言,我们设计了一种专为GPU加速优化的压缩倒排索引,支持大规模特征交互计算。据我们所知,这是业界首个成功将宽深模型应用于召回系统的框架。该方法已应用于腾讯广告真实业务场景,实验结果表明,其在离线评估中优于现有方法,并成功部署至腾讯广告推荐系统,带来显著在线性能提升。该改进不仅验证了方法的有效性,也为优化大规模广告召回系统提供了新的实践指导。
原文摘要 · Abstract (English)
In large-scale advertising recommendation systems, retrieval serves as a critical component, aiming to efficiently select a subset of candidate ads relevant to user behaviors from a massive ad inventory for subsequent ranking and recommendation. The Embedding-Based Retrieval (EBR) methods modeled by the dual-tower network are widely used in the industry to maintain both retrieval efficiency and accuracy. However, the dual-tower model has significant limitations: the embeddings of users and ads interact only at the final inner product computation, resulting in insufficient feature interaction capabilities. Although DNN-based models with both user and ad as input features, allowing for early-stage interaction between these features, are introduced in the ranking stage to mitigate this issue, they are computationally infeasible for the retrieval stage. To bridge this gap, this paper proposes an efficient GPU-based feature interaction for the dual-tower network to significantly improve retrieval accuracy while substantially reducing computational costs. Specifically, we introduce a novel compressed inverted list designed for GPU acceleration, enabling efficient feature interaction computation at scale. To the best of our knowledge, this is the first framework in the industry to successfully implement Wide and Deep in a retrieval system. We apply this model to the real-world business scenarios in Tencent Advertising, and experimental results demonstrate that our method outperforms existing approaches in offline evaluation and has been successfully deployed to Tencent's advertising recommendation system, delivering significant online performance gains. This improvement not only validates the effectiveness of the proposed method, but also provides new practical guidance for optimizing large-scale ad retrieval systems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。