Local Search is State of the Art for Neural Architecture Search Benchmarks

6 May 2020 Colin White Sam Nolen Yash Savani

Local search is one of the simplest families of algorithms in combinatorial optimization, yet it yields strong approximation guarantees for canonical NP-Complete problems such as the traveling salesman problem and vertex cover. While it is a ubiquitous algorithm in theoretical computer science, local search is often neglected in hyperparameter optimization and neural architecture search... (read more)

PDF Abstract
TASK DATASET MODEL METRIC NAME METRIC VALUE GLOBAL RANK RESULT BENCHMARK
Neural Architecture Search NAS-Bench-201, ImageNet-16-120 Local search Accuracy (Test) 46.38 # 1
Search time (s) 151200 # 13

Methods used in the Paper


METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet