nas bench 101 towards reproducible neural architecture
play

NAS-Bench-101 : Towards Reproducible Neural Architecture Search - PowerPoint PPT Presentation

NAS-Bench-101 : Towards Reproducible Neural Architecture Search Chris Ying *1 , Aaron Klein *2 , Esteban Real 1 , Eric Christiansen 1 , Kevin Murphy 1 , Frank Hutter 2 1 Google Brain, 2 University of Freiburg * equal contribution ICML 2019


  1. NAS-Bench-101 : Towards Reproducible Neural Architecture Search Chris Ying *1 , Aaron Klein *2 , Esteban Real 1 , Eric Christiansen 1 , Kevin Murphy 1 , Frank Hutter 2 1 Google Brain, 2 University of Freiburg * equal contribution ICML 2019

  2. Motivation Neural architecture search (NAS) methods are notoriously difficult to reproduce and compare: Different search spaces and training procedures 1. Implicit biases imposed by search space and training, different NAS methods optimized ○ for different setups Cannot separate benefit of NAS from the careful design of the search space and training ○ procedures

  3. Motivation Neural architecture search (NAS) methods are notoriously difficult to reproduce and compare: Different search spaces and training procedures 1. Implicit biases imposed by search space and training, different NAS methods optimized ○ for different setups Cannot separate benefit of NAS from the careful design of the search space and training ○ procedures Compute cost limits number of trials and makes methods inaccessible to 2. most researchers

  4. NAS-Bench-101 General search space of directed ● acyclic graphs for cell-based NAS methods Exhaustively trained & evaluated ● all models on CIFAR-10 to create a queryable dataset ~423K unique cells * 4 epoch budgets * 3 repeats = ~5M total models trained

  5. NAS-Bench-101 Enables: Studying the landscape of a neural architecture search space as a discrete 1) optimization space Efficient benchmarking of NAS methods by separating the process of 2) searching for models (cheap) from evaluating the models (expensive)

  6. Aggregate Analysis of Search Space Search space exhibits locality : ● similar architectures often have similar performance Randomly selecting top model is ● extremely unlikely, but many models within short edit-distance away

  7. Benchmarking Querying dataset enables running ● entire NAS experiments in seconds Can investigate the robustness of ● NAS methods across random repeats Results suggest that conclusions ● may generalize to larger spaces

  8. Pacific Ballroom Poster #12 Dataset and code available at: https://github.com/google-research/nasbench

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend