Surprisingly Strong Performance Prediction with Neural Graph Features

Gabriela Kadlecová, Jovita Lukasik, Martin Pilát, Petra Vidnerová, Mahmoud Safari +2 more
4/25/2024
cs.LG

No official code found. Best implementation: gabikadlecova/zc_combine (3 stars, MIT, last commit 2024-08-23).

Abstract

Performance prediction has been a key part of the neural architecture search (NAS) process, allowing to speed up NAS algorithms by avoiding resource-consuming network training. Although many performance predictors correlate well with ground truth performance, they require training data in the form of trained networks. Recently, zero-cost proxies have been proposed as an efficient method to estimate network performance without any training. However, they are still poorly understood, exhibit biases with network properties, and their performance is limited. Inspired by the drawbacks of zero-cost proxies, we propose neural graph features (GRAF), simple to compute properties of architectural graphs. GRAF offers fast and interpretable performance prediction while outperforming zero-cost proxies and other common encodings. In combination with other zero-cost proxies, GRAF outperforms most existing performance predictors at a fraction of the cost.

View on arXivView PDF

Code Implementations(1)

MIT

Exploring combinations of zero-cost proxies

31Shell, PythonJan 11, 20232 years agoMIT

Similar Papers

Cite this paper

@article{kadlecov2024surprisingly,
  title  = {Surprisingly Strong Performance Prediction with Neural Graph Features},
  author = {Gabriela Kadlecová and Jovita Lukasik and Martin Pilát and Petra Vidnerová and Mahmoud Safari and Roman Neruda and Frank Hutter},
  year   = {2024},
  eprint = {2404.16551},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.16551v2},
  journal = {ICML 2024 2024}
}

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

Discussion