Enhanced H-Consistency Bounds
Not on the map. Why?
Abstract (arXiv)
Recent research has introduced a key notion of H-consistency bounds for surrogate losses. These bounds offer finite-sample guarantees, quantifying the relationship between the zero-one estimation error (or other target loss) and the surrogate loss estimation error for a specific hypothesis set. However, previous bounds were derived under the condition that a lower bound of the surrogate loss conditional regret is given as a convex function of the target conditional regret, without non-constant factors depending on the predictor or input instance. Can we derive finer and more favorable H-consistency bounds? In this work, we relax this condition and present a general framework for establishing enhanced H-consistency bounds based on more general inequalities relating conditional regrets. Our theorems not only subsume existing results as special cases but also enable the derivation of more favorable bounds in various scenarios. These include standard multi-class classification, binary and multi-class classification under Tsybakov noise conditions, and bipartite ranking.
Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). Builds on 42 of its 112 references that are in the map. First posted on arXiv 18 Jul 2024.
Builds on
42 of 112 references.
References · 42
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
- 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 443
- 2020Consistent Estimators for Learning to Defer to an Expertcited by 271
- 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 210
- 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
- 2022Calibrated Learning to Defer with One-vs-All Classifierscited by 69
- 2013Classification with Asymmetric Label Noise: Consistency and Maximal Denoisingcited by 68
- 2021Calibration and Consistency of Adversarial Surrogate Lossescited by 47
- 2019On the Calibration of Multiclass Classification with Rejectioncited by 41
- 2023Principled Approaches for Learning to Defer with Multiple Expertscited by 38
- 2023Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithmscited by 36
- 2019On the Consistency of Top-k Surrogate Lossescited by 35
30 more
- 2016A Consistent Regularization Approach for Structured Predictioncited by 33
- 2023Learning to Reject with a Fixed Predictor: Application to Decontextualizationcited by 32
- 2023Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstentioncited by 32
- 2022Learning from Label Proportions by Learning with Label Noisecited by 30
- 2023Revisiting Discriminative vs. Generative Classifiers: Theory and Implicationscited by 29
- 2024Regression with Multi-Expert Deferralcited by 29
- 2015Top-k Multiclass SVMcited by 28
- 2023Ranking with Abstentioncited by 27
- 2021A Finer Calibration Analysis for Adversarial Robustnesscited by 26
- 2023In Defense of Softmax Parametrization for Calibrated and Consistent Learning to Defercited by 26
- 2014On the Consistency of Ordinal Regression Methodscited by 24
- 2016Loss factorization, weakly supervised learning and label noise robustnesscited by 24
- 2024A Universal Growth Rate for Learning with Smooth Surrogate Lossescited by 24
- 2017On Structured Prediction Theory with Calibrated Convex Surrogate Lossescited by 23
- 2024Cardinality-Aware Set Prediction and Top-k Classificationcited by 23
- 2014Convex Calibration Dimension for Multiclass Loss Matricescited by 21
- 2019Structured Prediction with Projection Oraclescited by 21
- 2024H-Consistency Guarantees for Regressioncited by 21
- 2020Convex Calibrated Surrogates for the Multi-Label F-Measurecited by 18
- 2021Surrogate Regret Bounds for Polyhedral Lossescited by 15
- 2022An Embedding Framework for the Design and Analysis of Consistent Polyhedral Surrogatescited by 14
- 2016Multiclass Classification Calibration Functionscited by 13
- 2020Weston-Watkins Hinge Loss and Ordered Partitionscited by 9
- 2022Consistent Polyhedral Surrogates for Top-k Classification and Variantscited by 8
- 2023Unified Binary and Multiclass Margin-Based Classificationcited by 8
- 2015Consistent Algorithms for Multiclass Classification with a Reject Optioncited by 7
- 2023On Classification-Calibration of Gamma-Phi Lossescited by 6
- 2021Unifying Lower Bounds on Prediction Dimension of Consistent Convex Surrogatescited by 4
- 2024Multiclass Learning from Noisy Labels for Non-decomposable Performance Measurescited by 3
- 2024Trading off Consistency and Dimensionality of Convex Surrogates for the Modecited by 1
Built on by
Citing papers per year: 2024: 2; 2025: 11; 2026: 5.
18 papers.
Sort:
By area:
- 2024A Two-Stage Learning-to-Defer Approach for Multi-Task Learningcited by 17
- 2025Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guaranteescited by 16
- 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defercited by 16
- 2024Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guaranteescited by 15
- 2025Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Datacited by 15
- 2025Budgeted Multiple-Expert Deferralcited by 13
- 2025Improved Balanced Classification with Theoretically Grounded Loss Functionscited by 9
- 2025Why Ask One When You Can Ask k? Learning-to-Defer to the Top-k Expertscited by 7
- 2025To Ask or Not to Ask: Learning to Require Human Feedbackcited by 6
- 2025Principled Algorithms for Optimizing Generalized Metrics in Binary Classificationcited by 6
- 2025Adversarial Robustness in One-Stage Learning-to-Defercited by 5
- 2026A Theoretical Framework for Modular Learning of Robust Generative Modelscited by 4
6 more
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescited by 2
- 2026Optimized Deferral for Imbalanced Settingscited by 2
- 2026Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Predictioncited by 2
- 2026Online Learning-to-Defer with Varying Expertscited by 1
- 2025Some Robustness Properties of Label Cleaningcited by 0
- 2026Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learningcited by 0
- 2026Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learning27 May 2026
- 2026Online Learning-to-Defer with Varying Experts12 May 2026
- 2026Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction30 Apr 2026
- 2026Optimized Deferral for Imbalanced Settings30 Apr 2026
- 2026A Theoretical Framework for Modular Learning of Robust Generative Models19 Feb 2026
- 2025Improved Balanced Classification with Theoretically Grounded Loss Functions30 Dec 2025
- 2025Principled Algorithms for Optimizing Generalized Metrics in Binary Classification29 Dec 2025
- 2025Budgeted Multiple-Expert Deferral30 Oct 2025
- 2025Adversarial Robustness in One-Stage Learning-to-Defer13 Oct 2025
- 2025To Ask or Not to Ask: Learning to Require Human Feedback9 Oct 2025
- 2025Some Robustness Properties of Label Cleaning14 Sep 2025
- 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defer25 Jun 2025
6 more
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses14 May 2025
- 2025Why Ask One When You Can Ask k? Learning-to-Defer to the Top-k Experts17 Apr 2025
- 2025Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Data14 Feb 2025
- 2025Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guarantees3 Feb 2025
- 2024Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guarantees21 Oct 2024
- 2024A Two-Stage Learning-to-Defer Approach for Multi-Task Learning21 Oct 2024
- 2025To Ask or Not to Ask: Learning to Require Human Feedbackcited by 6
- 2025To Ask or Not to Ask: Learning to Require Human Feedback9 Oct 2025
- 2024A Two-Stage Learning-to-Defer Approach for Multi-Task Learningcited by 17
- 2025Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guaranteescited by 16
- 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defercited by 16
- 2024Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guaranteescited by 15
- 2025Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Datacited by 15
- 2025Budgeted Multiple-Expert Deferralcited by 13
- 2025Improved Balanced Classification with Theoretically Grounded Loss Functionscited by 9
- 2025Why Ask One When You Can Ask k? Learning-to-Defer to the Top-k Expertscited by 7
- 2025Principled Algorithms for Optimizing Generalized Metrics in Binary Classificationcited by 6
- 2025Adversarial Robustness in One-Stage Learning-to-Defercited by 5
- 2026A Theoretical Framework for Modular Learning of Robust Generative Modelscited by 4
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescited by 2
12 most cited of 17 All 17 (JSON)
- 2026Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learning27 May 2026
- 2026Online Learning-to-Defer with Varying Experts12 May 2026
- 2026Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction30 Apr 2026
- 2026Optimized Deferral for Imbalanced Settings30 Apr 2026
- 2026A Theoretical Framework for Modular Learning of Robust Generative Models19 Feb 2026
- 2025Improved Balanced Classification with Theoretically Grounded Loss Functions30 Dec 2025
- 2025Principled Algorithms for Optimizing Generalized Metrics in Binary Classification29 Dec 2025
- 2025Budgeted Multiple-Expert Deferral30 Oct 2025
- 2025Adversarial Robustness in One-Stage Learning-to-Defer13 Oct 2025
- 2025Some Robustness Properties of Label Cleaning14 Sep 2025
- 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defer25 Jun 2025
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses14 May 2025
12 newest of 17 All 17 (JSON)