OBOE: Collaborative Filtering for AutoML Model Selection

被引:52
作者
Yang, Chengrun [1 ]
Akimoto, Yuji [1 ]
Kim, Dae Won [1 ]
Udell, Madeleine [1 ]
机构
[1] Cornell Univ, Ithaca, NY 14853 USA
来源
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING | 2019年
关键词
AutoML; meta-learning; time-constrained; model selection; collaborative filtering; ALGORITHMS;
D O I
10.1145/3292500.3330909
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Algorithm selection and hyperparameter tuning remain two of the most challenging tasks in machine learning. Automated machine learning (AutoML) seeks to automate these tasks to enable widespread use of machine learning by non-experts. This paper introduces Oboe, a collaborative filtering method for time-constrained model selection and hyperparameter tuning. Oboe forms a matrix of the cross-validated errors of a large number of supervised learning models (algorithms together with hyperparameters) on a large number of datasets, and fits a low rank model to learn the low-dimensional feature vectors for the models and datasets that best predict the cross-validated errors. To find promising models for a new dataset, Oboe runs a set of fast but informative algorithms on the new dataset and uses their cross-validated errors to infer the feature vector for the new dataset. Oboe can find good models under constraints on the number of models fit or the total time budget. To this end, this paper develops a new heuristic for active learning in time-constrained matrix completion based on optimal experiment design. Our experiments demonstrate that Oboe delivers state-of-the-art performance faster than competing approaches on a test bed of supervised learning problems. Moreover, the success of the bilinear model used by Oboe suggests that AutoML may be simpler than was previously understood.
引用
收藏
页码:1173 / 1183
页数:11
相关论文
共 45 条
  • [1] [Anonymous], 2015, ARXIV150703194
  • [2] [Anonymous], 2018, ICLR
  • [3] Bardenet R., 2013, INT C MACH LEARN ICM, P199, DOI DOI 10.5555/3042817.3042916
  • [4] Tuning search algorithms for real-world applications: A regression tree based approach
    Bartz-Beielstein, T
    Markon, S
    [J]. CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1111 - 1118
  • [5] Bergstra J, 2011, ADV NEURAL INFORM PR, P2546, DOI 10.5555/2986459.2986743
  • [6] Bischl B., 2017, mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions
  • [7] Boyd Stephen, 2004, Convex Optimization, DOI 10.1017/CBO9780511804441
  • [8] Caruana R., 2004, P 21 INT C MACHINE L
  • [9] Caruana R, 2006, IEEE DATA MINING, P828
  • [10] Autostacker: A Compositional Evolutionary Learning System
    Chen, Boyuan
    Wu, Harvey
    Mo, Warren
    Chattopadhyay, Ishanu
    Lipson, Hod
    [J]. GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, : 402 - 409