Research map / Learning theory and algorithms / Prediction and decision losses
PiRank: Scalable Learning To Rank via Differentiable Sorting
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
- TopRank: A practical algorithm for online stochastic ranking (NeurIPS 2018 · similarity 0.88)
- Learning to Rank by Directly Optimizing Full-Order Probabilities (ICML 2026 · similarity 0.88)
- Differentiable Ranking and Sorting using Optimal Transport (NeurIPS 2019 · similarity 0.88)
- Fast Differentiable Sorting and Ranking (ICML 2020 · similarity 0.88)
- On ranking via sorting by estimated expected utility (NeurIPS 2020 · similarity 0.87)
- LapSum - One Method to Differentiate Them All: Ranking, Sorting and Top-k Selection (ICML 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.