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

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)

Results in Papers With Code
(↓ scroll down to see all results)