Expand Neurons, Not Parameters
Not on the map. Why?
Abstract (arXiv)
This work demonstrates how increasing the number of neurons in a network without increasing its total number of non-zero parameters improves performance. We show that this gain corresponds with a decrease in interference between multiple features that would otherwise share the same neurons. On symbolic Boolean tasks, splitting each neuron into sparser sub-neurons with knowledge of the clauses systematically reduces polysemanticity metrics and yields higher task accuracy. Notably, even random splits of neuron weights approximate these gains, indicating that reduced collisions, not precise assignment, are a primary driver. Consistent with the superposition hypothesis, the benefits of this framework grow with increasing interference: when polysemantic load is high, accuracy improvements are the largest. Transferring these insights to more realistic models, including classifiers over CLIP embeddings, convolutional neural networks, and deeper multilayer networks, we find that widening networks while maintaining a constant non-zero parameter count consistently increases accuracy. These results identify an interpretability-grounded mechanism to leverage width against superposition, improving performance without increasing the number of non-zero parameters. Such a direction is well matched to modern accelerators, where memory movement of non-zero parameters, rather than raw compute, is often a dominant bottleneck.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 36 of its 53 references that are in the map. First posted on arXiv 6 Oct 2025.
Builds on
36 of 53 references.
References · 36
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2022Toy Models of Superpositioncited by 928
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2021Dynamic Neural Networks: A Surveycited by 405
24 more
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2021ZeRO-Infinity: Breaking the GPU Memory Wall for Extreme Scale Deep Learningcited by 253
- 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 245
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2024Universal Neurons in GPT2 Language Modelscited by 100
- 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
- 2022Polysemanticity and Capacity in Neural Networkscited by 74
- 2025Large Language Models Share Representations of Latent Grammatical Concepts Across Typologically Diverse Languagescited by 57
- 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 49
- 2021Firefly Neural Architecture Descent: a General Approach for Growing Neural Networkscited by 48
- 2024Mathematical Models of Computation in Superpositioncited by 34
- 2025Superposition Yields Robust Neural Scalingcited by 30
- 2024PURE: Turning Polysemantic Neurons Into Pure Features by Identifying Relevant Circuitscited by 29
- 2020Growing Efficient Deep Networks by Structured Continuous Sparsificationcited by 28
- 2020Are wider nets better given the same number of parameters?cited by 27
- 2024A Survey of Lottery Ticket Hypothesiscited by 23
- 2024On the Complexity of Neural Computation in Superpositioncited by 21
- 2023What Causes Polysemanticity? An Alternative Origin Story of Mixed Selectivity from Incidental Causescited by 19
- 2024Towards a theory of model distillationcited by 14
- 2022Engineering Monosemanticity in Toy Modelscited by 13
- 2025Towards Combinatorial Interpretability of Neural Computationcited by 9
- 2023MixtureGrowth: Growing Neural Networks by Recombining Learned Parameterscited by 7
- 2025The Dynamics of Generalization in Deep Learningcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.