Skip to content

Reading Hsuan-Tien Lin's Machine Learning Foundations & Techniques: Overview and Self-Study Routes

Sep 30, 20261 min
TL;DRHsuan-Tien Lin's Machine Learning Foundations (16 lectures) and Machine Learning Techniques (16 lectures) are two Mandarin-taught MOOCs. All 130 YouTube videos and 32 slide decks are free. The MOOCs alone are A2: since August 2025, free Coursera accounts can only view the first module, so the exercises sit behind a paywall. Add the Fall 2024 course page, which publishes HW0–HW7 and the final project spec, and you reach A3, minus the grading chain: no official solutions, Gradescope and NTU COOL are enrolled-only, and the Kaggle competition returns 404. Fall 2026 is running now as a flipped classroom; slides through week 4, hw0, and hw1 are public.

🌏 中文版

For many Mandarin-speaking learners, Machine Learning Foundations (機器學習基石) and Machine Learning Techniques (機器學習技法) were their first course in machine learning theory. Hsuan-Tien Lin of NTU's Department of Computer Science and Information Engineering launched both on Coursera in 2015–2016, taught in Mandarin. The textbook is Learning from Data (LFD below), which he co-wrote with Yaser Abu-Mostafa and Malik Magdon-Ismail. Foundations asks why machines can learn at all and builds up to VC dimension and regularization. Techniques moves on to SVMs, boosting, decision trees, and neural networks.

Ten years later, Lin's own NTU course still uses the two MOOCs as its backbone. Machine Learning, Fall 2026 is a flipped classroom, and each week's "required watching (before class)" is a set of MOOC videos.

This post is the series entry point. It covers the course structure, what outside learners can get, and the order to read things in. Each lecture gets its own post later.

Sources: the MOOC page (footer: last updated 2024-08-30), the Foundations and Techniques YouTube playlists, the Fall 2026 course page and its policy.pdf, the Fall 2024 course page and its homework PDFs, the Coursera page for Foundations part 1, and NTU OpenCourseWare's note on Coursera's policy (in Mandarin). I opened and checked all of them on 2026-09-30.

Two MOOCs: seven questions, 32 lectures, 130 videos

Page 2 of 01_handout.pdf describes Foundations as "foundation oriented" and "story-like," strung along four questions. Techniques is split by three ways of handling features. The Fall 2026 course page numbers these seven segments topic 1 through topic 7:

SegmentQuestion (as on the slides)LecturesThis series
Foundations 1When Can Machines Learn?L1–L4Post 1, Post 2
Foundations 2Why Can Machines Learn?L5–L8Post 3, Post 4
Foundations 3How Can Machines Learn?L9–L12Post 5, Post 6
Foundations 4How Can Machines Learn Better?L13–L16Post 7, Post 8
Techniques 1embedding numerous features (kernel models)T1–T6Post 9, Post 10, Post 11
Techniques 2combining predictive features (aggregation models)T7–T11Post 12, Post 13
Techniques 3distilling hidden features (extraction models)T12–T15Post 14, Post 15
Wrap-upfinale ("happy learning!")T16Post 16

The MOOC page lists four section titles for each lecture, one video per section. Foundations L1 and Techniques T1 each add a "Course Introduction" video, so each playlist has 65 videos, 130 in total. The first Foundations video went up on 2015-12-09; the first Techniques video on 2016-02-14.

Slides come in two flavors: handout and presentation (step-by-step animation). Files are numbered 01–16 for Foundations and 201–216 for Techniques. Each course has a zip of all handouts (Foundations, Techniques). The MOOC page says the slides are shared under CC-BY-NC 3.0, but the figures stay with their original copyright holders, in most cases the LFD authors. There is also an errata page.

The lectures are in Mandarin and the slides are in English. English readers can follow the slides directly; the audio is the barrier.

Three version baselines

The same material now exists in three versions. Every post in this series says which one it cites:

LayerWhat it isStatusWhat this series uses it for
MOOCRecordings and slides for Foundations (16) and Techniques (16)Recorded 2015–2016; MOOC page last updated 2024-08-30Core material
Fall 2024NTU course, Mondays 13:20–16:20, page says "English teaching"; grading 70% homework, 30% project (tentative)FinishedHomework baseline: HW0–HW7 and final project PDFs are all public
Fall 2026NTU course, Wednesdays 9:10–12:10, "Mandarin teaching"; grading 30% homework, 30% exam, 40% project (tentative)In progress, week 4 todayCurrent reference: watch lists, extended slides, hw0 and hw1

Fall 2024 homework lives on hwN/ subpages of the course page, for example hw1_red.pdf on the hw1 subpage. Each set has 12 problems plus 1 bonus; the first 4 are auto-graded and the other 8 are graded by TAs. Most programming datasets come from LIBSVM datasets, such as rcv1_train.binary in HW1.

The final project spec, final.pdf, is set in a fictional baseball league called HTMLB. The task is to predict whether the home team wins, submitted to Kaggle in two stages, and the report must be written in English.

Rules from the Fall 2026 policy.pdf:

  • About 6 homework sets, one every two weeks, each due two weeks after release. Late work loses 10% per 12 hours; each student gets 4 penalty-free half-days ("gold medals").
  • Answers are multiple choice and auto-graded, but derivations must be uploaded for selective TA grading, and programming answers need source code. Answers without derivations or code get zero.
  • AI tools are allowed as aids, but you may not submit their output directly. If generative AI wrote your code, you must comment it block by block in your own words.
  • No midterm; there is a final exam (12/09 on the course page).

Access grading: MOOC alone is A2; add Fall 2024 homework for A3

Grades follow the definitions in the global AI/CS course map: A0 schedule visible, A1 syllabus visible, A2 materials partly open, A3 enough for self-study.

CombinationGradeWhy
MOOC onlyA2Recordings and slides are fully open, but exercises sit behind Coursera's paywall
MOOC + Fall 2024 course pageA3 (grading chain excluded)HW0–HW7 problems and the final project spec are public; most datasets can be downloaded
Fall 2026, current termA2 (in progress)Slides for W1–W4, hw0, hw1 and hw1_train.dat are public; slide links from W5 on currently return 404

What outside learners cannot get, repeated in every homework section later in the series:

  1. No official solutions. Gradescope auto-grading and TA grading are for enrolled students only.
  2. NTU COOL needs an NTU account. Fall 2024 is course 40495; Fall 2026 is course 63348.
  3. The Kaggle final-project pages return 404. The stage 1 link in final.pdf returned 404 on 2026-09-30, possibly because the competition is private or removed. This series has not confirmed whether the data is still downloadable or late submissions are accepted.
  4. Fall 2026 is still running. hw2–hw6, the final project, and slides from W5 on are not yet public.

YouTube vs. Coursera after August 2025

The MOOC page offers two entry points per course: Coursera and free YouTube. On Coursera, Foundations is split in two: part 1 (Mathematical Foundations) and part 2 (Algorithmic Foundations). Techniques is a third course. The part 1 page says "There are 8 modules in this course."

The difference is the exercises. According to NTU OpenCourseWare (in Mandarin), Coursera replaced "Audit" with "Preview" worldwide starting August 2025. Free accounts can only watch the first module; the full course, including all modules, assignments, and assessments, requires a subscription or purchase. That note sits on a different NTU OCW course page and describes a platform-wide policy. Lin's Coursera pages do not mention it themselves.

So the practical choices today:

  • Just watch: the YouTube playlists are enough. The videos match the Coursera versions and have no module limit.
  • Want exercises and a certificate: pay for Coursera. This series did not open anything behind the paywall and does not describe those problems.
  • Want free exercises: use the Fall 2024 homework PDFs. That is the baseline this series uses.

Fall 2026 flipped classroom: the first four weeks of required watching

Each week on the Fall 2026 course page lists "required watching (before class)": one MOOC slide deck, LFD sections, and 3–5 YouTube videos. The four weeks published so far:

WeekRequired watchingLFD sectionsAlso published
W1 (09/09)None; class is the course introduction—00_handout, hw0 released
W2 (09/16)L1 four videos, L2 four videos, first L3 video1.0, 1.1.1, 1.2.4; 1.1.2, 3.1; 1.2, 1.301e/02e/03e extended slides
W3 (09/23)Last three L3 videos, four L4 videos, first L5 video1.2, 1.3; 1.3; 2.0, 2.1.103e/04e, Wolpert paper, hw1 released
W4 (09/30)Last three L5 videos, four L7 videos, three L8 videos; the four L6 videos are "suggested watching (anytime)"2.0, 2.1.1; 2.2; 1.405e/07e

Rows from W5 on only link to slides (for example 09u_handout.pdf), which currently return 404, and have no video list yet. The course plan departs from the MOOC in a few places: T5–T6 and T14–T15 are not scheduled; W13 (12/02) has no class and points to the mlmai.ics slides instead; W14 is the final exam; W16 covers modern deep learning and the finale.

Class is streamed live to TAICA and the public via a synchronous screencast, and there is an auditing request form. This series has not checked whether the streams leave complete recordings.

Three self-study routes

Route A: videos only (A2). Watch the YouTube playlists in order with the handout slides. Every section ends with a "Fun Time" multiple-choice question, which works as a minimal self-check. Good for building intuition if you don't plan to do derivations.

Route B: videos + Fall 2024 homework (A3, this series' main line). Start with Fall 2024 HW0 as a prerequisite check, and patch any gaps in combinatorics, probability, linear algebra, or calculus first. Then read this series one post per lecture; each post ends with the Fall 2024 problems that exercise that topic. There are no official solutions, so set up your own checks for programming problems, for example comparing numbers against the scikit-learn model of the same name.

Route C: follow the Fall 2026 live stream. Watch the videos on each week's required list, then do the current homework. hw0 and hw1 are both due 2026-10-21. Auditors can work to the same schedule but will not be graded.

As for prerequisites, the course needs first-year calculus, linear algebra, and probability. If probability is shaky, read this site's Stanford CS109 guide or the statistics and ML series first.

Posts in this series

OrderPostLectures
1The Learning Problem, PLA, and Types of LearningFoundations L1–L3
2Is Learning Feasible? Hoeffding and "Outside the Data"Foundations L4
3Training vs. Testing: Effective Hypotheses, Growth Function, and Break PointFoundations L5–L6
4VC Dimension, Noise, and Error MeasuresFoundations L7–L8
5Linear Regression and Logistic RegressionFoundations L9–L10
6Linear Classification, SGD, Multiclass, and Nonlinear TransformsFoundations L11–L12
7Overfitting and RegularizationFoundations L13–L14
8Validation and Three Learning PrinciplesFoundations L15–L16
9Linear SVM and Dual SVMTechniques T1–T2
10Kernel Trick and Soft-Margin SVMTechniques T3–T4
11Kernel Logistic Regression and Support Vector RegressionTechniques T5–T6
12Blending, Bagging, and AdaBoostTechniques T7–T8
13Decision Trees, Random Forests, and Gradient Boosted TreesTechniques T9–T11
14Neural Networks and Deep LearningTechniques T12–T13
15RBF Networks, k-Means, and Matrix FactorizationTechniques T14–T15
16Finale: Three Techniques, Plus Modern Deep LearningTechniques T16 + Fall 2024 supplementary slides
17Foundations Homework Guide: Fall 2024 HW0–HW5Maps to L1–L16
18Techniques Homework and Final Project: HW6–HW7 and HTMLBMaps to T1–T12

What to do tonight

  1. Open Fall 2024 HW0 and give yourself one hour for the combinatorics and probability section. If you get stuck on two or more, brush up on probability before starting the videos.
  2. Download the Foundations handout zip and watch the Course Introduction video.
  3. Pick a route, then read Post 1.

Further reading

These courses overlap with this series, but every post here stands on its own; these are links only:

Next: The Learning Problem, PLA, and Types of Learning

References