arXiv:2508.09539cs.IR2025-08AAAI被引 11

小模型实现高效推理,无需生成思维链即可精准排序

TFRank: Think-Free Reasoning Enables Practical Pointwise LLM Ranking

  • 用小模型+思维切换机制,训练时用思维链,推理时跳过
  • 参数量仅为四倍大模型的1/4,性能接近其在BRIGHT上的表现
  • 适合需要低延迟的线上搜索系统部署

基于大语言模型(LLM)的推理密集型排序模型虽有进展,但普遍依赖大规模模型和显式思维链(CoT),导致计算成本高、延迟大,难以实际应用。为此,我们提出TFRank,一种基于小规模模型的高效点对点推理排序器。通过融合思维链数据、细粒度分数监督与多任务训练,提升排序效果;并引入“思维模式切换”和点对点格式约束,实现训练时使用推理、推理时零思维链生成的“无思考”能力。实验表明,TFRank在BRIGHT基准上性能相当于参数量四倍大的模型,在BEIR上也表现出色。分析显示其在性能与效率间取得良好平衡,为实际系统集成先进推理能力提供可行方案。代码与数据已开源。

原文摘要 · Abstract (English)

Reasoning-intensive ranking models built on Large Language Models (LLMs) have made notable progress. However, existing approaches often rely on large-scale LLMs and explicit Chain-of-Thought (CoT) reasoning, resulting in high computational cost and latency that limit real-world use. To address this, we propose \textbf{TFRank}, an efficient pointwise reasoning ranker based on small-scale LLMs. To improve ranking performance, TFRank effectively integrates CoT data, fine-grained score supervision, and multi-task training. Furthermore, it achieves an efficient ``\textbf{T}hink-\textbf{F}ree" reasoning capability by employing a ``think-mode switch'' and pointwise format constraints. Specifically, this allows the model to leverage explicit reasoning during training while delivering precise relevance scores for complex queries at inference without generating any reasoning chains. Experiments show that TFRank achieves performance comparable to models with four times more parameters on the BRIGHT benchmark and demonstrates strong competitiveness on the BEIR benchmark. Further analysis shows that TFRank achieves an effective balance between performance and efficiency, providing a practical solution for integrating advanced reasoning into real-world systems. Our code and data are released in the repository: https://github.com/JOHNNY-fans/TFRank.

排序模型小模型推理效率点对点

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