Transferrable Surrogates in Expressive Neural Architecture Search Spaces

Shiwen Qin, Gabriela Kadlecová, Martin Pilát, Shay B. Cohen, Roman Neruda +3 more
4/17/2025
cs.LGcs.AI

No official code found. Best implementation: shiwenqin/transferrable-surrogates (5 stars, MIT, last commit 2025-04-22).

Abstract

Neural architecture search (NAS) faces a challenge in balancing the exploration of expressive, broad search spaces that enable architectural innovation with the need for efficient evaluation of architectures to effectively search such spaces. We investigate surrogate model training for improving search in highly expressive NAS search spaces based on context-free grammars. We show that i) surrogate models trained either using zero-cost-proxy metrics and neural graph features (GRAF) or by fine-tuning an off-the-shelf LM have high predictive power for the performance of architectures both within and across datasets, ii) these surrogates can be used to filter out bad architectures when searching on novel datasets, thereby significantly speeding up search and achieving better final performances, and iii) the surrogates can be further used directly as the search objective for huge speed-ups.

View on arXivView PDF

Code Implementations(1)

MIT

Official codebase for paper: Transferrable Surrogates in Expressive Neural Architecture Search Spaces

50Shell, PythonApr 22, 20251 years agoMIT

Similar Papers

Cite this paper

@article{qin2025transferrable,
  title  = {Transferrable Surrogates in Expressive Neural Architecture Search Spaces},
  author = {Shiwen Qin and Gabriela Kadlecová and Martin Pilát and Shay B. Cohen and Roman Neruda and Elliot J. Crowley and Jovita Lukasik and Linus Ericsson},
  year   = {2025},
  eprint = {2504.12971},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.12971v3}
}

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/2504.12971.svg)](https://codeofpaper.com/paper/2504.12971)

Discussion