Speeding up NAS with Adaptive Subset Selection
Not on the map. Why?
Abstract (arXiv)
A majority of recent developments in neural architecture search (NAS) have been aimed at decreasing the computational cost of various techniques without affecting their final performance. Towards this goal, several low-fidelity and performance prediction methods have been considered, including those that train only on subsets of the training data. In this work, we present an adaptive subset selection approach to NAS and present it as complementary to state-of-the-art NAS approaches. We uncover a natural connection between one-shot NAS algorithms and adaptive subset selection and devise an algorithm that makes use of state-of-the-art techniques from both areas. We use these techniques to substantially reduce the runtime of DARTS-PT (a leading one-shot NAS algorithm), as well as BOHB and DEHB (leading multifidelity optimization algorithms), without sacrificing accuracy. Our results are consistent across multiple datasets, and towards full reproducibility, we release our code at https: //anonymous.4open.science/r/SubsetSelection NAS-B132.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 38 of its 80 references that are in the map. First posted on arXiv 2 Nov 2022.
Builds on
38 of 80 references.
References · 38
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2018DARTS: Differentiable Architecture Searchcited by 1,798
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 909
- 2018Efficient Neural Architecture Search via Parameter Sharingcited by 837
- 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 699
- 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 470
- 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 416
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2019PC-DARTS: Partial Channel Connections for Memory-Efficient Architecture Searchcited by 265
26 more
- 2020Neural Architecture Search without Trainingcited by 244
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2018A System for Massively Parallel Hyperparameter Tuningcited by 202
- 2021Zero-Cost Proxies for Lightweight NAScited by 199
- 2018Neural Architecture Search with Bayesian Optimisation and Optimal Transportcited by 195
- 2019BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Searchcited by 179
- 2019Understanding and Robustifying Differentiable Architecture Searchcited by 178
- 2019DARTS+: Improved Differentiable Architecture Search with Early Stoppingcited by 105
- 2019Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Datacited by 104
- 2021Rethinking Architecture Selection in Differentiable NAScited by 92
- 2021How Powerful are Performance Predictors in Neural Architecture Search?cited by 90
- 2020EcoNAS: Finding Proxies for Economical Neural Architecture Searchcited by 61
- 2021Efficient Lottery Ticket Finding: Less Data is Morecited by 44
- 2020Geometry-Aware Gradient Algorithms for Neural Architecture Searchcited by 40
- 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunitiescited by 38
- 2020FBNetV3: Joint Architecture-Recipe Search using Predictor Pretrainingcited by 35
- 2021Towards Green Automated Machine Learning: Status Quo and Future Directionscited by 25
- 2021Core-set Sampling for Efficient Neural Architecture Searchcited by 23
- 2022AUTOMATA: Gradient Based Data Subset Selection for Compute-Efficient Hyper-parameter Tuningcited by 22
- 2021NAS-Bench-x11 and the Power of Learning Curvescited by 20
- 2021Accelerating Neural Architecture Search via Proxy Datacited by 14
- 2022SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruningcited by 12
- 2021It's Time to Do Something: Mitigating the Negative Impacts of Computing Through a Change to the Peer Review Processcited by 11
- 2022Submodlib: A Submodular Optimization Librarycited by 8
- 2020Synthetic Petri Dish: A Novel Surrogate Model for Rapid Architecture Searchcited by 3
- 2019Prune and Replace NAScited by 2
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 3.
6 papers.
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 139
- 2023A Comprehensive Survey of Dataset Distillationcited by 115
- 2023Efficient Architecture Search via Bi-level Data Pruningcited by 2
- 2025MicroNAS: An Automated Framework for Developing a Fall Detection Systemcited by 1
- 2025DDS-NAS: Dynamic Data Selection within Neural Architecture Search via On-line Hard Example Mining applied to Image Classificationcited by 1
- 2025Evolutionary Neural Architecture Search with Dual Contrastive Learningcited by 1
- 2025Evolutionary Neural Architecture Search with Dual Contrastive Learning23 Dec 2025
- 2025DDS-NAS: Dynamic Data Selection within Neural Architecture Search via On-line Hard Example Mining applied to Image Classification17 Jun 2025
- 2025MicroNAS: An Automated Framework for Developing a Fall Detection System10 Apr 2025
- 2023Efficient Architecture Search via Bi-level Data Pruning21 Dec 2023
- 2023Neural Architecture Search: Insights from 1000 Papers20 Jan 2023
- 2023A Comprehensive Survey of Dataset Distillation13 Jan 2023