REVIEW 1 cited by
Surprisingly Strong Performance Prediction with Neural Graph Features
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Surprisingly Strong Performance Prediction with Neural Graph Features
read the original 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.
Forward citations
Cited by 1 Pith paper
-
STLGT: A Scalable Trace-Based Linear Graph Transformer for Tail Latency Prediction in Microservices
STLGT encodes microservice traces as span graphs and applies a structure-aware linear graph transformer with a decoupled temporal module to forecast multi-step p95 tail latencies, reporting 8.5% average MAPE improveme...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.