atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Hierarchical Selective Classification

NeurIPS 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Confidence calibration objectives · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Extends selective classification to hierarchies, letting models predict less specific ancestor nodes under uncertainty, with new inference rules (Climbing), a conformal-style threshold algorithm, and a large empirical study over 1,115 ImageNet models.

Problem

Standard selective classification forces a binary choice between predicting a leaf class and rejecting, discarding useful coarse information; the paper targets selective prediction over class hierarchies that lets models retreat to ancestor nodes when uncertain.

Approach

Defines hierarchical selective risk, coverage (entropy-based), and hAURC; introduces the Climbing inference rule that starts at the most likely leaf and climbs to the root until the node's summed softmax confidence exceeds a threshold, plus a split-conformal-style algorithm for choosing the threshold for a target accuracy with high probability.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace whole-sample rejection with hierarchical Climbing predictionsImageNet-1k classifiers · ImageNet-1k validationhAURC (× 1000): 42.27±0.46 -> 36.51±0.47Helped
use Climbing instead of Max-CoverageImageNet-1k classifiers · ImageNet-1k validationhAURC (× 1000): 39.99±0.53 -> 36.51±0.47Helped
replace whole-sample rejection with hierarchical Climbing predictionsiNat21 classifiers · iNat21 validationhAURC (× 1000): 13.35±0.50 -> 10.15±0.41Helped
use Climbing instead of Max-CoverageiNat21 classifiers · iNat21 validationhAURC (× 1000): 11.96±0.45 -> 10.15±0.41Helped
use the hierarchical selective threshold algorithm instead of DARTSImageNet-1k classifiers · ImageNet-1k validation, target accuracy 99%Target accuracy error (%): 0.63±4.2e-03 -> 0.02±1.1e-04Helped
use the hierarchical selective threshold algorithm instead of DARTSImageNet-1k classifiers · ImageNet-1k validation, target accuracy 99%Coverage: 0.22±2.0e-03 -> 0.40±3.2e-04Helped
use the hierarchical selective threshold algorithm instead of DARTSiNat21 classifiers · iNat21 validation, target accuracy 99%Target accuracy error (%): 0.49 ± 3.0e-02 -> 0.01 ± 1.3e-03Helped
use the hierarchical selective threshold algorithm instead of DARTSiNat21 classifiers · iNat21 validation, target accuracy 99%Coverage: 0.39 ± 2.20e-02 -> 0.687 ± 2.49e-03Helped
add temperature scaling (ablation)Climbing on ImageNet-1k classifiers · ImageNet-1k validationhAURC (× 1000): 39.24±0.49 -> 36.51±0.47Helped
add temperature scaling (ablation)Max-Coverage on ImageNet-1k classifiers · ImageNet-1k validationhAURC (× 1000): 39.99±0.53 -> 37.21±0.52Helped
add temperature scaling (ablation)Selective on ImageNet-1k classifiers · ImageNet-1k validationhAURC (× 1000): 42.27±0.46 -> 41.16±0.46Helped
train with the LCA-based hierarchical lossImageNet classifiers · ImageNet validationhAURC improvement: 3\% to 5\%Helped

Surprising findings

Limitations

Experimental setup

Datasets: ImageNet1k ImageNet21k ImageNet12k iNat21 iNat21-Mini WordNet hierarchy

Benchmarks: ImageNet1k validation iNat21-Mini validation

Metrics: hAURC hierarchical gain target accuracy error coverage ECE AUROC

Baselines: Selective (hierarchically-ignorant) inference rule Max-Coverage DARTS Conformal risk control

Builds on: selective classification DARTS temperature scaling split conformal prediction

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