MetaREVEAL: RL-based Meta-learning from ...
Document type :
Communication dans un congrès avec actes
Permalink :
Title :
MetaREVEAL: RL-based Meta-learning from Learning Curves
Author(s) :
Nguyen, Manh Hung [Auteur]
Grinsztajn, Nathan [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Scool [Scool]
Guyon, Isabelle [Auteur]
Laboratoire Interdisciplinaire des Sciences du Numérique [LISN]
Sun-Hosoya, Lisheng [Auteur]
TAckling the Underspecified [TAU]
Grinsztajn, Nathan [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Scool [Scool]
Guyon, Isabelle [Auteur]
Laboratoire Interdisciplinaire des Sciences du Numérique [LISN]
Sun-Hosoya, Lisheng [Auteur]
TAckling the Underspecified [TAU]
Conference title :
Workshop on Interactive Adaptive Learning co-located with European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2021)
City :
Bilbao/Virtual
Country :
Espagne
Start date of the conference :
2021-09-13
English keyword(s) :
Meta-Learning
Learning Curves
Reinforcement Learning
Learning Curves
Reinforcement Learning
HAL domain(s) :
Informatique [cs]
English abstract : [en]
This paper addresses a cornerstone of Automated Machine Learning: the problem of rapidly uncovering which machine learning algorithm performs best on a new dataset. Our approach leverages performances of such algorithms ...
Show more >This paper addresses a cornerstone of Automated Machine Learning: the problem of rapidly uncovering which machine learning algorithm performs best on a new dataset. Our approach leverages performances of such algorithms on datasets to which they have been previously exposed, i.e., implementing a form of meta-learning. More specifically, the problem is cast as a REVEAL Reinforcement Learning (RL) game: the meta-learning problem is wrapped into a RL environment in which an agent can start, pause, or resume training various machine learning algorithms to progressively "reveal" their learning curves. The learned policy is then applied to quickly uncover the best algorithm on a new dataset. While other similar approaches, such as Freeze-Thaw, were proposed in the past, using Bayesian optimization, our methodology is, to the best of our knowledge, the first that trains a RL agent to do this task on previous datasets. Using real and artificial data, we show that our new RL-based meta-learning paradigm outperforms Free-Thaw and other baseline methods, with respect to the Area under the Learning curve metric, a form of evaluation of Anytime learning (i.e., the capability of interrupting the algorithm at any time while obtaining good performance).Show less >
Show more >This paper addresses a cornerstone of Automated Machine Learning: the problem of rapidly uncovering which machine learning algorithm performs best on a new dataset. Our approach leverages performances of such algorithms on datasets to which they have been previously exposed, i.e., implementing a form of meta-learning. More specifically, the problem is cast as a REVEAL Reinforcement Learning (RL) game: the meta-learning problem is wrapped into a RL environment in which an agent can start, pause, or resume training various machine learning algorithms to progressively "reveal" their learning curves. The learned policy is then applied to quickly uncover the best algorithm on a new dataset. While other similar approaches, such as Freeze-Thaw, were proposed in the past, using Bayesian optimization, our methodology is, to the best of our knowledge, the first that trains a RL agent to do this task on previous datasets. Using real and artificial data, we show that our new RL-based meta-learning paradigm outperforms Free-Thaw and other baseline methods, with respect to the Area under the Learning curve metric, a form of evaluation of Anytime learning (i.e., the capability of interrupting the algorithm at any time while obtaining good performance).Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Submission date :
2021-12-29T02:00:46Z
Files
- https://hal.inria.fr/hal-03502358/document
- Open access
- Access the document