# Revisiting Training-free NAS Metrics: An Efficient Training-based Method

Source: [Revisiting Training-free NAS Metrics: An Efficient Training-based Method](<https://www.sota2.com/research/paper/68fa6dfe1e209131cea3d40e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T00:47:11.173Z

Authors: Taojiannan Yang, Linjie Yang, Xiaojie Jin, Chen Chen

Published: 2022-11-16T04:47:44.000Z

## Abstract

Recent neural architecture search (NAS) works proposed training-free metrics to rank networks which largely reduced the search cost in NAS. In this paper, we revisit these training-free metrics and find that: (1) the number of parameters (\\#Param), which is the most straightforward training-free metric, is overlooked in previous works but is surprisingly effective, (2) recent training-free metrics largely rely on the \\#Param information to rank networks. Our experiments show that the performance of recent training-free metrics drops dramatically when the \\#Param information is not available. Motivated by these observations, we argue that metrics less correlated with the \\#Param are desired to provide additional information for NAS. We propose a light-weight training-based metric which has a weak correlation with the \\#Param while achieving better performance than training-free metrics at a lower search cost. Specifically, on DARTS search space, our method completes searching directly on ImageNet in only 2.6 GPU hours and achieves a top-1/top-5 error rate of 24.1\\%/7.1\\%, which is competitive among state-of-the-art NAS methods. Codes are available at \\url{https://github.com/taoyang1122/Revisit\_TrainingFree\_NAS}

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2211.08666>)

[PDF](<https://arxiv.org/pdf/2211.08666.pdf>)
