Papers › HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning

HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning

16 Jun 2021arXiv:2106.08630archive 2025-07-28

Hayeon Lee, Sewoong Lee, Song Chong, Sung Ju Hwang

For deployment, neural architecture search should be hardware-aware, in order to satisfy the device-specific constraints (e.g., memory usage, latency and energy consumption) and enhance the model efficiency. Existing methods on hardware-aware NAS collect a large number of samples (e.g., accuracy and latency) from a target device, either builds a lookup table or a latency estimator. However, such approach is impractical in real-world scenarios as there exist numerous devices with different hardware specifications, and collecting samples from such a large number of devices will require prohibitive computational and monetary cost. To overcome such limitations, we propose Hardware-adaptive Efficient Latency Predictor (HELP), which formulates the device-specific latency estimation problem as a meta-learning problem, such that we can estimate the latency of a model's performance for a given task on an unseen device with a few samples. To this end, we introduce novel hardware embeddings to embed any devices considering them as black-box functions that output latencies, and meta-learn the hardware-adaptive latency predictor in a device-dependent manner, using the hardware embeddings. We validate the proposed HELP for its latency estimation performance on unseen platforms, on which it achieves high estimation performance with as few as 10 measurement samples, outperforming all relevant baselines. We also validate end-to-end NAS frameworks using HELP against ones without it, and show that it largely reduces the total time cost of the base NAS method, in latency-constrained settings. Code is available at https://github.com/HayeonLee/HELP.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2106.08630")

Code

Syntology Ran 6 of 17 code samples harvested from 1 repository linked to this paper; 11 have no recorded run. Of those that ran: 1 ran · honoured contract; 5 ran with no contract checked.

By repository: official repository: 17 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

hayeonlee/help officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested; 6 ran; 1 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
5ran
11unverified

Licence: 0 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from hayeonlee/help. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

GCN hayeonlee/help/help.py official repository ran MIT (permissive) · 71fc6adbc8a9e344 · report
GraphConvolution hayeonlee/help/help.py official repository ran MIT (permissive) · c39b18210d6af850 · report
InferenceNetwork hayeonlee/help/help.py official repository ran MIT (permissive) · 96fdfe319609dfb1 · report
Net hayeonlee/help/help.py official repository ran MIT (permissive) · 91e2f33eece76754 · report
build_val_transform HayeonLee/HELP/validate_imagenet.py official repository ran MIT (permissive) · e1ccc3331db22b7d · report
kl_diagnormal_stdnormal hayeonlee/help/help.py official repository ran · honoured contract MIT (permissive) · e268490969567b33 · report
Data hayeonlee/help/help.py official repository unverified MIT (permissive) · d3c44d4cc08c514e · report
HELP hayeonlee/help/help.py official repository unverified MIT (permissive) · dd8282187a60fb88 · report
MetaLearner hayeonlee/help/help.py official repository unverified MIT (permissive) · ef8967f45af71fa1 · report
build_activation HayeonLee/HELP/ofa/utils/pytorch_modules.py official repository unverified MIT (permissive) · da7205ae31eaf8ba · report
flat HayeonLee/HELP/utils.py official repository unverified MIT (permissive) · 1d5210b89b90aa66 · report
get_bn_param HayeonLee/HELP/ofa/utils/my_modules.py official repository unverified MIT (permissive) · f060e6240188a921 · report
get_minmax_latency_index HayeonLee/HELP/utils.py official repository unverified MIT (permissive) · 1cf245a941c1244c · report
log_prob HayeonLee/HELP/utils.py official repository unverified MIT (permissive) · 9b55ec99f8807af5 · report
make_divisible HayeonLee/HELP/ofa/utils/pytorch_modules.py official repository unverified MIT (permissive) · addfbda3077115a3 · report
str2bool HayeonLee/HELP/parser.py official repository unverified MIT (permissive) · b0717d29ccfec107 · report
str2list HayeonLee/HELP/parser.py official repository unverified MIT (permissive) · 8ce900951a7ddd54 · report

Tasks

Meta-LearningNeural Architecture Search

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections