Pareto-Frontier-aware Neural Architecture Generation for Diverse Budgets
Not on the map. Why?
Abstract (arXiv)
Designing feasible and effective architectures under diverse computation budgets incurred by different applications/devices is essential for deploying deep models in practice. Existing methods often perform an independent architecture search for each target budget, which is very inefficient yet unnecessary. Moreover, the repeated independent search manner would inevitably ignore the common knowledge among different search processes and hamper the search performance. To address these issues, we seek to train a general architecture generator that automatically produces effective architectures for an arbitrary budget merely via model inference. To this end, we propose a Pareto-Frontier-aware Neural Architecture Generator (NAG) which takes an arbitrary budget as input and produces the Pareto optimal architecture for the target budget. We train NAG by learning the Pareto frontier (i.e., the set of Pareto optimal architectures) over model performance and computational cost (e.g., latency). Extensive experiments on three platforms (i.e., mobile, CPU, and GPU) show the superiority of the proposed method over existing NAS methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 44 references that are in the map. First posted on arXiv 27 Feb 2021.
Builds on
30 of 44 references.
References · 30
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2019Searching for MobileNetV3cited by 1,984
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
- 2018Efficient Neural Architecture Search via Parameter Sharingcited by 831
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 666
- 2018FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Searchcited by 480
18 more
- 2019Single Path One-Shot Neural Architecture Search with Uniform Samplingcited by 411
- 2017Large-Scale Evolution of Image Classifierscited by 348
- 2019Progressive Differentiable Architecture Search: Bridging the Depth Gap between Search and Evaluationcited by 230
- 2017Hierarchical Representations for Efficient Architecture Searchcited by 188
- 2020FBNetV2: Differentiable Neural Architecture Search for Spatial and Channel Dimensionscited by 152
- 2018Efficient Multi-objective Neural Architecture Search via Lamarckian Evolutioncited by 151
- 2019Exploring Randomly Wired Neural Networks for Image Recognitioncited by 103
- 2019Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hourscited by 87
- 2020NSGANetV2: Evolutionary Multi-Objective Surrogate-Assisted Neural Architecture Searchcited by 75
- 2020Can weight sharing outperform random architecture search? An investigation with TuNAScited by 68
- 2020Neural Architecture Transfercited by 59
- 2018DPP-Net: Device-aware Progressive Search for Pareto-optimal Neural Architecturescited by 40
- 2020Cream of the Crop: Distilling Prioritized Paths For One-Shot Neural Architecture Searchcited by 38
- 2019NAT: Neural Architecture Transformer for Accurate and Compact Architecturescited by 33
- 2020Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Searchcited by 33
- 2020Neural Architecture Generator Optimizationcited by 30
- 2018Searching Toward Pareto-Optimal Device-Aware Neural Architecturescited by 5
- 2020PONAS: Progressive One-shot Neural Architecture Search for Very Efficient Deploymentcited by 4
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.