An Online Algorithm for Learning a Labeling of a Graph

author: Kristiaan Pelckmans, Department of Information Technology, Uppsala University
published: Aug. 25, 2008,   recorded: July 2008,   views: 3069

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

This short report analyzes a simple and intuitive online learning algorithm - termed the graphtron - for learning a labeling over a fixed graph, given a sequence of labels. The contribution is twofold, (a) we give a theoretical characterization of the possible sequence of mistakes, and (b) we indicate the use for extremely large-scale problems due to sublinear space complexity and nearly linear time complexity. This work originated from numerous discussions with John, Mark and with Johan.

See Also:

Download slides icon Download slides: mlg08_pelckmans_aoa_01.pdf (1.5┬áMB)


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: