Difference between revisions of "Class meeting for 10-605 Parallel Perceptrons 1"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 3: | Line 3: | ||
=== Slides === | === Slides === | ||
| − | * [http://www.cs.cmu.edu/~wcohen/10-605/mistake-bounds.pptx Slides in Powerpoint] | + | * [http://www.cs.cmu.edu/~wcohen/10-605/mistake-bounds+struct-vp.pptx Slides in Powerpoint] |
=== Preparation for the Class === | === Preparation for the Class === | ||
Revision as of 12:53, 6 February 2015
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2014.
Slides
Preparation for the Class
- My notes on the voted perceptron. (You can skip sections 3-4 on ranking and the structured perceptron in preparing for the class - but they will be covered in this lecture). Alternatively, or in addition, you can view the lecture for 10-601 from 9/22 or 9/23, which can be accessed via MediaTech.
- 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
