Parallel Online Learning

author: John Langford, Microsoft Research
published: Jan. 19, 2010,   recorded: December 2009,   views: 713
Categories

Slides

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

A fundamental limit on the speed of training and prediction is imposed by bandwidth: there is a finite amount of data that a computer can access in a fixed amount of time. Somewhat surprisingly, we can build an online learning algorithm fully capable of hitting this limit. I will discuss approaches for breaking the bandwidth limit, including empirical results.

See Also:

Download slides icon Download slides: nipsworkshops09_langford_pol_01.pdf (161.7┬áKB)


Help icon Streaming Video Help

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: