mlsanityData to 14 Oct 2026

Sigsoftmax: Reanalysis of the Softmax Bottleneck

arXiv 1805.10829 ↗First posted 28 May 2018stat.ML cs.LGcited by 20

Not on the map. Why?

Abstract (arXiv)

Softmax is an output activation function for modeling categorical probability distributions in many applications of deep learning. However, a recent study revealed that softmax can be a bottleneck of representational capacity of neural networks in language modeling (the softmax bottleneck). In this paper, we propose an output activation function for breaking the softmax bottleneck without additional parameters. We re-analyze the softmax bottleneck from the perspective of the output set of log-softmax and identify the cause of the softmax bottleneck. On the basis of this analysis, we propose sigsoftmax, which is composed of a multiplication of an exponential function and sigmoid function. Sigsoftmax can break the softmax bottleneck. The experiments on language modeling demonstrate that sigsoftmax and mixture of sigsoftmax outperform softmax and mixture of softmax, respectively.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 5; 2022: 2; 2023: 2; 2024: 2; 2025: 4; 2026: 5.

20 papers.

Sort:

By area:

  1. 2023Using Sequences of Life-events to Predict Human Livescited by 27
  2. 2024Why do small language models underperform? Studying Language Model Saturation via the Softmax Bottleneckcited by 21
  3. 2022Low-Rank Softmax Can Have Unargmaxable Classes in Theory but Rarely in Practicecited by 15
  4. 2025Sequences of Logits Reveal the Low Rank Structure of Language Modelscited by 9
  5. 2026Lost in Backpropagation: The LM Head is a Gradient Bottleneckcited by 9
  6. 2025AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelismcited by 7
  7. 2021Evidential Softmax for Sparse Multimodal Distributions in Deep Generative Modelscited by 6
  8. 2023HistAlign: Improving Context Dependency in Language Generation by Aligning with Historycited by 6
  9. 2021Breaking the Softmax Bottleneck for Sequential Recommender Systems with Dropout and Decouplingcited by 3
  10. 2021Yet Another Representation of Binary Decision Trees: A Mathematical Demonstrationcited by 2
  11. 2022Enhancing Classifier Conservativeness and Robustness by Polynomialitycited by 1
  12. 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiencycited by 1
8 more
  1. 2025On the Theoretical Limitations of Embedding-based Link Predictioncited by 1
  2. 2026The Quantum Shortcut: Complex Phase-State Dynamics Reduce the Optimization Steps of Sequence Modelscited by 1
  3. 2021Decision Machines: Congruent Decision Treescited by 0
  4. 2021Recognition Awareness: An Application of Latent Cognizance to Open-Set Recognitioncited by 0
  5. 2025Adaptive Sparse Softmax: An Effective and Efficient Softmax Variantcited by 0
  6. 2026Breaking the Correlation Plateau: On the Optimization and Capacity Limits of Attention-Based Regressorscited by 0
  7. 2026SingularClip: Preventing Spectral Collapse to Maintain Plasticity in Continual and Reinforcement Learningcited by 0
  8. 2026Copy-Paste Language Modelscited by 0