REVIEW 1 cited by
To Share or Not To Share: A Comprehensive Appraisal of Weight-Sharing
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
read the original abstract
Weight-sharing (WS) has recently emerged as a paradigm to accelerate the automated search for efficient neural architectures, a process dubbed Neural Architecture Search (NAS). Although very appealing, this framework is not without drawbacks and several works have started to question its capabilities on small hand-crafted benchmarks. In this paper, we take advantage of the \nasbench dataset to challenge the efficiency of WS on a representative search space. By comparing a SOTA WS approach to a plain random search we show that, despite decent correlations between evaluations using weight-sharing and standalone ones, WS is only rarely significantly helpful to NAS. In particular we highlight the impact of the search space itself on the benefits.
Forward citations
Cited by 1 Pith paper
-
Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution
GC splits a graph supernet into sub-supernets by grouping modules with similar gradient contributions, and UGAS searches combined MPNN and graph transformer architectures; the searched GNNs beat several baselines.
Discussion (0). Continue with ORCID to comment.