University of Cambridge > > Machine Learning Reading Group @ CUED > Active Learning

Active Learning

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

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

This RCC is going to be about active learning. I will start by giving some motivating examples for where active learning can be useful in experimental sciences and in large-scale machine learning applications. I will draw a rough taxonomy of active learning methods, mentioning the difference between transductive and inductive active learning, loss-oriented vs. information theoretic approaches. I will introduce a simple toy model for linearly separable binary classification, and use it to illustrate the idea behind different approaches to information theoretic active learning. I will talk in detail about the methods proposed by Tong and Koller (2001), resulting in one of the most highly cited papers in machine learning, and contrast it with related methods based on as query by committee. I’m also going to touch upon relatively recent theoretical results by Steve Hanneke on the fast rates of convergence certain active learning methods can achieve.

Recommended reading

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-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity