EnsLoss: Stochastic Calibrated Loss Ensembles for Preventing Overfitting in Classification
Ben Dai
Abstract
Empirical risk minimization (ERM) with a computationally feasible surrogate loss is a widely accepted approach for classification. Notably, the convexity and calibration (CC) properties of a loss function ensure consistency of ERM in maximizing accuracy, thereby offering a wide range of options for surrogate losses. In this article, we propose a novel ensemble method, namely ENSLOSS, which extends the ensemble learning concept to combine loss functions within the ERM framework. A key feature of our method is the consideration on preserving the "legitimacy" of the combined losses, i.e., ensuring the CC properties. Specifically, we first transform the CC conditions of losses into loss-derivatives, thereby bypassing the need for explicit loss functions and directly generating calibrated loss-derivatives. Therefore, inspired by Dropout, ENSLOSS enables loss ensembles through one training process with doubly stochastic gradient descent (i.e., random batch samples and random calibrated loss-derivatives). We theoretically establish the statistical consistency of our approach and provide insights into its benefits. The numerical effectiveness of ENSLOSS compared to fixed loss methods is demonstrated through experiments on a broad range of 14 OpenML tabular datasets and 46 image datasets with various deep learning architectures. Python repository and source code are available on GITHUB at https://github.com/statmlben/ensloss .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on3
- The Tree Ensemble Layer: Differentiability meets Conditional ComputationHussein Hazimeh, Natalia Ponomareva, Petros Mol, Zhenyu Tan et al.ICML 2020 · 95 citations
- H-Consistency Bounds for Surrogate Loss MinimizersPranjal Awasthi, Anqi Mao, Mehryar Mohri, Yutao ZhongICML 2022 · 50 citations
- Loss Function Learning for Domain Generalization by Implicit GradientBoyan Gao, Henry Gouk, Yongxin Yang, Timothy M. HospedalesICML 2022 · 29 citations
Related papers
- Generalizing Consistent Multi-Class Classification with Rejection to be Compatible with Arbitrary LossesYuzhou Cao, Tianchi Cai, Lei Feng, Lihong Gu et al.NeurIPS 2022 · 42 citations
- Towards Consistency in Adversarial ClassificationLaurent Meunier, Raphael Ettedgui, Rafael Pinot, Yann Chevaleyre et al.NeurIPS 2022 · 12 citations
- PEP: Parameter Ensembling by PerturbationAlireza Mehrtash, Purang Abolmaesumi, Polina Golland, Tina Kapur et al.NeurIPS 2020 · 13 citations
- Certifying Ensembles: A General Certification Theory with S-LipschitznessAleksandar Petrov, Francisco Eiras, Amartya Sanyal, Philip H. S. Torr et al.ICML 2023 · 2 citations
- Loss Surface Simplexes for Mode Connecting Volumes and Fast EnsemblingGregory W. Benton, Wesley J. Maddox, Sanae Lotfi, Andrew Gordon WilsonICML 2021 · 88 citations
