Entropic Score metric: Decoupling Topology and Size in Training-free NAS

Niccolò Cavagnero, Luca Robbiano, Francesca Pistilli, Barbara Caputo, Giuseppe Averta
10/6/2023
cs.CVcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Neural Networks design is a complex and often daunting task, particularly for resource-constrained scenarios typical of mobile-sized models. Neural Architecture Search is a promising approach to automate this process, but existing competitive methods require large training time and computational resources to generate accurate models. To overcome these limits, this paper contributes with: i) a novel training-free metric, named Entropic Score, to estimate model expressivity through the aggregated element-wise entropy of its activations; ii) a cyclic search algorithm to separately yet synergistically search model size and topology. Entropic Score shows remarkable ability in searching for the topology of the network, and a proper combination with LogSynflow, to search for model size, yields superior capability to completely design high-performance Hybrid Transformers for edge applications in less than 1 GPU hour, resulting in the fastest and most accurate NAS method for ImageNet classification.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cavagnero2023entropic,
  title  = {Entropic Score metric: Decoupling Topology and Size in Training-free NAS},
  author = {Niccolò Cavagnero and Luca Robbiano and Francesca Pistilli and Barbara Caputo and Giuseppe Averta},
  year   = {2023},
  eprint = {2310.04179},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.04179v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.04179.svg)](https://codeofpaper.com/paper/2310.04179)

Discussion