arXiv:2507.04820cs.IR2025-07被引 1

用少量样本蒸馏让大模型排序更高效,性能接近原方法

Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation

  • 用PRP生成标签,蒸馏出轻量点式排序模型
  • 仅需2%配对数据,就能达到全量配对的性能
  • 适合需要高精度且低延迟的文档排序场景

尽管基于大语言模型的成对排序提示(PRP)是目前最有效的零样本文档排序方法之一,但其计算复杂度随待排序文档数量呈二次增长,因为需要枚举所有可能的文档对。这使得PRP在大多数实际应用中难以落地。本文提出通过成对蒸馏来利用PRP的效果:从PRP生成的成对教师标签中,蒸馏一个点式学生排序模型,使学生模型在显著降低计算开销的同时保持与PRP相当的性能。此外,我们发现蒸馏过程可实现样本高效——仅使用2%的文档对即可获得与使用全部配对相同的性能。因此,该方法在训练和推理阶段均避免了高昂的计算成本,为高效利用PRP性能提供了可行方案。

原文摘要 · Abstract (English)

While Pairwise Ranking Prompting (PRP) with Large Language Models (LLMs) is one of the most effective zero-shot document ranking methods, it has a quadratic computational complexity with respect to the number of documents to be ranked, as it requires an enumeration over all possible document pairs. Consequently, the outstanding ranking performance of PRP has remained unreachable for most real-world ranking applications. In this work, we propose to harness the effectiveness of PRP through pairwise distillation. Specifically, we distill a pointwise student ranker from pairwise teacher labels generated by PRP, resulting in an efficient student model that retains the performance of PRP with substantially lower computational costs. Furthermore, we find that the distillation process can be made sample-efficient: with only 2% of pairs, we are able to obtain the same performance as using all pairs for teacher labels. Thus, our novel approach provides a solution to harness the ranking performance of PRP without incurring high computational costs during both distillation and serving.

排序蒸馏高效排序大模型应用

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