Lesson 01
k-Nearest Neighbors (Euclidean/Manhattan/cosine), curse of dim; Decision tree (entropy/Gini, info gain, CART), pruning.
Lesson 02
Bagging, OOB error, feature importance; bias-variance interpretation; ExtraTrees.
Lesson 03
Margin maximization, support vectors; kernel trick (RBF, polynomial); soft margin C; one-vs-rest cho multi-class.
Lesson 04
AdaBoost intuition → Gradient Boosting framework; XGBoost, LightGBM, CatBoost briefly.