mlsanityData to 7 Oct 2026

Analysis and Optimization of Loss Functions for Multiclass, Top-k, and Multilabel Classification

arXiv 1612.03663 ↗First posted 12 Dec 2016cs.CV cs.LG stat.MLcited by 20

Not on the map. Why?

Abstract (arXiv)

Top-k error is currently a popular performance measure on large scale image classification benchmarks such as ImageNet and Places. Despite its wide acceptance, our understanding of this metric is limited as most of the previous research is focused on its special case, the top-1 error. In this work, we explore two directions that shed more light on the top-k error. First, we provide an in-depth analysis of established and recently proposed single-label multiclass methods along with a detailed account of efficient optimization algorithms for them. Our results indicate that the softmax loss and the smooth multiclass SVM are surprisingly competitive in top-k error uniformly across all k, which can be explained by our analysis of multiclass top-k calibration. Further improvements for a specific k are possible with a number of proposed top-k loss functions. Second, we use the top-k methods to explore the transition from multiclass to multilabel learning. In particular, we find that it is possible to obtain effective multilabel classifiers on Pascal VOC using a single label per image for training, while the gap between multiclass and multilabel methods on MS COCO is more significant. Finally, our contribution of efficient algorithms for training with the considered top-k and multilabel loss functions is of independent interest.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Dec 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 8; 2023: 1; 2024: 4; 2025: 1.

20 papers.

Sort:

  1. 2022Rank-based Decomposable Losses in Machine Learning: A Surveycited by 26
  2. 2023In Defense of Softmax Parametrization for Calibrated and Consistent Learning to Defercited by 26
  3. 2021Sum of Ranked Range Loss for Supervised Learningcited by 23
  4. 2024Cardinality-Aware Set Prediction and Top-k Classificationcited by 23
  5. 2022An Embedding Framework for the Design and Analysis of Consistent Polyhedral Surrogatescited by 14
  6. 2022On the Informativeness of Supervision Signalscited by 12
  7. 2021Label Distributionally Robust Losses for Multi-class Classification: Consistency, Robustness and Adaptivitycited by 11
  8. 2022Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classificationcited by 10
  9. 2021Implicit Rate-Constrained Optimization of Non-decomposable Objectivescited by 9
  10. 2022Optimizing Partial Area Under the Top-k Curve: Theory and Practicecited by 9
  11. 2022Consistent Polyhedral Surrogates for Top-k Classification and Variantscited by 8
  12. 2022Theoretical analysis and experimental validation of volume bias of soft Dice optimized segmentation maps in the context of inherent uncertaintycited by 6
8 more
  1. 2025Why Ask One When You Can Ask k? Learning-to-Defer to the Top-k Expertscited by 6
  2. 2021Unbiased Loss Functions for Multilabel Classification with Missing Labelscited by 5
  3. 2024Top-k Classification and Cardinality-Aware Predictioncited by 5
  4. 2021Tensor Normalization and Full Distribution Trainingcited by 3
  5. 2021Classification Under Ambiguity: When Is Average-K Better Than Top-K?cited by 1
  6. 2022Provable Robust Saliency-based Explanationscited by 1
  7. 2024Multilingual hierarchical classification of job advertisements for job vacancy statisticscited by 1
  8. 2024Implicit Regularization for Multi-label Feature Selectioncited by 0