CS229

From Noisebridge
(Difference between revisions)
Jump to: navigation, search
(Overview)
m (Reverted edits by Abenaqadat (Talk) to last revision by Cake)
(39 intermediate revisions by 19 users not shown)
Line 1: Line 1:
 
== Overview ==
 
== Overview ==
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.
+
CS229 is the undergraduate machine learning course at Stanford. You can watch the lectures on [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 in January 2011. There are four problem sets which we'll be doing one every 5 weeks.
 +
 
 +
The plan is to '''watch the lectures in your own time'''. We'll be discussing our solutions to problem sets every 5 weeks. Bring any questions about the course you have along to a meeting and there might be someone there who can help you out.
 +
 
 +
Please note:
 +
* there is no instructor at Noisebridge - this is just a study group.
 +
* We are taking the course at a slower rate than the actual course (which is currently in session at the farm).
 +
* Not everyone is at the same point in the course - its ok if you want to start today, there are others who have recently started too.
  
 
[http://www.stanford.edu/class/cs229/ http://www.stanford.edu/class/cs229/]  
 
[http://www.stanford.edu/class/cs229/ http://www.stanford.edu/class/cs229/]  
Line 22: Line 29:
  
 
[http://www.google.com/calendar/embed?src=cWE3bGFpNnZxazdpamNjbmc4bXJsY2hyNGdAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ  Google Calendar of schedule]
 
[http://www.google.com/calendar/embed?src=cWE3bGFpNnZxazdpamNjbmc4bXJsY2hyNGdAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ  Google Calendar of schedule]
 +
 +
 +
=== Supplemental Materials ===
 +
 +
[[File: CS229_sample_data.xls]]
 +
 +
==== Problem Sets from 2009 ====
 +
* Problem set 1: [[File:CS229 ps1.pdf]]
 +
** [[CS229 Problem Set 1 q1x dat]]
 +
** [[CS229 Problem Set 1 q1y dat]]
 +
** [[CS229 Problem Set 1 q2x dat]]
 +
** [[CS229 Problem Set 1 q2y dat]]
  
 
==Progress: Watching Lectures ==
 
==Progress: Watching Lectures ==
Line 48: Line 67:
 
|-
 
|-
 
| Thomas
 
| Thomas
 +
| [[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
| [[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
| [[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
| [[Image:Gold-star.jpg|center|30px|Gold-Star]]
 
|
 
|
 
|
 
|
Line 59: Line 82:
 
|
 
|
 
|
 
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|-
 +
| Joe
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 
|
 
|
 
|
 
|
Line 69: Line 110:
 
|
 
|
 
|-
 
|-
| Joe
+
| Glen
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 
|
 
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|-
 +
| Dave
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 
|
 
|
 
|
 
|
Line 91: Line 154:
 
|
 
|
 
|-
 
|-
| Glen
+
| Jason
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 
|
 
|
 
|
 
|
 
|
 
|
 
|
 
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|
 +
|-
 +
| Kai
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 +
|[[Image:Gold-star.jpg|center|30px|Gold-Star]]
 
|
 
|
 
|
 
|
Line 114: Line 200:
 
|-
 
|-
 
| You!
 
| You!
 +
|
 
|
 
|
 
|
 
|
Line 152: Line 239:
 
|-
 
|-
 
| Joe
 
| Joe
|
+
| Q1-4
 
|
 
|
 
|
 
|
Line 159: Line 246:
 
| Glen
 
| Glen
 
|
 
|
 +
|
 +
|
 +
|
 +
|-
 +
| Kai
 +
| 1a,2a
 
|
 
|
 
|
 
|

Revision as of 19:31, 23 November 2010

Contents

Overview

CS229 is the undergraduate machine learning course at Stanford. You can watch the lectures on iTunesU and Youtube. We are going to be working through the course at one lecture a week starting 1 September 2010 and finishing in January 2011. There are four problem sets which we'll be doing one every 5 weeks.

The plan is to watch the lectures in your own time. We'll be discussing our solutions to problem sets every 5 weeks. Bring any questions about the course you have along to a meeting and there might be someone there who can help you out.

Please note:

  • there is no instructor at Noisebridge - this is just a study group.
  • We are taking the course at a slower rate than the actual course (which is currently in session at the farm).
  • Not everyone is at the same point in the course - its ok if you want to start today, there are others who have recently started too.

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


Supplemental Materials

File:CS229 sample data.xls

Problem Sets from 2009

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
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Joe
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Glen
Gold-Star
Dave
Gold-Star
Jason
Gold-Star
Gold-Star
Gold-Star
Gold-Star
Kai
Gold-Star
Gold-Star
Gold-Star
Gold-Star
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 Q1-4
Glen
Kai 1a,2a
You!
Personal tools