Difference between revisions of "10-601 Perceptrons and Voted Perceptrons"

From Cohen Courses
Jump to navigationJump to search
 
(8 intermediate revisions by the same user not shown)
Line 1: Line 1:
This a lecture used in the [[Syllabus for Machine Learning 10-601]]
+
This a lecture used in the [[Syllabus for Machine Learning 10-601B in Spring 2016]]
  
 
=== Slides ===
 
=== Slides ===
  
* [http://www.cs.cmu.edu/~wcohen/10-601/voted-perceptron.pptx Slides in Powerpoint].  ''Will be updated''
+
* [http://www.cs.cmu.edu/~wcohen/10-601/voted-perceptron.pptx Slides in Powerpoint]
  
 
=== Readings ===
 
=== Readings ===
  
 +
* [http://www.cs.cmu.edu/~wcohen/10-601/vp-notes/vp.pdf My notes on the voted perceptron].  (You can skip sections 3-4 on ranking and the structured perceptron).
 
* Optional reading:  Freund, Yoav, and Robert E. Schapire. "Large margin classification using the perceptron algorithm." Machine learning 37.3 (1999): 277-296.
 
* 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: [http://www.cs.cmu.edu/~zkolter/course/linalg/ Zico Kolter's linear algebra review lectures]
=== Assignment ===
 
 
 
* Implement the voted perceptron and try it on some data.
 
  
 
=== What You Should Know Afterward ===
 
=== What You Should Know Afterward ===

Latest revision as of 16:17, 6 January 2016

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

Slides

Readings

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.