Event Type | Date | Description | Readings | Course Materials |
---|---|---|---|---|
Lecture 1 | Wednesday Jan 9 |
What is machine learning? Course overview and an orientation to the major branches of machine learning: unsupervised, supervised, and reinforcement learning |
None | [slides] |
Lecture 2 | Monday Jan 14 |
An end-to-end machine learning example Stating the problem, creating the model, evaluating performance, and operationalizing the solution |
ISL Ch. 1 + 2.1 | [slides] |
Lecture 3 | Wednesday Jan 16 |
How flexible should my algorithms be: the bias-variance tradeoff K-nearest neighbors classification and the bias-variance tradeoff |
ISL 2.2 | [slides] |
No class | Monday Jan 21 |
Martin Luther King, Jr. Day | ||
Deliverable | Wednesday Jan 23 |
Assignment #1 Due | [assignment] | |
Lecture 4 | Wednesday Jan 23 |
Linear Models I Simple linear regression, multiple linear regression, measuring error, model fitting and least squares, comparing linear regression and classification |
ISL Intro of 3, 3.1, and 3.2 | [slides] |
Lecture 5 | Monday Jan 28 |
Linear Models II Nonlinear transformations of predictors, cost/loss functions, selecting parameters through gradient descent. |
ISL 3.3 and 3.5 | [slides] |
Lecture 6 | Wednesday Jan 30 |
Performance evaluation and model comparison Choosing the right mode: accuracy vs speed vs interpretability; metrics for supervised learning performance evaluation: types of errors, receiver operating characteristics curves, confusion matrices |
ISL 4.1, 4.2, and 4.3 | [slides] |
Lecture 7 | Monday Feb 4 |
Validation and model testing Resampling techniques: training, testing, and validation datasets, the importance of ensuring representative resampling, and cross validation |
ISL 5.1 and 5.2 | [slides] |
Deliverable | Wednesday Feb 6 |
Assignment #2 Due | [assignment] | |
Lecture 8 | Wednesday Feb 6 |
Decision theory How to operate supervised learning algorithms in practice |
Link to reading | [slides] |
Lecture 9 | Monday Feb 11 |
Reducing overfit Model and feature selection; Occam’s razor; Subset selection; L1 (ridge), L2 (LASSO), and elastic net regularization. |
ISL 6.1 and 6.2 | [slides] |
Lecture 10 | Wednesday Feb 13 |
Additional classification methods Linear discriminant analysis and naïve Bayes |
ISL 4.4 and 4.5 | [slides] |
Lecture 11 | Monday Feb 18 |
Tree-based models and ensembles From decision trees to random forests: bagging, bootstrapping, and boosting |
ISL 8.1 and 8.2 | [slides] |
Deliverable | Feb 20 Friday Feb 22 |
Assignment #3 Due | [assignment] | |
Lecture 12 | Wednesday Feb 20 |
Dimensionality reduction The Curse of Dimensionality and intro to principal components analysis (PCA) |
ISL 6.3, 6.4, 10.1, and 10.2 | [slides] |
Lecture 13 | Monday Feb 25 |
Principal components analysis (PCA) Explaining how PCA works and how we calculate the principal components. |
ISL 10.3 | [slides] |
Deliverable | Wednesday Feb 27 |
End of Kaggle Competition | [kaggle competition] | |
Lecture 14 | Wednesday Feb 27 |
Clustering I From K-means to Gaussian mixture model clustering and Expectation Maximization |
DM Ch 7 (link): Intro, 7.1 and 7.2 |
[slides]
|
Lecture 15 | Monday Mar 4 |
Clustering II Hierarchical clustering, DBSCAN, and spectral clustering |
DM Ch 7 (link): 7.3 and 7.4 | [slides] |
Deliverable | Wednesday Mar 6 |
Kaggle Competition Reports Due | [kaggle report] | |
Lecture 16 | Wednesday Mar 6 |
Neural networks I How a neural network works |
PRML Ch 5: 5.1 | [slides] |
Deliverable | Friday Mar 8 |
Kaggle Team Peer Evaluation | [peer evaluation] | |
No class | Mar 11-15 | Spring break week | ||
Lecture 17 | Monday Mar 18 |
Neural networks II Backpropagation |
PRML Ch 5: 5.3 (intro), 5.3.1, 5.3.2, and Calculus on Computational Graphs | [slides] |
Lecture 18 | Wednesday Mar 20 |
Introduction to Deep learning Implementing deep learning models in Keras |
DL Ch 11: Practical Methodology |
[slides] [keras demo notebook] |
Deliverable | Monday Mar 25 |
Assignment #4 Due | [assignment] [neural network math tutorial] |
|
Lecture 19 | Monday Mar 25 |
Reinforcement Learning I Formulating the reinforcement learning problem |
RL Ch 1: 1.1-1.6; Ch 2: 2.1-2.5 | [slides] |
Lecture 20 | Wednesday Mar 27 |
Reinforcement Learning II Policy and value functions, rewards, and introduction to Markov processes |
RL Ch 3 | [slides] |
Deliverable | Monday Apr 1 |
Final Project Proposal | [Final Project] | |
Lecture 21 | Monday Apr 1 |
Reinforcement Learning III From Markov Chains to Markov Decision Processes (MDPs) |
RL Ch 4 | [slides] |
Lecture 22 | Wednesday Apr 3 |
Reinforcement Learning IV Finding optimal policies through policy iteration, value iteration, and Monte Carlo methods |
RL Ch 5: 5.1-5.3 | [slides] |
Lecture 23 | Monday Apr 8 |
Kernel Smoothing Non-parametric methods including kernel density estimation, kernel regression, and local regression |
None | [slides] |
Deliverable | Apr 8 Wednesday Apr 10 |
Assignment #5 Due | [assignment] | |
Lecture 24 | Wednesday Apr 10 |
Kernel Methods Introducing Kernel machines via the kernel perceptron, maximum margin classifiers, and support vector machines |
ISL Ch 9: 9.1-9.4 | [slides] |
Lecture 25 | Monday Apr 15 |
State-of-the-art machine learning and applications Cutting-edge applications and techniques: ideas on where the field is heading and how to stay up-to-date |
None | [slides] |
Deliverable | Wednesday Apr 17 |
Final project video showcase and competition (last class meeting of the semester) The grand finale of the semester in which all of the videos you produced will be shown to the class |
[Final Project] | |
Deliverable | Thursday Apr 18 |
Final Report | [Final Project] | |
Deliverable | Friday Apr 19 |
Final Project Peer Evaluation | [peer evaluation] |