Research map / Learning theory and algorithms / Prediction and decision losses
Simple, Robust and Optimal Ranking from Pairwise Comparisons
Nihar B. Shah, Martin J. Wainwright
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Copeland counting instead of Spectral MLE | top-k recovery · BTL simulation (n=500) | accuracy: 100% vs 100% | No clear effect |
| use Copeland counting instead of Spectral MLE | top-k recovery · BTL with one non-transitive outlier | top-k recovery: counting 100% accuracy; Spectral MLE fails to identify top k | Improved |
| use Copeland counting instead of Spectral MLE | top-k recovery · SST and mixture of BTL simulations | recovery success | Improved |
| use Copeland counting instead of Spectral MLE when separation alpha is one-tenth of recommended | top-k recovery · BTL with violated separation condition | error | Improved |
| use Copeland counting instead of Spectral MLE | top-k recovery · BTL simulation (n=500) | computation time: five orders of magnitude lower | Improved |
| use Copeland counting instead of Spectral MLE | top-k recovery · Amazon Mechanical Turk (cities, piano, spelling) | Hamming error | Improved |
Closest papers by meaning
- On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons (NeurIPS 2019 · similarity 0.92)
- Efficient Computation of Rankings from Pairwise Comparisons (JMLR 2023 · similarity 0.91)
- The Sample Complexity of Best-$k$ Items Selection from Pairwise Comparisons (ICML 2020 · similarity 0.90)
- Maxing and Ranking with Few Assumptions (NeurIPS 2017 · similarity 0.88)
- Ranking with Multiple Oracles: From Weak to Strong Stochastic Transitivity (ICML 2025 · similarity 0.88)
- Active Ranking and Matchmaking, with Perfect Matchings (ICML 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
