Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019

被引:7
作者
Liu, Zhengying [1 ]
Pavao, Adrien [1 ]
Xu, Zhen [2 ]
Escalera, Sergio [3 ,4 ]
Ferreira, Fabio [5 ]
Guyon, Isabelle [1 ]
Hong, Sirui [6 ]
Hutter, Frank [5 ]
Ji, Rongrong [7 ]
Jacques, Julio C. S., Jr. [8 ]
Li, Ge [9 ]
Lindauer, Marius [10 ]
Luo, Zhipeng [9 ]
Madadi, Meysam [11 ]
Nierhoff, Thomas [5 ]
Niu, Kangning [9 ]
Pan, Chunguang [9 ]
Stoll, Danny [5 ]
Treguer, Sebastien [12 ]
Wang, Jin [9 ]
Wang, Peng [13 ]
Wu, Chenglin [6 ]
Xiong, Youcheng [6 ]
Zela, Arber [5 ]
Zhang, Yang [6 ]
机构
[1] Univ Paris Saclay, F-91190 Gif Sur Yvette, France
[2] 4Paradigm, AutoML, Beijing 100125, Peoples R China
[3] Univ Barcelona, Barcelona 08007, Spain
[4] Comp Vis Ctr, Barcelona 08007, Spain
[5] Univ Freiburg, Dept Comp Sci, D-79085 Freiburg, Germany
[6] DeepWisdom Inc, Xiamen 361001, Fujian, Peoples R China
[7] Xiamen Univ, Cognit Sci, Xiamen 361005, Fujian, Peoples R China
[8] Univ Oberta Catalunya, Comp Sci Multimedia & Telecommun, Barcelona 08035, Spain
[9] DeepBlue Technol, Beijing 200336, Peoples R China
[10] Leibniz Univ Hannover, Elect Engn & Comp Sci, D-30167 Hannover, Germany
[11] Univ Autonoma Barcelona, Comp Vis Ctr, Barcelona 08193, Spain
[12] La Paillasse, AI, F-75002 Paris, France
[13] Lenovo AI Lab, AI, Beijing 100085, Peoples R China
基金
欧洲研究理事会;
关键词
Deep learning; Task analysis; Videos; Tensors; Computer architecture; Benchmark testing; Internet; AutoML; deep learning; meta-learning; neural architecture search; model selection; hyperparameter optimization;
D O I
10.1109/TPAMI.2021.3075372
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper reports the results and post-challenge analyses of ChaLearn's AutoDL challenge series, which helped sorting out a profusion of AutoML solutions for Deep Learning (DL) that had been introduced in a variety of settings, but lacked fair comparisons. All input data modalities (time series, images, videos, text, tabular) were formatted as tensors and all tasks were multi-label classification problems. Code submissions were executed on hidden tasks, with limited time and computational resources, pushing solutions that get results quickly. In this setting, DL methods dominated, though popular Neural Architecture Search (NAS) was impractical. Solutions relied on fine-tuned pre-trained networks, with architectures matching data modality. Post-challenge tests did not reveal improvements beyond the imposed time limit. While no component is particularly original or novel, a high level modular organization emerged featuring a "meta-learner", "data ingestor", "model selector", "model/learner", and "evaluator". This modularity enabled ablation studies, which revealed the importance of (off-platform) meta-learning, ensembling, and efficient data management. Experiments on heterogeneous module combinations further confirm the (local) optimality of the winning solutions. Our challenge legacy includes an ever-lasting benchmark (http://autodl.chalearn.org), the open-sourced code of the winners, and a free "AutoDL self-service."
引用
收藏
页码:3108 / 3125
页数:18
相关论文
共 68 条
[1]  
[Anonymous], 2020, SPEARMANS RANK CORRE
[2]  
Baker B., 2017, INT C LEARNING REPRE, P1
[3]  
Bergstra J., 2013, PMLR, P115, DOI DOI 10.5555/3042817.3042832
[4]  
Bergstra J., 2011, P 25 INT C NEUR INF, P24, DOI DOI 10.5555/2986459.2986743
[5]  
Brain K., 2019, AUTOCLINT AUTOMATIC
[6]  
Brazdil PB, 2000, LECT NOTES ARTIF INT, V1810, P63
[7]  
BRIDLE JS, 1974, 1003 JOINT SPEECH RE
[8]  
Cai Han, 2019, INT C LEARN REPR ICL
[9]  
Caruana R., 2004, P 21 INT C MACHINE L, V18, DOI 10.1145/1015330.1015432
[10]  
Chen X., 2019, IEEE DATA MINING, P71, DOI DOI 10.1109/ICDM.2019.00017