CS229: Difference between revisions

From Noisebridge
Jump to navigation Jump to search
Line 1: Line 1:
== Overview ==
== Overview ==
CS229 is the undergraduate machine learning course at Stanford. You can see the lectures from iTunesU and Youtube. We are going to be working through the course at one lecture a week starting 1 September 2010 and finishing 22 December 2010. There are four problem sets which we'll be doing every 4 weeks.
CS229 is the undergraduate machine learning course at Stanford. You can see the lectures from [http://itunes.apple.com/WebObjects/MZStore.woa/wa/viewiTunesUCollection?id=384233048#ls=1 iTunesU] and [http://www.youtube.com/results?search_query=stanford%20cs%20229&search=Search&sa=X&oi=spell&resnum=0&spell=1 Youtube]. We are going to be working through the course at one lecture a week starting 1 September 2010 and finishing 22 December 2010. There are four problem sets which we'll be doing every 4 weeks.


[http://www.stanford.edu/class/cs229/ http://www.stanford.edu/class/cs229/]  
[http://www.stanford.edu/class/cs229/ http://www.stanford.edu/class/cs229/]  

Revision as of 21:55, 25 August 2010

Overview

CS229 is the undergraduate machine learning course at Stanford. You can see the lectures from iTunesU and Youtube. We are going to be working through the course at one lecture a week starting 1 September 2010 and finishing 22 December 2010. There are four problem sets which we'll be doing every 4 weeks.

http://www.stanford.edu/class/cs229/

Course Description

This course provides a broad introduction to machine learning and statistical pattern recognition. Topics include: supervised learning (generative/discriminative learning, parametric/non-parametric learning, neural networks, support vector machines); unsupervised learning (clustering, dimensionality reduction, kernel methods); learning theory (bias/variance tradeoffs; VC theory; large margins); reinforcement learning and adaptive control. The course will also discuss recent applications of machine learning, such as to robotic control, data mining, autonomous navigation, bioinformatics, speech recognition, and text and web data processing.

Schedule

  • one lecture a week
  • one problem set every five weeks

Google Calendar of schedule

Progress: Watching Lectures

Name Lecture 1 Lecture 2 Lecture 3 Lecture 4 Lecture 5
9/29
Lecture 6 Lecture 7 Lecture 8 Lecture 9 Lecture 10
11/3
Lecture 11 Lecture 12 Lecture 13 Lecture 14 Lecture 15
12/8
Lecture 16 Lecture 17 Lecture 18 Lecture 19 Lecture 20
1/12
Thomas
Joe
Glen
You!

Progress: Assignments

Name Problem set 1
due 9/29
Problem set 2
due 11/3
Problem set 3
due 12/8
Problem set 4
due 1/20
Thomas
Joe
Glen
You!