Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

1122 · Jun 202019922001200920172026
11 results for NAS-Bench-201

BRP-NAS uses GCNs to predict neural network performance for more efficient NAS.

problem Inaccurate performance metrics in NAS lead to suboptimal model designs.
method Proposes BRP-NAS, a hardware-aware NAS using GCNs for accurate performance prediction.
result BRP-NAS outperforms previous methods on NAS-Bench-101 and 201, improving model sample efficiency.

This study analyzes NAS benchmarks and finds that only a subset of operations is crucial for generating high-performing architectures.

problem NAS benchmarks lack generability and provide skewed performance distributions, leading to unreliable comparisons.
method Empirical analysis of widely used NAS benchmarks (101, 201, TransNAS-Bench-101) focusing on operation importance and generability.
result Only a subset of operations is necessary to generate architectures close to the upper-bound performance range, and convolution layers have the highest impact.

Neural Architecture Search remains a very challenging meta-learning problem. Several recent techniques based on parameter-sharing idea have focused on reducing the NAS running time by leveraging proxy models, leading to architectures with competitive performance compared to those with hand-crafted designs. In this pape…

2019-06-07abs ↗pdf ↗

This work benchmarks and theorizes robust NAS under adversarial training.

problem Lack of benchmark evaluations and theoretical guarantees for robust NAS architectures under adversarial training.
method Released a comprehensive data set and established a generalization theory using the neural tangent kernel.
result Established a generalization theory for robust NAS architectures under adversarial training.

DrNAS improves neural architecture search with Dirichlet distribution and progressive learning.

problem Efficiently search for neural architectures with improved generalization and exploration.
method Formulates architecture search as a distribution learning problem using Dirichlet distribution and gradient-based optimization. Introduces a progressive learning scheme to handle large-scale tasks.
result Achieves state-of-the-art results on CIFAR-10 and ImageNet, demonstrating improved generalization and exploration.

LC-PFN predicts learning curve performance more accurately and faster than MCMC.

problem Bayesian extrapolation of learning curves is computationally expensive and overly restrictive.
method Prior-Data Fitted Neural Networks (PFNs) for approximate Bayesian inference.
result LC-PFN outperforms MCMC in accuracy and is significantly faster.

WeakNAS uses a set of weaker predictors to find top architectures with fewer samples.

problem Finding the best neural architecture with heavy computation costs.
method Proposes a paradigm shift from fitting the whole architecture space to progressively fitting a search path through a set of weaker predictors.
result WeakNAS produces coarse-to-fine iteration to gradually refine the ranking of sampling space, requiring fewer samples to find top-performance architectures.