Overview

Pairwise ranking studies how to recover useful orderings from judgments such as which of two models, answers, or products is better. Common approaches include Bradley–Terry and Elo models, spectral methods, and active learning that selects informative comparisons; neural pairwise and listwise reward models extend these ideas to quality assessment and preference optimization. Applications include recommender systems, human-in-the-loop annotation, and LLM leaderboards evaluated with paired benchmarks. A central challenge is that comparisons can be noisy, biased, or heterogeneous, so cycles and close rankings may make a single global order unstable or statistically unresolved.

Latest papers

CardsList

62 papers6 papers in the last four weeks, level with the four weeks before. 0.0% of all new papers.

  1. Dropping Just a Handful of Preferences Can Change Top Large Language Model Rankings

    Aug 16, 2025Jenny Y. Huang, Yunyi Shen, Dennis Wei +1Pairwise Preference LearningLLM Evaluation

  2. Pairwise Comparisons without Stochastic Transitivity: Model, Theory and Applications

    Jan 13, 2025Sze Ming Lee, Yunxiao ChenPairwise ComparisonPairwise Preference Evaluation