mlsanityData to 7 Oct 2026

Beyond Tsybakov: Model Margin Noise and H-Consistency Bounds

arXiv 2511.15816 ↗First posted 19 Nov 2025cs.LG stat.MLcited by 7

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

  1. 2023Principled Approaches for Learning to Defer with Multiple Expertscited by 38
  2. 2023Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithmscited by 36
  3. 2023Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstentioncited by 32
  4. 2024Realizable H-Consistent and Bayes-Consistent Loss Functions for Learning to Defercited by 26
  5. 2024A Universal Growth Rate for Learning with Smooth Surrogate Lossescited by 24
  6. 2024Cardinality-Aware Set Prediction and Top-k Classificationcited by 23
  7. 2024Multi-Label Learning with Stronger Consistency Guaranteescited by 22
  8. 2019An Embedding Framework for Consistent Polyhedral Surrogatescited by 21
  9. 2025Mastering Multiple-Expert Routing: Realizable H-Consistency and Strong Guarantees for Learning to Defercited by 16
  10. 2021Surrogate Regret Bounds for Polyhedral Lossescited by 15
  11. 2025Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Datacited by 15
  12. 2014Binary Excess Risk for Smooth Convex Surrogatescited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 5.

7 papers.