10-701: Introduction to Machine Learning

Fall 2026

Key Information and Links

Instructor: Geoff Gordon
Education Associate: Jacob Rast
Announcements/Q&A: We will be using Piazza for making announcements and answering questions.
Lectures: Mondays and Wednesdays from 2:00 PM to 3:20 PM (ET) in WEH 7500. Lectures will be recorded for students to review after the fact; the recordings will be hosted on Canvas.
Recitations: Fridays from 2:00 PM to 3:20 PM (ET) in WEH 7500. Attendance at recitations is optional and therefore, outside of extraordinary circumstances, these will not be recorded. Recitation handouts can be found under the Recitations tab.
Assignments: Homework handouts will be posted to the course website under the Assignments tab. All code and written responses should be submitted via Gradescope.
Quizzes: Fridays from 2:00 PM to 3:20 PM (ET) in WEH 7500. Quizzes occur after a homework due date.
Grades: Feedback on homeworks and exams will be received via Gradescope.
Office Hours: The time and location of office hours can be found on the course calendar.

Syllabus

1. Course Description

Machine learning studies the question: “How can we build adaptive algorithms that automatically improve their performance on a given task as they acquire more experience?” This can cover a wide array of technologies depending on what sort of task we have in mind, and what we take to constitute experience. Through this framing, we might view classical statistics problems, like estimating the likelihood that a coin lands on heads, as an ML problem: the task is to produce an estimate, and the experience would consist of observations. But ML can also include robotics challenges, where the experience is acquired dynamically as our artificial agent interacts with the real world. Other grand challenges in machine learning relate to personalized medicine, materials discovery, and most recently generating media artifacts like images and text.

This course is designed to give PhD students a solid foundation in the methods, mathematics, and algorithms of modern machine learning. Students entering the class with a pre-existing working knowledge of probability, statistics and algorithms will be at an advantage, but the class has been designed so that anyone with a strong mathematical and computer science background can catch up and fully participate. If you are interested in this topic, but are not a PhD student, or are a PhD student not specializing in machine learning, you might consider the master's level course on machine learning, 10-601. This class may be appropriate for MS and undergraduate students who are interested in the theory and algorithms behind machine learning.

Learning Outcomes

By the end of the course, students should be able to:

2. Prerequisites

Students entering the class are expected to have pre-existing working knowledge in the following areas:

  1. Significant experience programming in a general programming language. Specifically, you need to have written from scratch programs consisting of several hundred lines of code. For undergraduate students, this will be satisfied for example by having passed 15-122 (Principles of Imperative Computation) with a grade of ‘C’ or higher, or comparable courses or experience elsewhere.

    Note: For the programming components of our homework assignments, you will be required to use Python. You will be expected to know, or be able to quickly pick up, that programming language.

  2. Basic familiarity with probability and statistics, as can be achieved at CMU by having passed 36-217 (Probability Theory and Random Processes), or 36-225 (Introduction to Probability and Statistics I), or 15-259, or 21-325, or comparable courses elsewhere, with a grade of ‘C’ or higher.
  3. College-level maturity in discrete mathematics, as can be achieved at CMU by having passed 21-127 (Concepts of Mathematics), 21-128 (Mathematical Concepts and Proofs), 15-151 (Mathematical Foundations for Computer Science) or comparable courses elsewhere, with a grade of ‘C’ or higher.
  4. College-level maturity in calculus and linear algebra, as can be achieved at CMU by having passed 21-122 (Integration and Approximation), 21-241 (Matrix Algebra), 21-242 (Matrix Theory) or comparable courses elsewhere, with a grade of ‘C’ or higher.

You must strictly adhere to these pre-requisites! Even if CMU’s registration system does not prevent you from registering for this course, it is still your responsibility to make sure you have all of these prerequisites before you register.

3. Recommended Textbooks

This course does not exactly follow any one textbook. However, most lectures will have some optional reading to help you better understand the material or see a different presentation/perspective. We recommend you read these after the corresponding lecture. These readings will typically be drawn from the following texts, many of which are freely available online:

The textbook below is a great resource for those hoping to brush up on the prerequisite mathematics background for this course:

However, if you find yourself regularly and frequently referring to this textbook, we strongly encourage you to consider whether or not you have the necessary prerequisite knowledge to succeed in this course.

4. Assessments

Your grade in this course will be determeind by a midterm and a final exam, homework assignments and biweekly quizzes. The breakdown is as follows:

We will convert numerical course grades to letter grades based on grade boundaries that are determined at the end of the semester. The following is a list of upper bounds on the grade cutoffs we will use; in all likelihood, these will be adjusted down at the end of the semester:

Attendance

We ask that you attend all lectures. Attendance will be checked indirectly through biweekly quizzes which include some coverage of lecture material. However, if this proves to be insufficient we may implement other attendance checks such as a written sign-in sheet, NFC card scanners, attendance tickets, facial recognition software, etc.

If needed, up to 5% of your final grade may be determined by attendance. In this case, the final grade breakdown will be as follows:

Midterm and Final Exams

Unless otherwise noted, all exams for this course will be closed notes; you may bring one sheet of A4 paper as a cheatsheet (both back and front may be used). You are encouraged to handwrite this cheatsheet as a form of preparing for the exam but you may typeset them if you so choose.

The first exam will take place roughly at the midpoint of the semester; see the schedule page for more details. The second exam will take place during the finals period and will be scheduled by the registrar. Please plan your travel accordingly as we will not be able to accommodate individual travel needs (e.g., by offering the exam early). If you have an unavoidable conflict with either exam (e.g., an exam in another course), notify us by making a private post on Piazza.

Homework Assignments

The homework assignments will be divided into two components: programming and written. The programming portions will ask you to implement machine learning algorithms from scratch; they emphasize understanding of real-world applications of machine learning, building end-to-end systems, and experimental design. The written portions will focus on core concepts, “on-paper” implementations of classic learning algorithms, derivations, and understanding of theory. All programming must be completed in Python.

Quizzes

Quizzes will be composed of two sections.

The first section is designed to provide incentive against unauthorized use of generative AI in written and programming homework assignments. The questions will determine if you understand the concepts presented in homework assignments. They are intended to be easy if you have properly worked through the material and difficult or impossible to answer if you have not.

The second section of the quiz will cover recent lecture material. This is intended to provide incentive for attending lectures.

5. Office Hours

The schedule of office hours will always appear on the course calendar. In general, we will endeavor to hold a minimum of 6 office hours per week, with more in the week leading up to an exam.

We will make use of the following (informal) rules:

While you're awaiting your turn, we encourage you to listen in to the answers to any publicly answered questions. Please be courteous and allow the student who posed the question to primarily direct the discussion. We also encourage you to collaborate with others (following our collaboration policies below) while waiting.

6. General Policies

Late homework policy

You have a total of 6 grace days for use on any homework assignment. We will automatically keep a tally of these grace days for you; they will be applied greedily. You may not use more than 2 grace days on any single assignment. Submitting a homework late when you are out of grace days will result in the following penalties:

Grace days may only be applied to homework assignments. You may not combine grace days and late penalties to submit more than 48 hours late; any homework submitted more than 48 hours late will receive a score of 0.

Extensions

In general, we do not grant extensions on assignments. There are several exceptions:

For any of the above situations, you may request an extension by emailing Jacob at jrast@andrew.cmu.edu – do not email the instructor or TAs. Please be specific about which assessment(s) you are requesting an extension for and the number of hours requested. The email should be sent as soon as you are aware of the conflict and at least 24 hours prior to the deadline. In the case of an emergency, no notice is needed.

If this is a medical emergency or mental health crisis, you must also CC your CMU college liaison and/or your academic advisor. Do not submit any medical documentation to the course staff. If necessary, your college liaison and the Division of Student Affairs (DoSA) will request such documentation and they will view the health documentation and conclude whether a retroactive extension is appropriate. If you haven’t interacted with your college liaison before, they are experienced student affairs staff who work in partnership with students, housefellows, advisors, faculty, and associate deans in each college to assure support for students regarding their overall Carnegie Mellon experience.

Audit Policy

Formal auditing of this course is permitted. You must follow the official procedures for a course audit as outlined by the HUB/registrar. Please do not email the instructor requesting permission to audit. Instead, you should first register for the appropriate section. Next, fill out the Course Audit Approval form, obtain your academic advisor's signature and then approach the instructor in-person immediately after lecture to obtain their signature.

Auditors are required to:

Pass/Fail Policy

You are allowed to take this course as Pass/Fail; instructor permission is not required. What letter grade is the cutoff for a Pass will depend on your specific program; we do not specify whether or not you Pass but rather we compute your letter grade the same as everyone else in the class and your program converts that letter grade to a Pass or Fail depending on their cutoff. Be sure to check with your program/department as to whether you can count a Pass/Fail course towards your degree requirements.

Accommodations for Students with Disabilities

If you have a disability and have an accommodations letter from the Disability Resources office, please email Jacob at jrast@andrew.cmu.edu to set up a meeting for the purposes of discussing your accommodations and needs as early in the semester as possible. He will work with you to ensure that accommodations are provided as appropriate. If you suspect that you may have a disability and would benefit from accommodations but are not yet registered with the Office of Disability Resources, I encourage you to contact them at access@andrew.cmu.edu.

7. Technologies

We will use a variety of technologies throughout the course:

8. Collaboration and Academic Integrity

Read this section carefully!

Collaboration among Students

The purpose of student collaboration is to facilitate learning, not to circumvent it. Studying the material in groups is strongly encouraged. You are also allowed to seek help from other students in understanding the material needed to solve a particular homework problem, provided any written notes (including code) are taken on an impermanent surface (e.g., whiteboard, chalkboard), and provided learning is facilitated, not circumvented. The actual solution must be written by each student alone.

A good method to follow when collaborating is to meet with your peers, discuss ideas at a high level, but do not copy down any notes from each other or from a shared work surface. Any scratch work done at this time should be your own only. Before writing the assignment solutions, you should make sure that you are doing this without anyone else present, putting all notes away, closing all tabs on your computer, and writing it completely by yourself with no other resources.

You are absolutely not allowed to share/compare answers or screen share your work with one another.

The presence or absence of any form of help or collaboration, whether given or received, must be explicitly stated and disclosed in full by all involved. Specifically, each assignment solution must include answers to the following questions:

  1. Did you receive any help whatsoever from anyone in solving this assignment? Yes / No.
    • If you answered ‘yes’, give full details: ____________
    • (e.g., "Jane Doe explained to me what is asked in Question 3.4")
  2. Did you give any help whatsoever to anyone in solving this assignment? Yes / No.
    • If you answered ‘yes’, give full details: _____________
    • (e.g., "I pointed Joe Smith to section 2.3 since he didn’t know how to proceed with Question 2")
  3. Did you find or come across code that implements any part of this assignment? Yes / No. (See below policy on "found code")
    • If you answered ‘yes’, give full details: _____________
    • (book & page, URL & location within the page, etc.).

If you gave help after turning in your own assignment and/or after answering the questions above, you must update your answers before the assignment’s deadline, if necessary by emailing the course staff.

Collaboration without full disclosure will be handled severely, in compliance with CMU’s Policy on Academic Integrity.

Previously Used Assignments

Some of the homework assignments used in this class may have been used in prior offerings, in classes at other institutions, or elsewhere. Solutions to them may be, or may have been, available online, or from other people or sources. It is explicitly forbidden to use any such sources, or to consult people who have solved these problems before. It is explicitly forbidden to search for these problems or their solutions on the internet. You must complete the homework assignments completely on your own. We will be actively monitoring your compliance. Collaboration with other students who are currently taking the class is allowed, but only under the conditions stated above.

AI Assistance

To best support your own learning, you should complete all graded assignments in this course yourself. You may not use AI tools to generate any content (text, video, audio, images, code, etc.) for an assessment. There should never be a situation where any assignment is open at the same time as any chatbot. Do not copy / paste or manually enter any part of your homework assignments in a discussion with a chatbot.

That said, students are allowed to consult with AI chatbots provided that they do not do so while actively working on a course deliverable. In this regard, you should treat an AI the same way as any other collaborator or internet reference and divulge usage in the collaboration section of your homework.

Failure to disclose AI usage will be handled severely, in compliance with CMU’s Policy on Academic Integrity.

Policy Regarding "Found Code"

You are encouraged to read books and other instructional materials, both online and offline, to help you understand the concepts and algorithms taught in class. These materials may contain example code or pseudocode, which may help you better understand an algorithm or an implementation detail. However, when you implement your own solution to an assignment, you must put all materials aside, and write your code completely on your own, starting "from scratch". Specifically, you may not use any code you found or came across. If you find or come across code that implements any part of your assignment, you must disclose this fact in your collaboration statement.

Duty to Protect One’s Work

Students are responsible for proactively protecting their work from copying and misuse by other students. If a student’s work is copied by another student, the original author is also considered to be in violation of the course policies. It does not matter whether the author allowed the work to be copied or was merely negligent in preventing it from being copied. When overlapping work is submitted by different students, both students will be punished.

To protect future students, do not post your solutions publicly. Do not post solutions during the course nor afterwards.

Penalties for Violations of Course Policies

All violations of course policies (even the first one) will always be reported to the university authorities (your department head, associate dean, the dean of Student Affairs, etc.) as an official Academic Integrity Violation and will carry severe penalties.

  1. The penalty for the first violation is a negative 100% on the assignment, i.e. it would have been better to submit nothing and receive a 0%.
  2. The penalty for the second violation is failure in the course, and can even lead to dismissal from the university.

9. Support

Take care of yourself. Do your best to maintain a healthy lifestyle 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/.

If you or someone you know is feeling suicidal or in danger of self-harm, call someone immediately, day or night:

10. Diversity

We must treat every individual with respect. We are diverse in many ways, and this diversity is fundamental to building and maintaining an equitable and inclusive campus community. Diversity can refer to multiple ways that we identify ourselves, including but not limited to race, color, national origin, language, sex, disability, age, sexual orientation, gender identity, religion, creed, ancestry, belief, veteran status, or genetic information. Each of these diverse identities, along with many others not mentioned here, shape the perspectives our students, faculty, and staff bring to our campus. We, at CMU, will work to promote diversity, equity and inclusion not only because diversity fuels excellence and innovation, but because we want to pursue justice. We acknowledge our imperfections while we also fully commit to the work, inside and outside of our classrooms, of building and sustaining a campus community that increasingly embraces these core values.

Each of us is responsible for creating a safer, more inclusive environment.

Unfortunately, incidents of bias or discrimination do occur, whether intentional or unintentional. They contribute to creating an unwelcoming environment for individuals and groups at the university. Therefore, the university encourages anyone who experiences or observes unfair or hostile treatment on the basis of identity to speak out for justice and support, within the moment of the incident or after the incident has passed. Anyone can share these experiences using the following resources:

All reports will be documented and deliberated to determine if there should be any following actions. Regardless of incident type, the university will use all shared experiences to transform our campus climate to be more equitable and just.


Staff

Instructor

Geoff Gordon

Education Associate

Jacob Rast
Jacob

Teaching Assistants

Michael Zhou
Michael Zhou
Unmesh Chakravarty
Unmesh Chakravarty
Jojo Li
Jojo Li

Schedule

Lectures are the primary mode of content delivery in this course. Attending lectures is required. Attending lecture and participating in real-time lecture activities can greatly improve your understanding of the material. Lectures will be recorded and made available to you after the fact. However, the purpose of these recordings is to allow you to refer back to the content; watching recordings in lieu of attending lectures is not allowed.

Date Topic Slides Readings/Resources
Mon, Aug. 24 Introduction and ML as function approximation Lecture 1 (inked) Zhang, Lipton, Li & Smola, Chapter 1
Wed, Aug. 26 Generalization / Overfitting Lecture 2 (inked) Zhang, Lipton, Li & Smola, Sections 3.6, 4.6 & 5.5
Bishop, Sections 1.1 & 1.6
Mitchell, Section 6.6
Hastie, Tibshirani & Friedman, Section 7.10
XKCD 882: Significant
Mon, Aug. 31 Decision trees, KNN, model selection Lecture 3 (inked) Mitchell, Chapter 3 and Sections 8.1–8.2
Daumé III, Chapters 1 and 3
Hastie, Tibshirani & Friedman, Chapter 9
Wed, Sep. 2 MLE and MAP Lecture 4 (inked) Mitchell, Estimating Probabilities
Mon, Sep. 7 No Class (Labor Day)
Wed, Sep. 9 Linear regression Lecture 5 (inked) Murphy, Sections 7.1 - 7.3
Fri, Sep. 11 Quiz 1
Mon, Sep. 14 Optimization for ML Lecture 6 (inked) Bottou, Stochastic Gradient Descent Tricks
Goodfellow, Bengio, Courville, Deep Learning, Chapter 8
Wed, Sep. 16 Linear separators Lecture 7 (inked) Linear classifier demo
Mon, Sep. 21 Logistic regression and Naive Bayes Lecture 8 (inked) Murphy, Sections 8.1 - 8.3
Wed, Sep. 23 MLPs; deep MLPs Lecture 9 (inked) Zhang, Lipton, Li & Smola, Chapter 5.1 - 5.3
Fri, Sep. 25 Quiz 2
Mon, Sep. 28 Backprop and Autodiff Lecture 10 (inked) Mitchell, Chapter 4.1 - 4.6
Wed, Sep. 30 Societal impacts of ML Lecture 11 (inked)
Mon, Oct. 5 CNNs Lecture 12 (inked) Zhang, Lipton, Li & Smola, Chapter 7
Wed, Oct. 7 Midterm Exam (Lectures 1–11)
Mon, Oct. 12 No Class (Fall Break)
Wed, Oct. 14 No Class (Fall Break)
Mon, Oct. 19 Sequence models, RNNs Lecture 13 Zhang, Lipton, Li & Smola, Chapters 9 & 10.1
Wed, Oct. 21 Tokens and embeddings Lecture 14
Fri, Oct. 23 Quiz 3
Mon, Oct. 26 Attention and transformers Lecture 15 Zhang, Lipton, Li & Smola, Chapter 11
Wed, Oct. 28 Learning theory Lecture 16
Mon, Nov. 2 Learning theory Lecture 17
Wed, Nov. 4 RL fundamentals Lecture 18 Mitchell, Chapter 13
Fri, Nov. 6 Quiz 4
Mon, Nov. 9 Policy gradients, actor-critic methods Lecture 19 Sutton and Barto
Wed, Nov. 11 Pre-training, fine-tuning, in-context learning Lecture 20
Mon, Nov. 16 Autoencoders, clustering, dimensionality reduction Lecture 21 Daumé III, Chapter 15
Murphy, Sections 11.1 - 11.4.2
Murphy, Sections 12.2.1 - 12.2.3
Wed, Nov. 18 Cross-validation, bagging Lecture 22
Fri, Nov. 20 Quiz 5
Mon, Nov. 23 Boosting Lecture 23 Freund and Schapire, A Short Introduction to Boosting
Wed, Nov. 25 No Class (Thanksgiving Break)
Mon, Nov. 30 Confidence intervals and testing Lecture 24
Wed, Dec. 2 SVMs and duality Lecture 25 Murphy, Sections 14.1 - 14.5
TBD Final Exam (Lectures 12–25)

Recitations

Attendance at recitations is not required, but strongly encouraged. Recitations will be interactive and focus on problem solving; we strongly encourage you to actively participate. A problem sheet will usually be released prior to the recitation. If you are unable to attend one or you missed an important detail, feel free to stop by office hours to ask the TAs about the content that was covered. Of course, we also encourage you to exchange notes with your peers.

Date Topic Handout Solutions
Fri, Sep. 4 Recitation 1: Probability Review, Decision Trees & kNNs Recitation 1 (slides) Solutions
Fri, Sep. 18 Recitation 2: Logistic Regression, Linear Regression & MLE/MAP Recitation 2 Solutions
Fri, Oct. 2 Recitation 3: Neural Networks and PyTorch
Midterm Review
Midterm Practice Problems Solutions
Fri, Oct. 16 No Recitation (Fall Break)
Fri, Oct. 30 Recitation 4: Working with Text Data
Fri, Nov. 13 Recitation 5: Reinforcement Learning
Learning Theory
Fri, Nov. 27 No Recitation (Thanksgiving Break)
Fri, Dec. 4 Recitation 6: Final Exam Review

Assignments

Our homework assignments are an opportunity for you all to reason about and build/experiment with some of the models that we introduce in class. All programming questions must be completed in Python and you must use LaTeX to typeset your responses to the written questions. You will submit both your code and your written responses using Gradescope; note that each assignment will have separate submissions for the code and the written portion.

Release Date Topic Files Due Date
Fri, Aug. 28 HW1: Decision Trees and kNN HW1 Handout Tue, Sep. 8
Fri, Sep. 11 HW2: Linear Regression, Logistic Regression, MLE/MAP HW2 Handout Tue, Sep. 22
Fri, Sep. 25 HW3: Regularization and Neural Networks HW3 Handout Tue, Oct. 20
Fri, Oct. 23 HW4: CNNs, RNNs, and Transformers Tue, Nov. 3
Mon, Nov. 9 HW5: Reinforcement Learning and Learning Theory Tue, Nov. 17
Fri, Nov. 20 HW6: Unsupervised Learning and Ensemble Methods Wed, Dec. 2

Course Calendar