Adaptive Width Neural Networks
Not on the map. Why?
Abstract (arXiv)
For almost 70 years, researchers have typically selected the width of neural networks' layers either manually or through automated hyperparameter tuning methods such as grid search and, more recently, neural architecture search. This paper challenges the status quo by introducing an easy-to-use technique to learn an unbounded width of a neural network's layer during training. The method jointly optimizes the width and the parameters of each layer via standard backpropagation. We apply the technique to a broad range of data domains such as tables, images, text, sequences, and graphs, showing how the width adapts to the task's difficulty. A by product of our width learning approach is the easy truncation of the trained network at virtually zero cost, achieving a smooth trade-off between performance and compute resources. Alternatively, one can dynamically compress the network until performances do not degrade. In light of recent foundation models trained on large datasets, requiring billions of parameters and where hyper-parameter tuning is unfeasible due to huge training costs, our approach introduces a viable alternative for width learning.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 43 of its 75 references that are in the map. First posted on arXiv 27 Jan 2025.
Builds on
43 of 75 references.
References · 43
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2020Knowledge Distillation: A Surveycited by 1,578
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,097
31 more
- 2021Scaling Vision Transformerscited by 993
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
- 2018Efficient Neural Architecture Search via Parameter Sharingcited by 831
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2020What is the State of Neural Network Pruning?cited by 578
- 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
- 2021Dynamic Neural Networks: A Surveycited by 405
- 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 403
- 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2016Multi30K: Multilingual English-German Image Descriptionscited by 250
- 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 232
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2017SMASH: One-Shot Model Architecture Search through HyperNetworkscited by 200
- 2019The Evolved Transformercited by 180
- 2018Efficient Multi-objective Neural Architecture Search via Lamarckian Evolutioncited by 151
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2019Splitting Steepest Descent for Growing Neural Architecturescited by 52
- 2021Firefly Neural Architecture Descent: a General Approach for Growing Neural Networkscited by 48
- 2021Locally Free Weight Sharing for Network Width Searchcited by 27
- 2021BCNet: Searching for Network Width with Bilaterally Coupled Networkcited by 23
- 2020AOWS: Adaptive and optimal network width search with latency constraintscited by 17
- 2023Self-Expanding Neural Networkscited by 13
- 2022Variational Inference for Infinitely Deep Neural Networkscited by 10
- 2024Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neuronscited by 5
- 2020Dynamic Hard Pruning of Neural Networks at the Edge of the Internetcited by 4
- 2023Over-parameterised Shallow Neural Networks with Asymmetrical Node Scaling: Global Convergence Guarantees and Feature Learningcited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Fast, Modular, and Differentiable Framework for Machine Learning-Enhanced Molecular Simulationscited by 2
- 2026Not All Layers Are Created Equal: Adaptive LoRA Ranks for Personalized Image Generationcited by 2
- 2026NGN: Learning Neural Network Size as a Differentiable Countcited by 0
- 2026Neuron-Level Architecture Growth: A Controlled Evaluation for EEG Time-Series Decodingcited by 0
- 2026Neuron-Level Architecture Growth: A Controlled Evaluation for EEG Time-Series Decoding27 Sep 2026
- 2026NGN: Learning Neural Network Size as a Differentiable Count23 Sep 2026
- 2026Not All Layers Are Created Equal: Adaptive LoRA Ranks for Personalized Image Generation23 Mar 2026
- 2025Fast, Modular, and Differentiable Framework for Machine Learning-Enhanced Molecular Simulations26 Mar 2025