University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Active Learning

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Active Learning

Download to your calendar using vCal

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

In many real-world problems such as medical diagnosis, labelling data is expensive and labelled datasets are scarce. Active learning describes a set of machine learning techniques that choose their own training data. The key idea behind active learning is to achieve greater accuracy with fewer training labels by allowing the ML algorithm to choose the data from which it learns. To this end, the active learning algorithm poses queries (i.e. unlabelled data instances) to be labelled by an oracle (e.g., a human annotator).

In this reading group session, we aim to provide a broad overview over both the foundations and frontiers of active learning. We will first define active learning, contrast it against other formulations of machine learning, and describe the standard techniques used to select queries. We will then survey recent advances in active learning, often in the context of (Bayesian) deep neural networks. We hope to conclude with an open-ended discussion on active learning.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge University Engineering Department, Lecture Room number TBD FW26, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Senior Parlour, Gonville & Caius College

Other talks

TBC Genomic Medicine CPC Title and abstract tba Gastroenterology and Acute Medicine Sheref Mansy, topic TBA Online Causal Inference Semina
 

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