Auto-Keras: An Efficient Neural Architecture Search System

被引:489
作者
Jin, Haifeng [1 ]
Song, Qingquan [1 ]
Hu, Xia [1 ]
机构
[1] Texas A&M Univ, Dept Comp Sci & Engn, College Stn, TX 77843 USA
来源
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING | 2019年
关键词
Automated Machine Learning; AutoML; Neural Architecture Search; Bayesian Optimization; Network Morphism;
D O I
10.1145/3292500.3330648
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Neural architecture search (NAS) has been proposed to automatically tune deep neural networks, but existing search algorithms, e. g., NASNet [51], PNAS [29], usually suffer from expensive computational cost. Network morphism, which keeps the functionality of a neural network while changing its neural architecture, could be helpful for NAS by enabling more efficient training during the search. In this paper, we propose a novel framework enabling Bayesian optimization to guide the network morphism for efficient neural architecture search. The framework develops a neural network kernel and a tree-structured acquisition function optimization algorithm to efficiently explores the search space. Extensive experiments on real-world benchmark datasets have been done to demonstrate the superior performance of the developed framework over the state-of-the-art methods. Moreover, we build an open-source AutoML system based on our method, namely Auto-Keras. The code and documentation are available at https://autokeras.com. The system runs in parallel on CPU and GPU, with an adaptive search strategy for different GPU memory limits.
引用
收藏
页码:1946 / 1956
页数:11
相关论文
共 50 条
[1]  
[Anonymous], J MACHINE LEARNING R
[2]  
[Anonymous], 2002, MACHINE LEARNING
[3]  
[Anonymous], DISCRETE MATH
[4]  
[Anonymous], 2017, GEN EV COMP C
[5]  
[Anonymous], 2018, ARXIV180711626
[6]  
[Anonymous], 2017, INT C MACH LEARN
[7]  
[Anonymous], 2019, ARXIV190408547
[8]  
[Anonymous], 2016, INT C LEARN REPR
[9]  
[Anonymous], 2018, INT C LEARNING REPRE
[10]  
[Anonymous], 2017, ARXIV170805552