On Classification-Calibration of Gamma-Phi Losses
Not on the map. Why?
Abstract (arXiv)
Gamma-Phi losses constitute a family of multiclass classification loss functions that generalize the logistic and other common losses, and have found application in the boosting literature. We establish the first general sufficient condition for the classification-calibration (CC) of such losses. To our knowledge, this sufficient condition gives the first family of nonconvex multiclass surrogate losses for which CC has been fully justified. In addition, we show that a previously proposed sufficient condition is in fact not sufficient. This contribution highlights a technical issue that is important in the study of multiclass CC but has been neglected in prior work.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 10 of its 29 references that are in the map. First posted on arXiv 14 Feb 2023.
Builds on
10 of 29 references.
References · 10
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2019Robust Bi-Tempered Logistic Loss Based on Bregman Divergencescited by 61
- 2021Calibration and Consistency of Adversarial Surrogate Lossescited by 47
- 2014Convex Calibration Dimension for Multiclass Loss Matricescited by 21
- 2019An Embedding Framework for Consistent Polyhedral Surrogatescited by 21
- 2016Multiclass Classification Calibration Functionscited by 13
- 2020Weston-Watkins Hinge Loss and Ordered Partitionscited by 9
- 2017Online Multiclass Boostingcited by 7
- 2022Astral Space: Convex Analysis at Infinitycited by 6
- 2022Online Agnostic Multiclass Boostingcited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 2.
6 papers.
- 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 206
- 2024H-Consistency Guarantees for Regressioncited by 21
- 2024Enhanced H-Consistency Boundscited by 18
- 2025Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guaranteescited by 16
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescited by 2
- 2024EnsLoss: Stochastic Calibrated Loss Ensembles for Preventing Overfitting in Classificationcited by 1
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses14 May 2025
- 2025Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guarantees3 Feb 2025
- 2024EnsLoss: Stochastic Calibrated Loss Ensembles for Preventing Overfitting in Classification2 Sep 2024
- 2024Enhanced H-Consistency Bounds18 Jul 2024
- 2024H-Consistency Guarantees for Regression28 Mar 2024
- 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applications14 Apr 2023