University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Learning curve prediction for AutoML

Learning curve prediction for AutoML

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact .

Zoom link available upon request (it is sent out on our mailing list, eng-mlg-rcc [at] lists.cam.ac.uk). Sign up to our mailing list for easier reminders via lists.cam.ac.uk.

Automated machine learning (AutoML) aims to automate the process of selecting hyper-parameters for machine learning models, such as learning rate, batch size, or layer width. To this end, machine learning models are trained with different hyper-parameter configurations, their final performance is recorded, and new candidate configurations are selected via Bayesian optimisation. The latter typically constructs a probabilistic surrogate of final model performances as a function of hyper-parameter configurations. However, individual training runs are usually subject to intermediate evaluations, which produce learning curves in addition to their final performance. These learning curves could be leveraged to 1) save resources by stopping unpromising runs early, and 2) improve the probabilistic surrogate to select better candidate configurations. This reading group will review the literature on building scalable probabilistic surrogate models of such learning curves, discussing approaches using Gaussian processes, power laws, Bayesian neural networks, and Transformers.

This talk is part of the Machine Learning Reading Group @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity