Search Spaces for Neural Model Training
Not on the map. Why?
Abstract (arXiv)
While larger neural models are pushing the boundaries of what deep learning can do, often more weights are needed to train models rather than to run inference for tasks. This paper seeks to understand this behavior using search spaces -- adding weights creates extra degrees of freedom that form new paths for optimization (or wider search spaces) rendering neural model training more effective. We then show how we can augment search spaces to train sparse models attaining competitive scores across dozens of deep learning workloads. They are also are tolerant of structures targeting current hardware, opening avenues for training and inference acceleration. Our work encourages research to explore beyond massive neural models being used today.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 66 of its 79 references that are in the map. First posted on arXiv 27 May 2021.
Builds on
66 of 79 references.
References · 66
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2017Mask R-CNNcited by 7,277
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
38 more
- 2014Going Deeper with Convolutionscited by 4,241
- 2015SSD: Single Shot MultiBox Detectorcited by 3,130
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,850
- 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,488
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
- 2017High-Resolution Image Synthesis and Semantic Manipulation with Conditional GANscited by 1,179
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2018Video-to-Video Synthesiscited by 390
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2017Dilated Residual Networkscited by 294
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
- 2016Deep Learning without Poor Local Minimacited by 234
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
- 2019Levenshtein Transformercited by 199
- 2019Few-shot Video-to-Video Synthesiscited by 197
- 2020The Computational Limits of Deep Learningcited by 193
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
50 most cited of 66 All 66 (JSON)
Built on by
Citing papers per year: 2022: 2; 2023: 1.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2025How to Upscale Neural Networks with Scaling Law? A Survey and Practical Guidelines
- 2025On Accelerating Edge AI: Optimizing Resource-Constrained Environments
- 2024Search for Efficient Large Language Models
- 2023Finding Neurons in a Haystack: Case Studies with Sparse Probing
- 2023Data Augmentations in Deep Weight Spaces
- 2025Neural Genetic Search in Discrete Spaces
- 2024Compressing Large Language Models with Automated Sub-Network Search
- 2025DeepSearch: Overcome the Bottleneck of Reinforcement Learning with Verifiable Rewards via Monte Carlo Tree Search