atlas

Research map / Architectures and efficiency / Neural architecture search

MOTE-NAS: Multi-Objective Training-based Estimate for Efficient Neural Architecture Search

NeurIPS 2024 · Architectures and efficiency › Neural architecture search · approach: Bi-level differentiable NAS · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes MOTE, a training-based zero/few-cost estimate combining a loss-landscape term and a unit-time training-speed term, computed on a reduced architecture and reduced CIFAR-100 subset, and embeds it in an evolutionary NAS (MOTE-NAS) that reaches new accuracy-cost trade-offs on NASBench-201.

Problem

Neural architecture search is expensive because candidate architectures must be trained to get accurate performance estimates; existing NTK-based training-free estimates ignore the non-convex, nonlinear training dynamics of finite-width DNNs.

Approach

MOTE sums a landscape term (cross-entropy along linear interpolations between initial and trained weights) and a speed term (per-epoch training loss divided by epoch time), transformed with box-cox, and uses reduced architecture and reduced dataset to make the estimate cheap (~7 GPU seconds per candidate), integrated into an iterative evolutionary search with top-k early-stopping evaluation.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
combine the landscape and speed terms in MOTE for candidate rankingNASBench-101 architectures · NASBench-101Kendall's Tau correlation: 0.47Helped
use MOTE-NAS instead of TE-NAS, KNAS, or Eigen-NASNASBench-201 search · NASBench-201accuracy: 94.32; 72.81; 46.38Helped
omit the evaluation stage and select the top-1 architecture using MOTE (ablation)MOTE-NAS · NASBench-201 CIFAR-10accuracy: 94.32 -> 93.54Hurt
omit the evaluation stage and select the top-1 architecture using MOTE (ablation)MOTE-NAS · NASBench-201 CIFAR-100accuracy: 72.81 -> 71.59Hurt
omit the evaluation stage and select the top-1 architecture using MOTE (ablation)MOTE-NAS · NASBench-201 ImageNet-16-120accuracy: 46.38 -> 44.73Hurt
use box-cox rather than no transformation (ablation)MOTE scoring · NASBench-201 CIFAR-10Kendall's τ correlation: 0.66 -> 0.68Helped
use box-cox rather than logarithm (ablation)MOTE scoring · NASBench-201 CIFAR-100Kendall's τ correlation: 0.64 -> 0.66Helped
use box-cox rather than reciprocal (ablation)MOTE scoring · NASBench-201 ImageNet-16-120Kendall's τ correlation: 0.60 -> 0.62Helped
replace the original meta-architecture with a reduced architecture and rank by early-stopping accuracy (ablation)NASBench-101 candidate ranking · NASBench-101Kendall's τ correlation (%): 34.5 -> 8.1Hurt
use MOTE with the reduced architecture instead of early-stopping accuracy with the reduced architecture (ablation)NASBench-101 candidate ranking · NASBench-101Kendall's τ correlation (%): 8.1 -> 50.1Helped
add a reduced dataset with r=10 labels to MOTE + RA (ablation)NASBench-101 candidate ranking · NASBench-101Kendall's τ correlation (%): 50.1 -> 46.6Hurt
replace evolutionary search with random sampling (ablation)MOTE-NAS · NASBench-201accuracy: 94.07%; 72.60%; 46.13%Mixed

Surprising findings

Limitations

Experimental setup

Datasets: NASBench-101 NASBench-201 CIFAR-100 CIFAR-10 ImageNet-16-120 ImageNet-1K

Benchmarks: NASBench-101 NASBench-201 ImageNet-1K

Metrics: test accuracy Kendall's tau search cost (GPU seconds)

Baselines: TE-NAS KNAS Eigen-NAS LGA NASWOT ZICO SynFlow TSE Neural Predictor WeakNAS Proxy-BO OFA

Builds on: NTK-based NAS (TE-NAS) Training Speed Estimation (TSE) KNAS Label-Gradient Alignment (LGA) NASBench-201

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy