10-601 Perceptrons and Voted Perceptrons

From Cohen Courses
Revision as of 10:32, 24 September 2013 by Wcohen (talk | contribs) (→‎Readings)
Jump to navigationJump to search

This a lecture used in the Syllabus for Machine Learning 10-601

Slides

Readings

  • Optional reading: Freund, Yoav, and Robert E. Schapire. "Large margin classification using the perceptron algorithm." Machine learning 37.3 (1999): 277-296.
  • Optional background on linear algebra: Zico Kolter's linear algebra review lectures

Assignment

  • Implement the voted perceptron and try it on some data.

What You Should Know Afterward

  • The difference between an on-line and batch algorithm.
  • How to implement the voted perceptron.
  • The definition of a mistake bound, and a margin.
Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=10-601_Perceptrons_and_Voted_Perceptrons&oldid=16203"