mlsanityData to 7 Oct 2026

PENEX: AdaBoost-Inspired Neural Network Regularization

arXiv 2510.02107 ↗First posted 2 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

AdaBoost sequentially fits so-called weak learners to minimize an exponential loss, which penalizes misclassified data points more severely than other loss functions like cross-entropy. Paradoxically, AdaBoost generalizes well in practice as the number of weak learners grows. In the present work, we introduce Penalized Exponential Loss (PENEX), a new formulation of the multi-class exponential loss that is theoretically grounded and, in contrast to the existing formulation, amenable to optimization via first-order methods, making it a practical objective for training neural networks. We demonstrate that PENEX effectively increases margins of data points, which can be translated into a generalization bound. Empirically, across computer vision and language tasks, PENEX improves neural network generalization in low-data regimes, matching and in some settings outperforming established regularizers at comparable computational cost. Our results highlight the potential of the exponential loss beyond its application in AdaBoost.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 103 references that are in the map. First posted on arXiv 2 Oct 2025.

Builds on

31 of 103 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  6. 2013Intriguing properties of neural networkscited by 5,114
  7. 2017On Calibration of Modern Neural Networkscited by 4,860
  8. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  9. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  10. 2021MedMNIST v2 -- A large-scale lightweight benchmark for 2D and 3D biomedical image classificationcited by 682
  11. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  12. 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 461
19 more
  1. 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
  2. 2018Gradient descent aligns the layers of deep linear networkscited by 182
  3. 2023Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performancecited by 143
  4. 2016Robust Large Margin Deep Neural Networkscited by 117
  5. 2018Predicting the Generalization Gap in Deep Networks with Margin Distributionscited by 111
  6. 2018Large Margin Deep Networks for Classificationcited by 110
  7. 2018Convergence of Gradient Descent on Separable Datacited by 108
  8. 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
  9. 2020Generalized Entropy Regularization or: There's Nothing Special about Label Smoothingcited by 40
  10. 2019AdaGCN: Adaboosting Graph Convolutional Networks into Deep Modelscited by 37
  11. 2022PromptBoosting: Black-Box Text Classification with Ten Forward Passescited by 36
  12. 2023Boosted Prompt Ensembles for Large Language Modelscited by 36
  13. 2017AdaGAN: Boosting Generative Modelscited by 34
  14. 2023PREFER: Prompt Ensemble Learning via Feedback-Reflect-Refinecited by 28
  15. 2023Language models are weak learnerscited by 21
  16. 2017Boosted Generative Modelscited by 18
  17. 2024Conformal Generative Modeling with Improved Sample Efficiency through Sequential Greedy Filteringcited by 10
  18. 2018Improving Generalization of Deep Neural Networks by Leveraging Margin Distributioncited by 4
  19. 2020BoostingBERT:Integrating Multi-Class Boosting into BERT for NLP Taskscited by 3

Built on by

Not cited yet.