mlsanityData to 7 Oct 2026

A Universal Growth Rate for Learning with Smooth Surrogate Losses

arXiv 2405.05968 ↗First posted 9 May 2024cs.LG stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

This paper presents a comprehensive analysis of the growth rate of H-consistency bounds (and excess error bounds) for various surrogate losses used in classification. We prove a square-root growth rate near zero for smooth margin-based surrogate losses in binary classification, providing both upper and lower bounds under mild assumptions. This result also translates to excess error bounds. Our lower bound requires weaker conditions than those in previous work for excess error bounds, and our upper bound is entirely novel. Moreover, we extend this analysis to multi-class classification with a series of novel results, demonstrating a universal square-root growth rate for smooth comp-sum and constrained losses, covering common choices for training neural networks in multi-class classification. Given this universal rate, we turn to the question of choosing among different surrogate losses. We first examine how H-consistency bounds vary across surrogates based on the number of classes. Next, ignoring constants and focusing on behavior near zero, we identify minimizability gaps as the key differentiating factor in these bounds. Thus, we thoroughly analyze these gaps, to guide surrogate loss selection, covering: comparisons across different comp-sum losses, conditions where gaps become zero, and general conditions leading to small gaps. Additionally, we demonstrate the key role of minimizability gaps in comparing excess error bounds and H-consistency bounds.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). Builds on 33 of its 81 references that are in the map. First posted on arXiv 9 May 2024.

Builds on

33 of 81 references.

References · 33

  1. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
  2. 2020Consistent Estimators for Learning to Defer to an Expertcited by 262
  3. 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 206
  4. 2022Calibrated Learning to Defer with One-vs-All Classifierscited by 68
  5. 2023Who Should Predict? Exact Algorithms For Learning to Defer to Humanscited by 68
  6. 2022Learning to Defer to Multiple Experts: Consistent Surrogate Losses, Confidence Calibration, and Conformal Ensemblescited by 59
  7. 2020Classification with Rejection Based on Cost-sensitive Classificationcited by 55
  8. 2021Calibration and Consistency of Adversarial Surrogate Lossescited by 47
  9. 2019On the Calibration of Multiclass Classification with Rejectioncited by 41
  10. 2015Loss Functions for Top-k Error: Analysis and Insightscited by 38
  11. 2023Principled Approaches for Learning to Defer with Multiple Expertscited by 38
  12. 2023Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithmscited by 36
21 more
  1. 2019On the Consistency of Top-k Surrogate Lossescited by 35
  2. 2020A General Framework for Consistent Structured Prediction with Implicit Loss Embeddingscited by 35
  3. 2016A Consistent Regularization Approach for Structured Predictioncited by 33
  4. 2023Learning to Reject with a Fixed Predictor: Application to Decontextualizationcited by 32
  5. 2023Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstentioncited by 32
  6. 2024Regression with Multi-Expert Deferralcited by 29
  7. 2023Ranking with Abstentioncited by 27
  8. 2021A Finer Calibration Analysis for Adversarial Robustnesscited by 26
  9. 2017On Structured Prediction Theory with Calibrated Convex Surrogate Lossescited by 23
  10. 2019An Embedding Framework for Consistent Polyhedral Surrogatescited by 21
  11. 2019Structured Prediction with Projection Oraclescited by 21
  12. 2024H-Consistency Guarantees for Regressioncited by 21
  13. 2015The Lov'asz Hinge: A Novel Convex Surrogate for Submodular Lossescited by 17
  14. 2021Surrogate Regret Bounds for Polyhedral Lossescited by 15
  15. 2019A General Theory for Structured Prediction with Smooth Convex Surrogatescited by 14
  16. 2018Sharp Analysis of Learning with Discrete Lossescited by 13
  17. 2020Consistent Structured Prediction with Max-Min Margin Markov Networkscited by 9
  18. 2014Binary Excess Risk for Smooth Convex Surrogatescited by 5
  19. 2021On the Consistency of Max-Margin Lossescited by 5
  20. 2024Top-k Classification and Cardinality-Aware Predictioncited by 5
  21. 2018On the Rates of Convergence from Surrogate Risk Minimizers to the Bayes Optimal Classifiercited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 7; 2025: 11; 2026: 6.

24 papers.

Sort:

  1. 2024Realizable H-Consistent and Bayes-Consistent Loss Functions for Learning to Defercited by 26
  2. 2024Cardinality-Aware Set Prediction and Top-k Classificationcited by 23
  3. 2024Multi-Label Learning with Stronger Consistency Guaranteescited by 22
  4. 2024Enhanced H-Consistency Boundscited by 18
  5. 2024A Two-Stage Learning-to-Defer Approach for Multi-Task Learningcited by 16
  6. 2025Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guaranteescited by 16
  7. 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defercited by 16
  8. 2024Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guaranteescited by 15
  9. 2025Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Datacited by 15
  10. 2025Budgeted Multiple-Expert Deferralcited by 11
  11. 2025Improved Balanced Classification with Theoretically Grounded Loss Functionscited by 9
  12. 2025Beyond Tsybakov: Model Margin Noise and H-Consistency Boundscited by 7
12 more
  1. 2025Why Ask One When You Can Ask k? Learning-to-Defer to the Top-k Expertscited by 6
  2. 2025Principled Algorithms for Optimizing Generalized Metrics in Binary Classificationcited by 6
  3. 2025Adversarial Robustness in One-Stage Learning-to-Defercited by 5
  4. 2026A Theoretical Framework for Modular Learning of Robust Generative Modelscited by 4
  5. 2024Proper losses regret at least 1/2-ordercited by 3
  6. 2026A Boundary-Layer Mechanism for One-Third Scaling in Online Softmax Classificationcited by 3
  7. 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescited by 2
  8. 2026Optimized Deferral for Imbalanced Settingscited by 2
  9. 2026Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Predictioncited by 2
  10. 2025Some Robustness Properties of Label Cleaningcited by 0
  11. 2026Online Learning-to-Defer with Varying Expertscited by 0
  12. 2026Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learningcited by 0