Pith. sign in

REVIEW 1 cited by

How Much Is Hidden in the NAS Benchmarks? Few-Shot Adaptation of a NAS Predictor

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

arxiv 2311.18451 v1 pith:PVULGHDA submitted 2023-11-30 cs.LG

classification cs.LG
keywords tasksbenchmarkssearchthoseadaptationapplicabilityapproachcost
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural architecture search has proven to be a powerful approach to designing and refining neural networks, often boosting their performance and efficiency over manually-designed variations, but comes with computational overhead. While there has been a considerable amount of research focused on lowering the cost of NAS for mainstream tasks, such as image classification, a lot of those improvements stem from the fact that those tasks are well-studied in the broader context. Consequently, applicability of NAS to emerging and under-represented domains is still associated with a relatively high cost and/or uncertainty about the achievable gains. To address this issue, we turn our focus towards the recent growth of publicly available NAS benchmarks in an attempt to extract general NAS knowledge, transferable across different tasks and search spaces. We borrow from the rich field of meta-learning for few-shot adaptation and carefully study applicability of those methods to NAS, with a special focus on the relationship between task-level correlation (domain shift) and predictor transferability; which we deem critical for improving NAS on diverse tasks. In our experiments, we use 6 NAS benchmarks in conjunction, spanning in total 16 NAS settings -- our meta-learning approach not only shows superior (or matching) performance in the cross-validation experiments but also successful extrapolation to a new search space and tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Overtuning in Hyperparameter Optimization

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Around 10% of hyperparameter optimization runs select a validation-optimal configuration that generalizes worse than the first configuration evaluated, a phenomenon the authors call overtuning.

Pith tools