Efficient Active Learning

author: Nikos Karampatziakis, Department of Computer Science, Cornell University
published: July 25, 2011,   recorded: July 2011,   views: 4515
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

We present and analyze an active learning algorithm that is theoretically sound in an agnostic setting, empirically effective, and as efficient as standard online learning algorithms. This allows us to soundly and effectively optimize the explore/exploit trade-off in active learning at a scale of 10^6 examples/second. The present work is primarily based on (Beygelzimer et al., 2010) and (Karampatziakis & Langford, 2011).

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: