Pith. sign in

REVIEW 1 cited by

NASI: Label- and Data-agnostic Neural Architecture Search at Initialization

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 2109.00817 v2 pith:QDE2FQA7 submitted 2021-09-02 cs.LG cs.AI

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

Recent years have witnessed a surging interest in Neural Architecture Search (NAS). Various algorithms have been proposed to improve the search efficiency and effectiveness of NAS, i.e., to reduce the search cost and improve the generalization performance of the selected architectures, respectively. However, the search efficiency of these algorithms is severely limited by the need for model training during the search process. To overcome this limitation, we propose a novel NAS algorithm called NAS at Initialization (NASI) that exploits the capability of a Neural Tangent Kernel in being able to characterize the converged performance of candidate architectures at initialization, hence allowing model training to be completely avoided to boost the search efficiency. Besides the improved search efficiency, NASI also achieves competitive search effectiveness on various datasets like CIFAR-10/100 and ImageNet. Further, NASI is shown to be label- and data-agnostic under mild conditions, which guarantees the transferability of architectures selected by our NASI over different datasets.

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. Searching Efficient Deep Architectures for Radar Target Detection using Monte-Carlo Tree Search

    eess.SP 2025-06 conditional novelty 5.0 of 10

    Monte-Carlo tree search found a radar detection network with 60% fewer parameters than a baseline U-Net at comparable detection performance.

Pith tools