[论文解读] Neural Architecture Search: A Survey
This survey categorizes neural architecture search (NAS) methods along search space, search strategy, and performance estimation strategies, outlining common designs, algorithms, and future directions. It compares RL, evolutionary, Bayesian, and gradient-based approaches and discusses efficiency techniques for evaluating architectures.
Deep Learning has enabled remarkable progress over the last years on a variety of tasks, such as image recognition, speech recognition, and machine translation. One crucial aspect for this progress are novel neural architectures. Currently employed architectures have mostly been developed manually by human experts, which is a time-consuming and error-prone process. Because of this, there is growing interest in automated neural architecture search methods. We provide an overview of existing work in this field of research and categorize them according to three dimensions: search space, search strategy, and performance estimation strategy.
研究动机与目标
- Motivate the study of NAS as a logical step in automating architecture engineering for deep learning.
- Categorize NAS methods by search space, search strategy, and performance estimation strategy.
- Survey historical and current approaches (RL, evolution, BO, gradient-based) and efficiency techniques for performance estimation.
提出的方法
- Review and categorize NAS literature along three dimensions: search space, search strategy, and performance estimation.
- Describe common search spaces (chain-structured, multi-branch with skip connections, and cell-based spaces) and discuss their implications for optimization.
- Summarize diverse search strategies (reinforcement learning, neuro-evolution, Bayesian optimization, gradient-based methods, random/hill-climbing) and their pros/cons.
- Explain performance estimation strategies to reduce computational cost, including low-fidelity proxies, learning curve extrapolation, weight inheritance/morphisms, one-shot models, and their biases.

实验结果
研究问题
- RQ1What are the main components and design choices in NAS (search space, search strategy, performance estimation) and how do they interact?
- RQ2How do different NAS approaches (RL, evolution, BO, gradient-based) compare in terms of efficiency and final performance?
- RQ3What techniques exist to speed up NAS performance estimation, and what biases do they introduce?
- RQ4What future directions could broaden NAS beyond image classification and into multi-task, multi-objective, or robust architectures?
主要发现
- NAS methods have outperformed manual architectures on tasks like image classification, object detection, and semantic segmentation in various works.
- Cell-based search spaces reduce search space size and improve transferability across datasets, enabling faster search and reuse of learned designs.
- One-shot and weight-sharing NAS drastically reduce computational resources to a few GPU days but introduce potential biases and correlations that require careful analysis.
- Gradient-based NAS (continuous relaxations) enables efficient optimization but depends on relaxation quality and may require discretization post-optimization.
- RL and evolution offer competitive performance with different trade-offs in anytime performance and architecture sizes; random search is generally outperformed in reported studies.
- There is evidence that lower-fidelity performance estimates speed up search but can bias architecture ranking if fidelity gaps are large.

更好的研究,从现在开始
从论文设计到论文写作,大幅缩短您的研究时间。
无需绑定信用卡
本解读由 AI 生成,并经人工编辑审核。