Talk · Proceedings of the conference - Association for Computational Linguistics. Meeting · January 1, 2026
BracketRank: Large Language Model Document Ranking via Reasoning-based Competitive Elimination
Abdelrahman Abdallah, Mohammed Ali, Bhawna Piryani, Adam Jatowt
Abstract
Reasoning-intensive retrieval requires deep semantic inference beyond surface-level keyword matching, posing a challenge for current LLM-based rerankers limited by context constraints and order sensitivity.We propose BracketRank, a framework that treats document reranking as a reasoning-driven competitive tournament.Our approach introduces three key innovations: (1) adaptive grouping based on model context limits, (2) reasoning-enhanced prompts that mandate step-by-step relevance explanations, and (3) a bracket-style elimination structure with winner and loser tracks.This design ensures robust document advancement while enabling parallel processing across competition stages.Evaluation on the BRIGHT reasoning benchmark shows that BracketRank achieves 26.56 nDCG@10, significantly outperforming state-of-the-art baselines including RankGPT-4 (17.0) and Rank-R1-14B (20.5).On TREC datasets, BracketRank achieves 77.90 nDCG@5 on DL 19 and 75.85 nDCG@5 on DL 20, exceeding all baselines, establishing that explicit reasoning within competitive elimination is a powerful paradigm for complex, multi-step retrieval tasks. 1
More by Abdelrahman Abdallah
- A Paired Printed-Handwritten Arabic Line Dataset for Handwriting Recognition and Cross-Modal RetrievalScientific Data · 2026
- A multilingual Arabic and English receipt dataset for text detection, recognition and information extractionZenodo · 2026
- UIBK-Embedding: Effective Text Retrieval by Unifying Dense and Late-Interaction RetrievalarXiv · 2026
- MemRevise: A Self-Revising Memory for Conversational SearcharXiv · 2026
