Improved Balanced Classification with Theoretically Grounded Loss Functions
Not on the map. Why?
Abstract (arXiv)
The balanced loss is a widely adopted objective for multi-class classification under class imbalance. By assigning equal importance to all classes, regardless of their frequency, it promotes fairness and ensures that minority classes are not overlooked. However, directly minimizing the balanced classification loss is typically intractable, which makes the design of effective surrogate losses a central question. This paper introduces and studies two advanced surrogate loss families: Generalized Logit-Adjusted (GLA) loss functions and Generalized Class-Aware weighted (GCA) losses. GLA losses generalize Logit-Adjusted losses, which shift logits based on class priors, to the broader general cross-entropy loss family. GCA loss functions extend the standard class-weighted losses, which scale losses inversely by class frequency, by incorporating class-dependent confidence margins and extending them to the general cross-entropy family. We present a comprehensive theoretical analysis of consistency for both loss families. We show that GLA losses are Bayes-consistent, but only H-consistent for complete (i.e., unbounded) hypothesis sets. Moreover, their H-consistency bounds depend inversely on the minimum class probability, scaling at least as 1/mathsf pmin. In contrast, GCA losses are H-consistent for any hypothesis set that is bounded or complete, with H-consistency bounds that scale more favorably as 1/√mathsf pmin, offering significantly stronger theoretical guarantees in imbalanced settings. We report the results of experiments demonstrating that, empirically, both the GCA losses with calibrated class-dependent confidence margins and GLA losses can greatly outperform straightforward class-weighted losses as well as the LA losses. GLA generally performs slightly better in common benchmarks, whereas GCA exhibits a slight edge in highly imbalanced settings.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 90 of its 153 references that are in the map. First posted on arXiv 30 Dec 2025.
Builds on
90 of 153 references.
References · 90
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 987
- 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 806
- 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 704
- 2017Spectrally-normalized margin bounds for neural networkscited by 681
- 2020Long-tail learning via logit adjustmentcited by 605
- 2017A systematic study of the class imbalance problem in convolutional neural networkscited by 510
38 more
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 452
- 2019Agnostic Federated Learningcited by 451
- 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 441
- 2021Deep Long-Tailed Learning: A Surveycited by 416
- 2019BBN: Bilateral-Branch Network with Cumulative Learning for Long-Tailed Visual Recognitioncited by 403
- 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 397
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2020Equalization Loss for Long-Tailed Object Recognitioncited by 285
- 2020Long-tailed Recognition by Routing Diverse Distribution-Aware Expertscited by 270
- 2020Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effectcited by 256
- 2018What is the Effect of Importance Weighting in Deep Learning?cited by 250
- 2021Parametric Contrastive Learningcited by 217
- 2020Rethinking the Value of Labels for Improving Class-Imbalanced Learningcited by 216
- 2021Improving Calibration for Long-Tailed Recognitioncited by 212
- 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 206
- 2020Learning From Multiple Experts: Self-paced Knowledge Distillation for Long-tailed Classificationcited by 175
- 2020Disentangling Label Distribution for Long-tailed Visual Recognitioncited by 172
- 2020Rethinking Class-Balanced Methods for Long-Tailed Visual Recognition from a Domain Adaptation Perspectivecited by 143
- 2016A vector-contraction inequality for Rademacher complexitiescited by 141
- 2016Range Loss for Deep Face Recognition with Long-tailcited by 111
- 2022Inducing Neural Collapse in Imbalanced Learning: Do We Really Need a Learnable Classifier at the End of Deep Neural Network?cited by 100
- 2021ResLT: Residual Learning for Long-tailed Recognitioncited by 96
- 2021Self-Supervised Aggregation of Diverse Experts for Test-Agnostic Long-Tailed Recognitioncited by 95
- 2019Striking the Right Balance with Uncertaintycited by 79
- 2020Identifying and Compensating for Feature Deviation in Imbalanced Deep Learningcited by 76
- 2021Label-Imbalanced and Group-Sensitive Classification under Overparameterizationcited by 74
- 2021Learning Fast Sample Re-weighting Without Reward Datacited by 69
- 2021RSG: A Simple but Effective Module for Learning Imbalanced Datasetscited by 61
- 2023Long-Tail Learning with Foundation Model: Heavy Fine-Tuning Hurtscited by 58
- 2016AdaNet: Adaptive Structural Learning of Artificial Neural Networkscited by 54
- 2020Posterior Re-calibration for Imbalanced Datasetscited by 53
- 2017Learning with Average Top-k Losscited by 52
- 2019Adjusting Decision Boundary for Class Imbalanced Learningcited by 52
- 2022AutoBalance: Optimized Loss Functions for Imbalanced Datacited by 49
- 2021Calibration and Consistency of Adversarial Surrogate Lossescited by 47
- 2023Principled Approaches for Learning to Defer with Multiple Expertscited by 38
- 2023Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithmscited by 36
- 2023How Re-sampling Helps for Long-Tail Learning?cited by 36
50 most cited of 90 All 90 (JSON)
Built on by
Citing papers per year: 2026: 9.
9 papers.
- 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
- 2026Angular Gaussian Supervised Contrastive Learning for Long-Tailed Electrocardiogram Arrhythmia Diagnosiscited by 0
- 2026Generalised Balanced Softmax: A Finite-Data Perspective on Logit Adjustment for Long-Tailed Recognitioncited by 0
- 2026Bounded Adjustment with Reliability-Guided Embedding for Imbalanced Learning with Noisy Labelscited by 0
- 2026Age of Learning: Temporal Persistence of Prediction Errors as a Learning Signalcited by 0
- 2026Age of Learning: Temporal Persistence of Prediction Errors as a Learning Signal26 Sep 2026
- 2026Bounded Adjustment with Reliability-Guided Embedding for Imbalanced Learning with Noisy Labels14 Sep 2026
- 2026Generalised Balanced Softmax: A Finite-Data Perspective on Logit Adjustment for Long-Tailed Recognition24 Jul 2026
- 2026Angular Gaussian Supervised Contrastive Learning for Long-Tailed Electrocardiogram Arrhythmia Diagnosis16 Jul 2026
- 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