An Online Algorithm for Learning a Labeling of a Graph
published: Aug. 25, 2008, recorded: July 2008, views: 3069
Report a problem or upload filesIf 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.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !