Introduction to Machine Learning

10-315, Fall 2019

Carnegie Mellon University

Aarti Singh


Home People Lectures Recitations Homeworks Project

Lecture:

Day and Time: Monday and Wednesday, 10:30 - 11:50 am
Location: HOA 160

Recitation: Day and Time: Friday, 10:30-11:50 am
Location: HOA 160

Office Hours:
Day Time Location Staff
Mondays 2.30pm - 3.30pm GHC 8021 Siddharth Ancha
Tuesdays 7.30pm - 8.30pm GHC 8th floor commons Yue Wu
Wednesdays 9.30am - 10.30am Outside HOA 160 Aarti Singh(Sept 11
onwards, email before then)
Thursdays 11am - 12 noon GHC 8122 William Flores

Course Description:

Machine Learning is concerned with computer programs that automatically improve their performance through experience (e.g., programs that learn to recognize human faces, recommend music and movies, and drive autonomous robots). This course covers the core concepts, theory, algorithms and applications of machine learning. We cover supervised learning topics such as classification (Naive Bayes, Logistic regression, Support Vector Machines, neural networks, k-NN, decision trees, boosting) and regression (linear, nonlinear, kernel, nonparametric) as well as unsupervised learning (density estimation, MLE, MAP, clustering, PCA, dimensionality reduction).

A detailed course syllabus including course policies can be found here.

Prerequisites: (15-122) and (21-127 or 21-128 or 15-151) and (21-325 or 36-217 or 36-218 or 36-225 or 15-359)

Learning Outcomes: After completing the course, students will be able to:
  • Select and apply an appropriate supervised learning algorithm for classification problems (e.g., naive Bayes, support vector machine, logistic regression, neural networks).
  • Select and apply an appropriate supervised learning algorithm for regression problems (e.g. linear regression, ridge regression, nonparametric kernel regression).
  • Recognize different types of unsupervised learning problems, and select and apply appropriate algorithms (e.g., clustering, linear and nonlinear dimensionality reduction).
  • Work with probabilities (Bayes rule, conditioning, expectations, independence), linear algebra (vector and matrix operations, eigenvectors, SVD), and calculus (gradients, Jacobians) to derive machine learning methods such as linear regression, naive Bayes, and principal components analysis.
  • Understand machine learning principles such as model selection, overfitting, and underfitting, and techniques such as cross-validation and regularization.
  • Implement machine learning algorithms such as logistic regression via stochastic gradient descent, linear regression, or k-means clustering.
  • Run appropriate supervised and unsupervised learning algorithms on real and synthetic data sets and interpret the results.
Recommended Textbooks:
  • Pattern Recognition and Machine Learning, Christopher Bishop.
  • Machine Learning: A probabilistic perspective, Kevin Murphy.
  • Machine Learning, Tom Mitchell.
  • The Elements of Statistical Learning: Data Mining, Inference and Prediction, Trevor Hastie, Robert Tibshirani, Jerome Friedman.
Grading:
  • 4 Homeworks (40%)
  • 4 QnAs (15%)
  • Midterm and final exam (10+15=25%)
  • Project (20%)
Late Days:
  • There are a total of 4 late days across all homeworks.
  • HWs submitted after all late days are exhausted will be awarded 0 points.
  • There are no late days for the project.
Communication: All class discussions, announcements and other communication will take place via Piazza.

Policies:
Collaboration
  • You may discuss the questions.
  • Each student writes their own answers.
  • Each student must write their own code for the programming part.
  • Please don't search for answers on the web, Google, previous years' homeworks, etc.
    • Please ask us if you are not sure if you can use a particular reference.
    • List resources used (references, discussants) on top of submitted homework.
Waitlist We'll let everyone in as long as there is space in room. Wait to see how many students drop/keep attending lectures and doing HW.

Audits and Pass/Fail Audits NOT allowed. Pass/Fail allowed.

Academic Integrity Any violations of academic integrity will always be reported to the university authorities (your Department Head, Associate Dean, Dean of Student Affairs, etc.) as an official Academic Integrity Violation, in compliance with CMU's Policy on Academic Integrity (https://www.cmu.edu/policies/student-and-student-life/academic-integrity.html), and will carry severe penalties.

Support: Take care of yourself. Do your best to maintain a healthy lifestyle this semester by eating well, exercising, avoiding drugs and alcohol, getting enough sleep and taking some time to relax. This will help you achieve your goals and cope with stress.

All of us benefit from support during times of struggle. You are not alone. There are many helpful resources available on campus and an important part of the college experience is learning how to ask for help. Asking for support sooner rather than later is often helpful. If you or anyone you know experiences any academic stress, difficult life events, or feelings like anxiety or depression, we strongly encourage you to seek support. Counseling and Psychological Services (CaPS) is here to help: call 412-268-2922 and visit their website at http://www.cmu.edu/counseling/ . Consider reaching out to a friend, faculty or family member you trust for help getting connected to the support that can help.

If you or someone you know is feeling suicidal or in danger of self-harm, call someone immediately, day or night:
CaPS: 412-268-2922
Re:solve Crisis Network: 888-796-8226
If the situation is life threatening, call the police:
On campus: CMU Police: 412-268-2323
Off campus: 911.

If you have questions about this or your coursework, please let the instructors know.