Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.07322 v5 pith:FK7UVWJZ submitted 2020-06-12 cs.LG stat.ML

classification cs.LGstat.ML
keywords losssquarecross-entropytasksarchitecturesclassificationneuraltrained
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Next Token Perception Score: Analytical Assessment of your LLM Perception Skills

    cs.CL 2025-05 conditional novelty 6.0 of 10

    A subspace-overlap score computed from frozen LLM representations and labels is proposed, with a bounding theorem in a linear setting and empirical correlations with linear probe accuracy and LoRA gains.

Pith tools