Lectures: Wednesdays 1.00-3.00pm (Room BA 2135)
Tutorials: Wednesdays 3.00-4.00pm (Room BA 2135)
First lecture: January 9; No lecture on February 20
Last lecture and final test April 9.
Instructors: Richard Zemel & Geoffrey Hinton; email csc2535profs [at sign] cs.toronto.edu
Office Hours: Geoffrey Hinton: Wednesdays 5.00-6.00pm (Pratt 290G); Richard Zemel: Thursdays 2.00-3.00pm (Pratt 290D)
Tutor: Ruslan Salakhutdinov; email csc2535ta [at sign] cs.toronto.edu
Office Hours: Mondays 4.00-5.00pm (Pratt 275)

Please do NOT send email about the class directly to the personal accounts of the instructors or TA. They will not answer class email except to csc2535profs or csc2535ta [at sign] cs.toronto.edu

Prerequisites: CSC2515: Introduction to Machine Learning (or equivalent -- ask instructors).

Load: 24 hours of lectures; two assignments; one project, one test.

Required Readings: Some of the lectures will be based on Pattern Recognition and Machine Learning, by Chris Bishop which should be available from the bookstore. Other lectures will have one or two required papers or chapters per lecture. These required readings will be available on the web.

Marking Scheme:

Two assignments worth 20% each

Final test worth 20%

Project worth 40%

Computing: Many of the algorithms will be implemented in Matlab, and the projects will be done in Matlab, but prior knowledge of Matlab is not required. [Computing Information] [Matlab Information]

Auditing: If you are not registered in the class, it is possible for you to audit it (sit in on the lectures), but only if you get the instructor's permission and follow some rules. See the audit page for more info.