统一生成式大模型提升小红书搜索的多任务查询理解能力
QP-OneModel: A Unified Generative LLM for Multi-Task Query Understanding in Xiaohongshu Search
- 将多种查询理解任务统一为序列生成,通过三阶段对齐与多奖励强化学习优化
- 在命名实体识别和词权重任务上分别提升9.01%和9.31%的F1值
- 适合需要统一处理复杂搜索意图的社交平台技术团队参考
查询处理(QP)在大规模社交网络服务(SNS)搜索引擎中连接用户意图与内容供给。传统QP系统依赖孤立的判别式模型(如BERT),存在语义理解有限、维护成本高问题。尽管大语言模型(LLM)提供潜在解决方案,但现有方法常孤立优化子任务,忽略内在语义协同,需独立迭代。标准生成方法缺乏对SNS场景的适配,难以衔接开放域语料与非正式社交语言风格,且难以满足严格业务定义。本文提出QP-OneModel,一个面向SNS领域的统一生成式大模型,用于多任务查询理解。我们将异构子任务重构为统一序列生成范式,采用渐进式三阶段对齐策略,最终结合多奖励强化学习。此外,QP-OneModel生成意图描述作为高保真语义信号,有效增强下游任务如查询重写与排序。离线评估显示,其整体性能相比判别式基线提升7.35%,命名实体识别(NER)F1提升9.01%,词权重任务提升9.31%。在未见过的任务上,其准确率超越32B模型7.60%。已在小红书全面部署,线上A/B测试验证其工业价值:检索相关性(DCG)提升0.21%,用户留存率提高0.044%。
原文摘要 · Abstract (English)
Query Processing (QP) bridges user intent and content supply in large-scale Social Network Service (SNS) search engines. Traditional QP systems rely on pipelines of isolated discriminative models (e.g., BERT), suffering from limited semantic understanding and high maintenance overhead. While Large Language Models (LLMs) offer a potential solution, existing approaches often optimize sub-tasks in isolation, neglecting intrinsic semantic synergy and necessitating independent iterations. Moreover, standard generative methods often lack grounding in SNS scenarios, failing to bridge the gap between open-domain corpora and informal SNS linguistic patterns, while struggling to adhere to rigorous business definitions. We present QP-OneModel, a Unified Generative LLM for Multi-Task Query Understanding in the SNS domain. We reformulate heterogeneous sub-tasks into a unified sequence generation paradigm, adopting a progressive three-stage alignment strategy culminating in multi-reward Reinforcement Learning. Furthermore, QP-OneModel generates intent descriptions as a novel high-fidelity semantic signal, effectively augmenting downstream tasks such as query rewriting and ranking. Offline evaluations show QP-OneModel achieves a 7.35% overall gain over discriminative baselines, with significant F1 boosts in NER (+9.01%) and Term Weighting (+9.31%). It also exhibits superior generalization, surpassing a 32B model by 7.60% accuracy on unseen tasks. Fully deployed at Xiaohongshu, online A/B tests confirm its industrial value, optimizing retrieval relevance (DCG) by 0.21% and lifting user retention by 0.044%.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。