Pith. sign in

REVIEW 4 cited by

TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.11678 v2 pith:4N7WVTUX submitted 2024-06-17 cs.IR cs.CL

TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy

classification cs.IR cs.CL
keywords rankingtourrankdocumentsinputllmslargeperformanceresults
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Large Language Models (LLMs) are increasingly employed in zero-shot documents ranking, yielding commendable results. However, several significant challenges still persist in LLMs for ranking: (1) LLMs are constrained by limited input length, precluding them from processing a large number of documents simultaneously; (2) The output document sequence is influenced by the input order of documents, resulting in inconsistent ranking outcomes; (3) Achieving a balance between cost and ranking performance is challenging. To tackle these issues, we introduce a novel documents ranking method called TourRank, which is inspired by the sport tournaments, such as FIFA World Cup. Specifically, we 1) overcome the limitation in input length and reduce the ranking latency by incorporating a multi-stage grouping strategy similar to the parallel group stage of sport tournaments; 2) improve the ranking performance and robustness to input orders by using a points system to ensemble multiple ranking results. We test TourRank with different LLMs on the TREC DL datasets and the BEIR benchmark. The experimental results demonstrate that TourRank delivers state-of-the-art performance at a modest cost. The code of TourRank can be seen on https://github.com/chenyiqun/TourRank.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Active Learners as Efficient PRP Rerankers

    cs.LG 2026-05 unverdicted novelty 6.0

    Active learning rankers outperform sorting-based aggregation of noisy LLM pairwise judgments and a randomized single-call oracle removes position bias without extra queries.

  2. Active Learners as Efficient PRP Rerankers

    cs.LG 2026-05 unverdicted novelty 5.0

    Active learning applied to noisy LLM pairwise judgments improves NDCG@10 per call in budget-constrained reranking and enables unbiased aggregation via a randomized-direction single-call oracle.

  3. Scaling Search Relevance: Augmenting App Store Ranking with LLM-Generated Judgments

    cs.IR 2026-02 conditional novelty 5.0

    Using a fine-tuned 3B LLM to generate millions of textual relevance labels for App Store search improves the ranker's behavioral/textual Pareto frontier and lifts conversion by 0.24%.

  4. PRISM: Prompt-Refined In-Context System Modelling for Financial Retrieval

    cs.AI 2025-11 conditional novelty 3.0

    PRISM shows that prompt engineering and selective ICL often outperform complex multi-agent systems on financial retrieval benchmarks while remaining training-free and achieving competitive NDCG@5 scores.