Beyond Tsybakov: Model Margin Noise and H-Consistency Bounds
Not on the map. Why?
Abstract (arXiv)
We introduce a new low-noise condition for classification, the Model Margin Noise (MM noise) assumption, and derive enhanced H-consistency bounds under this condition. MM noise is weaker than Tsybakov noise condition: it is implied by Tsybakov noise condition but can hold even when Tsybakov fails, because it depends on the discrepancy between a given hypothesis and the Bayes-classifier rather than on the intrinsic distributional minimal margin (see Figure 1 for an illustration of an explicit example). This hypothesis-dependent assumption yields enhanced H-consistency bounds for both binary and multi-class classification. Our results extend the enhanced H-consistency bounds of Mao, Mohri, and Zhong (2025a) with the same favorable exponents but under a weaker assumption than the Tsybakov noise condition; they interpolate smoothly between linear and square-root regimes for intermediate noise levels. We also instantiate these bounds for common surrogate loss families and provide illustrative tables.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 12 of its 41 references that are in the map. First posted on arXiv 19 Nov 2025.
Builds on
12 of 41 references.
References · 12
- 2023Principled Approaches for Learning to Defer with Multiple Expertscited by 38
- 2023Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithmscited by 36
- 2023Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstentioncited by 32
- 2024Realizable H-Consistent and Bayes-Consistent Loss Functions for Learning to Defercited by 26
- 2024A Universal Growth Rate for Learning with Smooth Surrogate Lossescited by 24
- 2024Cardinality-Aware Set Prediction and Top-k Classificationcited by 23
- 2024Multi-Label Learning with Stronger Consistency Guaranteescited by 22
- 2019An Embedding Framework for Consistent Polyhedral Surrogatescited by 21
- 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defercited by 16
- 2021Surrogate Regret Bounds for Polyhedral Lossescited by 15
- 2025Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Datacited by 15
- 2014Binary Excess Risk for Smooth Convex Surrogatescited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2025Improved Balanced Classification with Theoretically Grounded Loss Functionscited by 9
- 2025Principled Algorithms for Optimizing Generalized Metrics in Binary Classificationcited by 6
- 2026A Theoretical Framework for Modular Learning of Robust Generative Modelscited by 4
- 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 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