The Z-loss: a shift and scale invariant classification loss belonging to the Spherical Family
Not on the map. Why?
Abstract (arXiv)
Despite being the standard loss function to train multi-class neural networks, the log-softmax has two potential limitations. First, it involves computations that scale linearly with the number of output classes, which can restrict the size of problems we are able to tackle with current hardware. Second, it remains unclear how close it matches the task loss such as the top-k error rate or other non-differentiable evaluation metrics which we aim to optimize ultimately. In this paper, we introduce an alternative classification loss function, the Z-loss, which is designed to address these two issues. Unlike the log-softmax, it has the desirable property of belonging to the spherical loss family (Vincent et al., 2015), a class of loss functions for which training can be performed very efficiently with a complexity independent of the number of output classes. We show experimentally that it significantly outperforms the other spherical loss functions previously investigated. Furthermore, we show on a word language modeling task that it also outperforms the log-softmax with respect to certain ranking scores, such as top-k scores, suggesting that the Z-loss has the flexibility to better match the task loss. These qualities thus makes the Z-loss an appealing candidate to train very efficiently large output networks such as word-language models or other extreme classification problems. On the One Billion Word (Chelba et al., 2014) dataset, we are able to train a model with the Z-loss 40 times faster than the log-softmax and more than 4 times faster than the hierarchical softmax.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Apr 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 2; 2026: 6.
12 papers.
- 2025Cosmos World Foundation Model Platform for Physical AIcited by 864
- 2025Completed Hyperparameter Transfer across Modules, Width, Depth, Batch and Durationcited by 27
- 2024YuLan-Mini: An Open Data-efficient Language Modelcited by 7
- 2026Voxtral Realtimecited by 6
- 2026The Design Space of Tri-Modal Masked Diffusion Modelscited by 6
- 2023Take One Step at a Time to Know Incremental Utility of Demonstration: An Analysis on Reranking for Few-Shot In-Context Learningcited by 2
- 2026Dead-Direction Conditioners: Gauge-Equivariant Preconditioning for Deep Networkscited by 2
- 2022GROOT: Corrective Reward Optimization for Generative Sequential Labelingcited by 1
- 2022How Does Beam Search improve Span-Level Confidence Estimation in Generative Sequence Labeling?cited by 1
- 2026Dead Directions: Geometric Singular Learningcited by 1
- 2026Attention Projection Mixing with Exogenous Anchorscited by 0
- 2026Z-Loss Backward Geometry in Dense Output Heads and Sparse Routerscited by 0
- 2026Z-Loss Backward Geometry in Dense Output Heads and Sparse Routers31 Jul 2026
- 2026Dead-Direction Conditioners: Gauge-Equivariant Preconditioning for Deep Networks28 Jun 2026
- 2026Dead Directions: Geometric Singular Learning4 Jun 2026
- 2026The Design Space of Tri-Modal Masked Diffusion Models25 Feb 2026
- 2026Voxtral Realtime11 Feb 2026
- 2026Attention Projection Mixing with Exogenous Anchors13 Jan 2026
- 2025Completed Hyperparameter Transfer across Modules, Width, Depth, Batch and Duration26 Dec 2025
- 2025Cosmos World Foundation Model Platform for Physical AI7 Jan 2025
- 2024YuLan-Mini: An Open Data-efficient Language Model23 Dec 2024
- 2023Take One Step at a Time to Know Incremental Utility of Demonstration: An Analysis on Reranking for Few-Shot In-Context Learning16 Nov 2023
- 2022How Does Beam Search improve Span-Level Confidence Estimation in Generative Sequence Labeling?21 Dec 2022
- 2022GROOT: Corrective Reward Optimization for Generative Sequential Labeling29 Sep 2022