Pith. sign in

REVIEW 13 cited by

ReLU² Wins: Discovering Efficient Activation Functions for Sparse LLMs

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 2402.03804 v1 pith:DTIS3R4S submitted 2024-02-06 cs.LG cs.AI

ReLU² Wins: Discovering Efficient Activation Functions for Sparse LLMs

classification cs.LG cs.AI
keywords activationllmssparserelucomputationefficientsparsityaspects
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Sparse computation offers a compelling solution for the inference of Large Language Models (LLMs) in low-resource scenarios by dynamically skipping the computation of inactive neurons. While traditional approaches focus on ReLU-based LLMs, leveraging zeros in activation values, we broaden the scope of sparse LLMs beyond zero activation values. We introduce a general method that defines neuron activation through neuron output magnitudes and a tailored magnitude threshold, demonstrating that non-ReLU LLMs also exhibit sparse activation. To find the most efficient activation function for sparse computation, we propose a systematic framework to examine the sparsity of LLMs from three aspects: the trade-off between sparsity and performance, the predictivity of sparsity, and the hardware affinity. We conduct thorough experiments on LLMs utilizing different activation functions, including ReLU, SwiGLU, ReGLU, and ReLU$^2$. The results indicate that models employing ReLU$^2$ excel across all three evaluation aspects, highlighting its potential as an efficient activation function for sparse LLMs. We will release the code to facilitate future research.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 13 Pith papers

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

  1. Bug or Feature$^2$: Weight Drift, Activation Sparsity and Spikes

    cs.LG 2026-05 accept novelty 7.0

    Standard losses induce negative weight drift with positive-biased activations, producing up to 90% sparsity in GPT-nano and an accuracy cliff above ~70% sparsity; clipped ReLU² and GELU² improve the tradeoff.

  2. Bug or Feature$^2$: Weight Drift, Activation Sparsity and Spikes

    cs.LG 2026-05 accept novelty 7.0

    The paper proves negative weight drift at initialization under MSE or cross-entropy with asymmetric activations, links it to up to 90% sparsity in GPT-nano, maps the sparsity-accuracy cliff across 79 configurations, a...

  3. More Expressive Feedforward Layers: Part I. Token-Adaptive Mixing of Activations

    cs.LG 2026-05 unverdicted novelty 6.0

    Mixture of Activations mixes activation functions token-adaptively in FFNs via lightweight gates, strictly more expressive than fixed or learnable activations, and yields lower pretraining loss from 0.12B to 2B models.

  4. RT-Lynx: Putting the GEMM Sparsity In a Right Way for Diffusion Models

    cs.LG 2026-05 unverdicted novelty 6.0

    RT-Lynx shifts DiT sparsity from weights to activations, reports up to 1.55x linear-layer speedup while preserving generation quality across multiple diffusion models.

  5. The Role of Symmetry in Optimizing Overparameterized Networks

    cs.LG 2026-04 unverdicted novelty 6.0

    Overparameterization introduces symmetries that precondition the Hessian for better-conditioned minima and raise the reachability of global minima from typical starts in neural network loss landscapes.

  6. The Role of Symmetry in Optimizing Overparameterized Networks

    cs.LG 2026-04 unverdicted novelty 6.0

    Overparameterization adds symmetries that precondition the Hessian for better minima and increase the probability mass of global minima near typical initializations.

  7. PointTransformerX: Portable and Efficient 3D Point Cloud Processing without Sparse Algorithms

    cs.CV 2026-04 unverdicted novelty 6.0

    PointTransformerX is a fully PyTorch-native 3D point cloud transformer backbone that reaches 98.7% of PointTransformer V3 accuracy on ScanNet using 79.2% fewer parameters, 1.6x faster inference, and only 253 MB memory...

  8. Parcae: Scaling Laws For Stable Looped Language Models

    cs.LG 2026-04 unverdicted novelty 6.0

    Parcae stabilizes looped LLMs via spectral norm constraints on injection parameters, enabling power-law scaling for training FLOPs and saturating exponential scaling at test time that improves quality over fixed-depth...

  9. Physics of Language Models: Part 4.1, Architecture Design and the Magic of Canon Layers

    cs.CL 2025-12 conditional novelty 6.0

    Canon layers—residual 1-d causal convolutions over adjacent tokens—boost synthetic reasoning depth 2-4x, lift NoPE to RoPE level, and bring GLA up to Mamba2/GDN, with qualitative real-world confirmation.

  10. Resting Neurons, Active Insights: Robustifying Activation Sparsity in LLMs via Spontaneity

    cs.LG 2025-12 unverdicted novelty 6.0

    SPON adds learnable persistent activation anchors trained via distribution matching to restore LLM accuracy under high activation sparsity by preventing representational distribution shifts.

  11. Readable but Not Controllable: Neuron-Level Evidence for Medical LLM Hallucination

    cs.CL 2026-06 unverdicted novelty 5.0

    Hallucination signals in medical LLMs are distributed and decodable from activations but not causally controllable via neuron-level interventions.

  12. Anytime Training with Schedule-Free Spectral Optimization

    cs.LG 2026-05 unverdicted novelty 5.0

    SF-NorMuon is a new schedule-free spectral optimizer that closes the gap with tuned AdamW on 125M-772M parameter models across 1-8x Chinchilla horizons while providing stationarity guarantees.

  13. Resting Neurons, Active Insights: Robustifying Activation Sparsity in LLMs via Spontaneity

    cs.LG 2025-12 unverdicted novelty 5.0

    SPON adds a small set of trainable input-independent activation vectors as representational anchors, trained by distribution matching, to stabilize sparse activation in LLMs and recover performance lost to hidden-stat...