Difference between revisions of "10-601 Perceptrons and Voted Perceptrons"
From Cohen Courses
Jump to navigationJump to search (Created page with 'This a lecture used in the Syllabus for Machine Learning 10-601 === Slides === * [http://www.cs.cmu.edu/~wcohen/10-601/voted-perceptron.pptx Slides in Powerpoint]. ''Will …') |
|||
| Line 11: | Line 11: | ||
=== Assignment === | === Assignment === | ||
| − | * Implement voted perceptron and try it on some data. | + | * Implement the voted perceptron and try it on some data. |
=== What You Should Know Afterward === | === What You Should Know Afterward === | ||
Revision as of 15:51, 30 July 2013
This a lecture used in the Syllabus for Machine Learning 10-601
Slides
- Slides in Powerpoint. Will be updated
Readings
- None
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.
