mlsanityData to 7 Oct 2026

Evaluation of Neural Architectures Trained with Square Loss vs Cross-Entropy in Classification Tasks

arXiv 2006.07322 ↗First posted 12 Jun 2020cs.LG stat.MLcited by 137

Not on the map. Why?

Abstract (arXiv)

Modern neural architectures for classification tasks are trained using the cross-entropy loss, which is widely believed to be empirically superior to the square loss. In this work we provide evidence indicating that this belief may not be well-founded. We explore several major neural architectures and a range of standard benchmark datasets for NLP, automatic speech recognition (ASR) and computer vision tasks to show that these architectures, with the same hyper-parameter settings as reported in the literature, perform comparably or better when trained with the square loss, even after equalizing computational resources. Indeed, we observe that the square loss produces better results in the dominant majority of NLP and ASR experiments. Cross-entropy appears to have a slight edge on computer vision tasks. We argue that there is little compelling empirical or theoretical evidence indicating a clear-cut advantage to the cross-entropy loss. Indeed, in our experiments, performance on nearly all non-vision tasks can be improved, sometimes significantly, by switching to the square loss. Furthermore, training with square loss appears to be less sensitive to the randomness in initialization. We posit that training using the square loss for classification needs to be a part of best practices of modern deep learning on equal footing with cross-entropy.

Key facts. Cited by 137 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 26; 2022: 32; 2023: 30; 2024: 20; 2025: 18; 2026: 11.

137 papers.

Sort:

By area:

  1. 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
  2. 2021Neural Collapse Under MSE Loss: Proximity to and Dynamics on the Central Pathcited by 156
  3. 2022Contrastive and Non-Contrastive Self-Supervised Learning Recover Global and Local Spectral Embedding Methodscited by 146
  4. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 130
  5. 2022Extended Unconstrained Features Model for Exploring Deep Neural Collapsecited by 101
  6. 2023The Expressive Power of Low-Rank Adaptationcited by 100
  7. 2022Test-Time Adaptation via Conjugate Pseudo-labelscited by 98
  8. 2022On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Featurescited by 97
  9. 2022Neural Collapse: A Review on Modelling Principles and Generalizationcited by 95
  10. 2021Soft Calibration Objectives for Neural Networkscited by 89
  11. 2022Cramming: Training a Language Model on a Single GPU in One Daycited by 81
  12. 2022Are All Losses Created Equal: A Neural Collapse Perspectivecited by 78
38 more
  1. 2022The Effects of Regularization and Data Augmentation are Class Dependentcited by 67
  2. 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 54
  3. 2021Bridging Multi-Task Learning and Meta-Learning: Towards Efficient Training and Effective Adaptationcited by 50
  4. 2022Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPscited by 42
  5. 2021Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolationcited by 41
  6. 2023Neural Collapse in Deep Linear Networks: From Balanced to Imbalanced Datacited by 40
  7. 2024Does SGD really happen in tiny subspaces?cited by 35
  8. 2021Selective Regression Under Fairness Criteriacited by 34
  9. 2022Perturbation Analysis of Neural Collapsecited by 34
  10. 2023Dual Focal Loss for Calibrationcited by 33
  11. 2022TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernelscited by 26
  12. 2022Making Look-Ahead Active Learning Strategies Feasible with Neural Tangent Kernelscited by 25
  13. 2023Tangent Model Composition for Ensembling and Continual Fine-tuningcited by 25
  14. 2024Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspectivecited by 25
  15. 2022The good, the bad and the ugly sides of data augmentation: An implicit spectral regularization perspectivecited by 24
  16. 2022Understanding and Improving Transfer Learning of Deep Models via Neural Collapsecited by 24
  17. 2021RATT: Leveraging Unlabeled Data to Guarantee Generalizationcited by 20
  18. 2025Uncovering Memorization Effect in the Presence of Spurious Correlationscited by 20
  19. 2022SphereFed: Hyperspherical Federated Learningcited by 19
  20. 2023Supervision Complexity and its Role in Knowledge Distillationcited by 19
  21. 2023A Neural Collapse Perspective on Feature Evolution in Graph Neural Networkscited by 19
  22. 2023Neural (Tangent Kernel) Collapsecited by 18
  23. 2021Understanding and Mitigating Accuracy Disparity in Regressioncited by 17
  24. 2021CounterNet: End-to-End Training of Prediction Aware Counterfactual Explanationscited by 17
  25. 2023More is Better in Modern Machine Learning: when Infinite Overparameterization is Optimal and Overfitting is Obligatorycited by 17
  26. 2023Pathologies of Predictive Diversity in Deep Ensemblescited by 16
  27. 2023Classification with Deep Neural Networks and Logistic Losscited by 16
  28. 2021Estimating informativeness of samples with Smooth Unique Informationcited by 15
  29. 2021Harmless interpolation in regression and classification with structured featurescited by 14
  30. 2021Understanding Square Loss in Training Overparametrized Neural Network Classifierscited by 14
  31. 2023Generalizing and Decoupling Neural Collapse via Hyperspherical Uniformity Gapcited by 14
  32. 2023Automatic Gradient Descent: Deep Learning without Hyperparameterscited by 14
  33. 2023A Unified Approach to Controlling Implicit Regularization via Mirror Descentcited by 13
  34. 2023Tangent Transformers for Composition, Privacy and Removalcited by 13
  35. 2024Why do Random Forests Work? Understanding Tree Ensembles as Self-Regularizing Adaptive Smootherscited by 13
  36. 2024How to Train the Teacher Model for Effective Knowledge Distillationcited by 13
  37. 2025Do We Always Need the Simplicity Bias? Looking for Optimal Inductive Biases in the Wildcited by 13
  38. 2021On the interplay between data structure and loss function in classification problemscited by 12

50 most cited of 137 All 137 (JSON)