Pith. sign in

REVIEW 3 cited by

Rethinking Architecture Selection in Differentiable NAS

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 2108.04392 v1 pith:OBFHWJ4H submitted 2021-08-10 cs.LG cs.CV

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

Differentiable Neural Architecture Search is one of the most popular Neural Architecture Search (NAS) methods for its search efficiency and simplicity, accomplished by jointly optimizing the model weight and architecture parameters in a weight-sharing supernet via gradient-based algorithms. At the end of the search phase, the operations with the largest architecture parameters will be selected to form the final architecture, with the implicit assumption that the values of architecture parameters reflect the operation strength. While much has been discussed about the supernet's optimization, the architecture selection process has received little attention. We provide empirical and theoretical analysis to show that the magnitude of architecture parameters does not necessarily indicate how much the operation contributes to the supernet's performance. We propose an alternative perturbation-based architecture selection that directly measures each operation's influence on the supernet. We re-evaluate several differentiable NAS methods with the proposed architecture selection and find that it is able to extract significantly improved architectures from the underlying supernets consistently. Furthermore, we find that several failure modes of DARTS can be greatly alleviated with the proposed selection method, indicating that much of the poor generalization observed in DARTS can be attributed to the failure of magnitude-based architecture selection rather than entirely the optimization of its supernet.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive

    cs.CL 2024-02 conditional novelty 6.0 of 10

    DPOP is a new loss function that prevents DPO from lowering preferred response likelihoods and outperforms standard DPO on diverse datasets, MT-Bench, and enables Smaug-72B to exceed 80% on the Open LLM Leaderboard.

  2. Uncovering Scaling Laws for Large Language Models via Inverse Problems

    cs.LG 2025-09 conditional novelty 4.0 of 10

    Proposes using inverse problems to discover LLM scaling laws, but provides no empirical evidence or new results.

  3. DANCE: Resource-Efficient Neural Architecture Search with Data-Aware and Continuous Adaptation

    cs.LG 2025-07 reject novelty 4.0 of 10

    DANCE reformulates NAS as continuous evolution via learned stochastic gates over feature dimensions, but its headline 'consistently outperforms' claim fails on CIFAR-10 and is undermined by weak baselines.

Pith tools