用动态推理取代静态匹配,提升复杂查询的检索效果。
CRE-T1 Preview Technical Report: Beyond Contrastive Learning for Reasoning-Intensive Retrieval
- Query端生成中间推理路径,文档端用<embtoken>聚合语义,实现动态匹配
- 在BRIGHT基准上,T1-4B优于对比学习大模型,接近多阶段流水线效果
- 适合需要深度逻辑推理的检索任务,如科研问答、复杂查询场景
推理密集型检索的核心挑战在于识别查询与文档之间的隐式推理关系,而非表面语义或词汇相似性。对比学习本质上是静态表征固化技术:训练时将层次化相关概念编码为向量空间中的固定几何结构,推理时无法根据具体查询需求动态调整相关性判断。因此,在查询与文档存在词汇不匹配或需隐式推理时性能显著下降。本文提出Thought 1(T1),一种生成式检索模型,将相关性建模从静态对齐转向动态推理。查询端,T1为每个查询动态生成中间推理轨迹,以<embtoken>作为推理输出的语义聚合点;文档端采用instruction + text + <embtoken>编码格式,支持高吞吐索引。为将动态推理能力内化至向量表示,采用三阶段训练流程,并在第三阶段引入GRPO,通过试错式强化学习让模型学习不同查询的最优推导策略。在BRIGHT基准上,T1-4B在原始查询设置下表现优异,整体优于更大规模的对比学习模型,且达到与多阶段检索流水线相当的性能。结果表明,用动态推理生成替代静态表征对齐,可有效提升推理密集型检索性能。
原文摘要 · Abstract (English)
The central challenge of reasoning-intensive retrieval lies in identifying implicitreasoning relationships between queries and documents, rather than superficial se-mantic or lexical similarity. The contrastive learning paradigm is fundamentallya static representation consolidation technique: during training, it encodes hier-archical relevance concepts into fixed geometric structures in the vector space,and at inference time it cannot dynamically adjust relevance judgments accord-ing to the specific reasoning demands of each query. Consequently, performancedegrades noticeably when vocabulary mismatch exists between queries and doc-uments or when implicit reasoning is required to establish relevance. This pa-per proposes Thought 1 (T1), a generative retrieval model that shifts relevancemodeling from static alignment to dynamic reasoning. On the query side, T1 dy-namically generates intermediate reasoning trajectories for each query to bridgeimplicit reasoning relationships and uses <embtoken> as a semantic aggregationpoint for the reasoning output. On the document side, it employs an instruction+ text + <embtoken> encoding format to support high-throughput indexing. Tointernalize dynamic reasoning capabilities into vector representations, we adopt athree-stage training curriculum and introduce GRPO in the third stage, enablingthe model to learn optimal derivation strategies for different queries through trial-and-error reinforcement learning. On the BRIGHT benchmark, T1-4B exhibitsstrong performance under the original query setting, outperforming larger modelstrained with contrastive learning overall, and achieving performance comparableto multi-stage retrieval pipelines. The results demonstrate that replacing static rep-resentation alignment with dynamic reasoning generation can effectively improvereasoning-intensive retrieval performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。