mlsanityData to 7 Oct 2026

Zero-Shot NAS via the Suppression of Local Entropy Decrease

arXiv 2411.06236 ↗First posted 9 Nov 2024cs.LG cs.CV cs.NEcited by 2

Not on the map. Why?

Abstract (arXiv)

Architecture performance evaluation is the most time-consuming part of neural architecture search (NAS). Zero-Shot NAS accelerates the evaluation by utilizing zero-cost proxies instead of training. Though effective, existing zero-cost proxies require invoking backpropagations or running networks on input data, making it difficult to further accelerate the computation of proxies. To alleviate this issue, architecture topologies are used to evaluate the performance of networks in this study. We prove that particular architectural topologies decrease the local entropy of feature maps, which degrades specific features to a bias, thereby reducing network performance. Based on this proof, architectural topologies are utilized to quantify the suppression of local entropy decrease (SED) as a data-free and running-free proxy. Experimental results show that SED outperforms most state-of-the-art proxies in terms of architecture selection on five benchmarks, with computation time reduced by three orders of magnitude. We further compare the SED-based NAS with state-of-the-art proxies. SED-based NAS selects the architecture with higher accuracy and fewer parameters in only one second. The theoretical analyses of local entropy and experimental results demonstrate that the suppression of local entropy decrease facilitates selecting optimal architectures in Zero-Shot NAS.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 40 references that are in the map. First posted on arXiv 9 Nov 2024.

Builds on

27 of 40 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Going Deeper with Convolutionscited by 4,231
  3. 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  5. 2018On Lazy Training in Differentiable Programmingcited by 671
  6. 2019Importance Estimation for Neural Network Pruningcited by 531
  7. 2017Progressive Neural Architecture Searchcited by 483
  8. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  9. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  10. 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 412
  11. 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 374
  12. 2019NAS-Bench-101: Towards Reproducible Neural Architecture Searchcited by 340
15 more
  1. 2016On the Expressive Power of Deep Neural Networkscited by 302
  2. 2020A Comprehensive Survey of Neural Architecture Search: Challenges and Solutionscited by 253
  3. 2020Neural Architecture Search without Trainingcited by 241
  4. 2019Complexity of Linear Regions in Deep Networkscited by 166
  5. 2017Bounding and Counting Linear Regions of Deep Neural Networkscited by 161
  6. 2022More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsitycited by 142
  7. 2021Group Fisher Pruning for Practical Network Compressioncited by 130
  8. 2020NATS-Bench: Benchmarking NAS Algorithms for Architecture Topology and Sizecited by 98
  9. 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
  10. 2023ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradientscited by 57
  11. 2024AZ-NAS: Assembling Zero-Cost Proxies for Network Architecture Searchcited by 25
  12. 2021EPE-NAS: Efficient Performance Estimation Without Training for Neural Architecture Searchcited by 24
  13. 2023Zero-Shot Neural Architecture Search: Challenges, Solutions, and Opportunitiescited by 21
  14. 2021GradSign: Model Performance Inference with Theoretical Insightscited by 18
  15. 2024SWAP-NAS: Sample-Wise Activation Patterns for Ultra-fast NAScited by 11

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.