HeadRank: Decoding-Free Passage Reranking via Preference-Aligned Attention Heads
On the map: LLM alignment / RLHF / preference optimisation → Preference alignment for recommenders and RAG
Abstract (arXiv)
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 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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Preference alignment for recommenders and RAG, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 20 of its 28 references that are in the map. First posted on arXiv 19 Apr 2026.
Builds on
20 of 28 references.
References · 20
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,371
- 2019Attention is not not Explanationcited by 629
- 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
- 2019Is Attention Interpretable?cited by 387
- 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
- 2023Large Language Models for Information Retrieval: A Surveycited by 331
- 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
- 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 271
- 2024Retrieval Head Mechanistically Explains Long-Context Factualitycited by 219
8 more
- 2023Attention Sorting Combats Recency Bias In Long Context Language Modelscited by 89
- 2023Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labelscited by 86
- 2025Which Attention Heads Matter for In-Context Learning?cited by 61
- 2025Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learningcited by 58
- 2023Open-source Large Language Models are Strong Zero-shot Query Likelihood Models for Document Rankingcited by 44
- 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankerscited by 42
- 2025Query-Focused Retrieval Heads Improve Long-Context Reasoning and Re-rankingcited by 30
- 2025Contrastive Retrieval Heads Improve Attention-Based Re-Rankingcited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Recall Before You Rank: Similarity-Guided Top-K Reuse for Efficient Long-Context Attention
- 2026ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression
- 2025Gumbel Reranking: Differentiable End-to-End Reranker Optimization
- 2026KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking
- 2026jina-reranker-v3.5: An Efficient Listwise Reranker with Hybrid Attention and Self-Distillation
- 2026Beyond Polarization: The Generative Constraint of Chain-of-Thought in Pointwise Reranking
- 2026From Saliency to Discriminability: Rank-Preserving Visual Token Pruning for VLM Rerankers
- 2026BoundaryMORPH: Budgeted Reranking via Active Set Selection for Diffuse Retrieval