Syllabus
Syllabus
3003
COURSE OBJECTIVES:
Review of Linear Algebra for machine learning; Introduction and motivation for machine learning;
Approximately Correct (PAC) learning, Hypothesis spaces, Inductive bias, Generalization, Bias
variance trade-off.
Linear Regression Models: Least squares, single & multiple variables, Bayesian linear regression,
Bayes, Maximum margin classifier – Support vector machine, Decision Tree, Random Forests
Combining multiple learners: Model combination schemes, Voting, Ensemble Learning - bagging,
boosting, stacking, Unsupervised learning: K-means, Instance Based Learning: KNN, Gaussian
stochastic gradient descent, error backpropagation, from shallow networks to deep networks –Unit
saturation (aka the vanishing gradient problem) – ReLU, hyperparameter tuning, batch
Guidelines for machine learning experiments, Cross Validation (CV) and resampling – K-fold CV,
comparing two classification algorithms – t test, McNemar’s test, K-fold CV paired t test
COURSE OUTCOMES:
1. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Fourth Edition, 2020.
2. Stephen Marsland, “Machine Learning: An Algorithmic Perspective, “Second Edition”, CRC
Press, 2014.
REFERENCES: