| 課程大綱 | 分配時數 | 核心能力 | 備註 |
| 單元主題 | 內容綱要 | 講授 | 示範 | 隨堂作業 | 其他 |
| course introduction | topic 1: when can machines
learn?
the learning problem | | | | | | homework 0 announced |
| learning to answer yes/no | types of learning | | | | | | homework 1 announced |
| feasibility of learning | topic 2: why can machines
learn?
training versus testing | | | | | | |
| the VC dimension | noise and error | | | | | | homework 2 announced |
| topic 3: how can machines
learn? | linear regression;
logistic regression | | | | | | |
| linear models for classification | nonlinear transformation | | | | | | homework 0 due; homework 1
due; homework 2 due;
homework 3 announced |
| topic 4: how can machines learn
better? | hazard of overfitting;
regularization | | | | | | |
| validation | three learning principles | | | | | | homework 3 due; homework 4
announced; final project
announced |
| topic 5: how can machines learn
by embedding numerous
features? | linear support vector machine;
dual support vector machine | | | | | | |
| kernel support vector machine | soft-margin support vector
machine | | | | | | homework 4 due; homework 5
announced |
| topic 6: how can machines learn
by combining predictive
features? | blending and bagging;
adaptive boosting | | | | | | |
| decision tree | random forest;
gradient boosted decision tree | | | | | | homework 5 due; homework 6
announced |
| no class as instructor needs to
attend ACML 2026 and NeurIPS
2026; | recording: machine learning for
modern artificial intelligence | | | | | | |
| Final exam | | | | | | | |
| topic 7: how can machines learn
by distilling hidden features? | neural network;
(preliminary) deep learning | | | | | | homework 6 due |
| modern deep learning/finale | | | | | | | |