arXiv:2602.00899cs.LGcs.IR2026-02被引 1

用语义检索解决电商推荐中的词汇不匹配问题。

Domain-Adaptive and Scalable Dense Retrieval for Content-Based Recommendation

  • 用双塔模型将用户意图与商品信息进行语义匹配。
  • 在82万商品上实现召回率从26%提升至66%。
  • 支持在普通CPU上低延迟部署,模型缩小4倍。

电商平台推荐常依赖稀疏关键词匹配(如BM25),在用户意图与商品描述词汇重合度低时失效。本文将内容推荐转化为检索任务:给定自然语言意图(查询或评论),通过语义相似性从大目录中检索最相关的前K项商品。提出一种基于双塔双编码器的可扩展稠密检索系统,使用监督对比学习与多重负样本排序损失,在Amazon Reviews 2023(时尚类)子集上进行微调。训练数据由评论文本(作为查询代理)和商品元数据(作为正样本文档)构成,共使用5万条采样交互,最大序列长度为500个标记。为高效服务,结合FAISS HNSW索引与ONNX Runtime推理管道,采用INT8动态量化。在包含826,402个商品的评论到标题基准测试中,该方法将Recall@10从BM25的0.26提升至0.66,同时满足实际延迟与模型大小要求:单批次下6.1毫秒中位数CPU推理延迟,模型尺寸减少4倍。整体提供了一个从离线训练到大规模目录上CPU高效服务的端到端、可复现的领域自适应稠密检索方案。

原文摘要 · Abstract (English)

E-commerce recommendation and search commonly rely on sparse keyword matching (e.g., BM25), which breaks down under vocabulary mismatch when user intent has limited lexical overlap with product metadata. We cast content-based recommendation as recommendation-as-retrieval: given a natural-language intent signal (a query or review), retrieve the top-K most relevant items from a large catalog via semantic similarity. We present a scalable dense retrieval system based on a two-tower bi-encoder, fine-tuned on the Amazon Reviews 2023 (Fashion) subset using supervised contrastive learning with Multiple Negatives Ranking Loss. We construct training pairs from review text (as a query proxy) and item metadata (as the positive document) and fine-tune on 50,000 sampled interactions with a maximum sequence length of 500 tokens. For efficient serving, we combine FAISS HNSW indexing with an ONNX Runtime inference pipeline using INT8 dynamic quantization. On a review-to-title benchmark over 826,402 catalog items, our approach improves Recall@10 from 0.26 (BM25) to 0.66, while meeting practical latency and model-size constraints: 6.1 ms median CPU inference latency (batch size 1) and a 4x reduction in model size. Overall, we provide an end-to-end, reproducible blueprint for taking domain-adapted dense retrieval from offline training to CPU-efficient serving at catalog scale.

推荐系统稠密检索语义匹配模型压缩

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。