Skip to content
Series
10 posts

Reading CMU 10-301 Introduction to Machine Learning

Reading the 27 lectures of CMU 10-301/601 through its nine public Spring 2026 homework bundles and the practical limits for independent learners.

Learn Machine Learning Through Nine Assignments | CMU 10-301 Course Overview

Spring 2026 publishes material for 27 lectures and nine homework bundles; outsiders can do the core work but cannot access Panopto, Piazza, Gradescope, or official homework solutions.

Find ML Foundation Gaps with Mathematics and Python | CMU 10-301 Assignment 1

HW1 is written and programming work: mathematical and CS foundations followed by a majority-vote classifier.

From Information Calculations to a Complete Decision Tree | CMU 10-301 Assignment 2

HW2 moves from hand-calculated entropy and mutual information to an end-to-end tree learner, predictor, and evaluator.

Compare K-NN, Perceptron, and Linear Regression | CMU 10-301 Assignment 3

HW3 is written work: a decision-tree review followed by K-NN, Perceptron, and Linear Regression through inductive bias, errors, and model selection.

Turn Logistic Regression Likelihood into a Classifier | CMU 10-301 Assignment 4

HW4 joins probabilistic interpretation, cross-entropy gradients, and implementation into one traceable training pipeline.

Expose Neural Networks and Backpropagation with NumPy | CMU 10-301 Assignment 5

HW5 avoids automatic differentiation so learners must track forward shapes, caches, and backward gradients themselves.

Learning Theory, MLE/MAP, and Fairness Metrics | CMU 10-301 Assignment 6

HW6 combines generalization, MLE/MAP, probabilistic learning, fairness metrics, and social impact in one written assignment about assumptions and tradeoffs.

Move from Basic Neural Networks to Deep Learning | CMU 10-301 Assignment 7

HW7 builds on HW5 backpropagation to address deep-model architecture and training failures, emphasizing diagnosis over merely adding layers.

From MDPs to Reinforcement-Learning Updates | CMU 10-301 Assignment 8

HW8 connects states, actions, rewards, transitions, and value updates while separating environment dynamics, policy, and estimation error.

Close the Course with Ensembles, k-Means, PCA, and Recommenders | CMU 10-301 Assignment 9

The final written assignment combines ensembles, clustering, representation, and recommendation to test whether you can choose a learning paradigm from problem structure.