通过注意力机制优化提升无解码文档重排序精度
HeadRank: Decoding-Free Passage Reranking via Preference-Aligned Attention Heads
- 从注意力权重中直接提取相关性信号,实现零解码推理
- 在40亿参数模型上,中段文档正确排序率提升至57.4%
- 适合追求低延迟且需精细排序的检索系统应用
无解码重排序方法通过直接读取大语言模型的注意力权重获取相关性信号,显著降低延迟,但面临注意力分数同质化问题:中段文档得分几乎相同,破坏了排序所需的细微区分。我们提出HeadRank框架,通过熵正则化头选择、硬相邻级偏好对和分布正则化,在连续注意力空间中实现偏好优化,联合增强同质化中段区域的区分度。在最深层选定层进行深度截断,将推理复杂度降至$/mathcal{O}(1)$次前向传播。在三个Qwen3规模(0.6B–4B)的14个基准测试上,仅用211个训练查询,HeadRank在每个规模下均达到最高平均NDCG@10,多数基准超越生成式与无解码基线,格式成功率100%。在4B模型上,57.4%的相关中段文档进入前四分之一,而无关文档仅14.2%,选择性差距达43个百分点,证明注意力空间偏好对齐在列表重排序中的有效性。
原文摘要 · Abstract (English)
Decoding-free reranking methods that read relevance signals directly from LLM attention weights offer significant latency advantages over autoregressive approaches, yet suffer from attention score homogenization: middle-context documents receive near-identical scores, destroying the fine-grained distinctions required for ranking. We propose HeadRank, a framework that lifts preference optimization from discrete token space into the continuous attention domain through entropy-regularized head selection, hard adjacent-level preference pairs, and a distribution regularizer that jointly sharpen discriminability in the homogenized middle zone. Depth truncation at the deepest selected layer further reduces inference to $\mathcal{O}(1)$ forward passes. Across 14 benchmarks on three Qwen3 scales (0.6B--4B) using only 211 training queries, HeadRank achieves the highest average NDCG@10 at every scale, outperforming both generative and decoding-free baselines on the majority of benchmarks with 100\% formatting success. At 4B, 57.4\% of relevant middle-zone documents reach the top quartile versus 14.2\% for irrelevant ones -- a 43-percentage-point selectivity gap that demonstrates the effectiveness of attention-space preference alignment for listwise reranking.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。