Cs 109

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Mehran Sahami Handout #2

CS109 January 3, 2011

Syllabus
(Subject to change by the management at any time with high probability)

Monday Wednesday Friday


January 3 5 7
Administrivia Combinations Sample spaces
Counting Permutations Axioms of probability

Read: Chap. 1.1-1.2 Read: Chap. 1.3-1.6 Read: Chap. 2.1-2.5, 2.7
10 12 14
Conditional probability Discrete random variables
Bayes Theorem Independence Mass functions & Expectation
Read: Chap. 4.1-4.4
Read: Chap. 3.1-3.3 Read: Chap. 3.4-3.5 DUE: PROBLEM SET #1
17 19 21
Variance
Martin Luther King, Jr. Day Discrete probability distributions More discrete distributions
(No Class)
Read: Chap. 4.5-4.6 Read: Chap. 4.7-4.10
24 26 28
Continuous random variables Normal distribution
Simple continuous distributions Joint distribution functions
Read: Chap. 5.4-5.6
Read: Chap. 5.1-5.3 DUE: PROBLEM SET #2 Read: Chap. 6.1
31 February 2 4
Properties of expectation
Independent random variables Conditional distributions Expected algorithm running times
Read: Chap. 7.1-7.2
Read: Chap. 6.2-6.3 Read: Chap. 6.4-6.5 DUE: PROBLEM SET #3
7 9 11
Covariance Conditional expectation Moment generating functions
Correlation
Read: Thursday, February 10th
Read: Chap. 7.3-7.4 Chap. 7.5-7.6 7-9pm: Midterm Exam Read: Chap. 7.7
14 16 18
Central Limit Theorem
Helpful inequalities and theorems Parameter estimation
Read: Chap. 8.3-8.4 Method of moments
Read: Chap. 8.1-8.2, 8.5 DUE: PROBLEM SET #4
21 23 25

Presidents’ Day Maximum likelihood estimation Prior probabilities


(No Class) Bayesian estimation

28 March 2 4
Introduction to Machine Learning
Naive Bayes classifier Logistic regression Modeling uncertainty
Utility
DUE: PROBLEM SET #5
7 9 11
Simulating probabilities Dead Day:
Monte Carlo simulation Review for Final Exam our token attempt at Dead Week
(No class lecture)
Read: Chap. 10.1-10.3 DUE: PROBLEM SET #6

Final Exam: Friday, March 18th, 8:30am-11:30am

You might also like