atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Ranking Data with Continuous Labels through Oriented Recursive Partitions

NeurIPS 2017 · Learning theory and algorithms › Prediction and decision losses · approach: Ranking models from comparisons · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use continuous-ranking optimization rather than CART's MSE-minimizing regression objectiveDecision-tree learning on the toy regression example · Toy regression exampleIAUC: 0.61 -> 0.95Helped
Use continuous-ranking optimization rather than CART's MSE-minimizing regression objectiveDecision-tree learning on the toy regression example · Toy regression exampleKendall τ: 0.58 -> 0.92Helped
Use continuous-ranking optimization rather than CART's MSE-minimizing regression objectiveDecision-tree learning on the toy regression example · Toy regression exampleMSE: 7.4 \times 10^{-4} -> 0.10Hurt
Maximize empirical Kendall τ instead of empirical IAUC (ablation)CRank · Toy regression exampleIAUC: 0.95 -> 0.94Hurt
Maximize empirical Kendall τ instead of empirical IAUC (ablation)CRank · Toy regression exampleKendall τ: 0.92 -> 0.93Helped
Maximize empirical Kendall τ instead of empirical IAUC (ablation)CRank · Toy regression exampleMSE: 0.10 -> 0.10No clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy