Research map / Learning theory and algorithms / Sample complexity
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons (NeurIPS 2021 · similarity 0.93)
- The Sample Complexity of Best-$k$ Items Selection from Pairwise Comparisons (ICML 2020 · similarity 0.92)
- Ranking with Multiple Oracles: From Weak to Strong Stochastic Transitivity (ICML 2025 · similarity 0.90)
- Active Ranking and Matchmaking, with Perfect Matchings (ICML 2024 · similarity 0.86)
- Sampling for Beyond-Worst-Case Online Ranking (AAAI 2024 · similarity 0.86)
- From Pairwise to Ranking: Climbing the Ladder to Ideal Collaborative Filtering with Pseudo-Ranking (AAAI 2025 · 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.