Research map / Learning theory and algorithms / Sample complexity
Label Ranking through Nonparametric Regression
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Increase regression-noise level | Decision trees and random forests · Synthetic LFN and SFN | mean k_tau | Hurt |
| Use shallow trees instead of fully grown decision trees | Decision trees · Synthetic LFN and SFN | mean k_tau | Helped |
| Use fully grown honest random forests instead of fully grown decision trees | Decision trees · Synthetic LFN and SFN | mean k_tau | Helped |
Closest papers by meaning
- A Structured Prediction Approach for Label Ranking (NeurIPS 2018 · similarity 0.91)
- Linear Label Ranking with Bounded Noise (NeurIPS 2022 · similarity 0.89)
- Towards a Pairwise Ranking Model with Orderliness and Monotonicity for Label Enhancement (NeurIPS 2025 · similarity 0.89)
- Rethinking and Reweighting the Univariate Losses for Multi-Label Ranking: Consistency and Generalization (NeurIPS 2021 · similarity 0.88)
- Predicting Label Distribution from Multi-label Ranking (NeurIPS 2022 · similarity 0.88)
- Enhancing Multi-Label Classification via Dynamic Label-Order Learning (AAAI 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.