Automated Machine Learning with Monte-Carlo Tree Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Automated Machine Learning with Monte-Carlo Tree Search


The AutoML task consists of selecting the proper algorithm in a machine learning portfolio, and its hyperparameter values, in order to deliver the best performance on the dataset at hand. MOSAIC, a Monte-Carlo tree search (MCTS) based approach, is presented to handle the AutoML hybrid structural and parametric expensive black-box optimization problem. Extensive empirical studies are conducted to independently assess and compare: i) the optimization processes based on Bayesian optimization or MCTS; ii) its warm-start initializa-tion; iii) the ensembling of the solutions gathered along the search. MOSAIC is assessed on the OpenML 100 benchmark and the Scikit-learn portfolio, with statistically significant gains over AUTO-SKLEARN, winner of former international AutoML challenges.
Fichier principal
Vignette du fichier
mosaic_ijcai2019.pdf (409.36 Ko) Télécharger le fichier

Dates and versions

hal-02300884 , version 1 (30-09-2019)



Herilalaina Rakotoarison, Marc Schoenauer, Michèle Sebag. Automated Machine Learning with Monte-Carlo Tree Search. IJCAI-19 - 28th International Joint Conference on Artificial Intelligence, Aug 2019, Macau, China. pp.3296-3303, ⟨10.24963/ijcai.2019/457⟩. ⟨hal-02300884⟩
242 View
303 Download



Gmail Mastodon Facebook X LinkedIn More