Scribd
Upload
18 views

EE331_2024F_Introduction_to_Machine_Learning_syllabus

Uploaded by

pdamiano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

EE331_2024F_Introduction_to_Machine_Learning_syllabus

Uploaded by

pdamiano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Korea Advanced Institute of Science and Technology

School of Electrical Engineering

EE331 Introduction to Machine Learning


Fall 2024

Issued: Sep. 02 2024

Course Information

Name Tel. Email


Lecturer: Chang Dong Yoo T3470 cd [email protected]
TA : Ji Woo, Hong T5470 [email protected]
Hee Suk, Yoon T5470 [email protected]
Gwan Hyeong, Koo T5470 [email protected]
Secretary: Dua Jeong T8070 [email protected]

Text: Course handouts


Web: https://klms.kaist.ac.kr/course/view.php?id=162471

Day Time Room


Lecture: Tues, Thurs 10:30-12:00 E11 #102

Recommended Courses

Recommended pre-requisite courses are EE209 (Programming Structure for Electrical Engineering),
MAS250/EE210 (Probability and Statistics/Probability and Random Processes) and MAS212/MAS109
(Linear Algebra/ Introduction to Linear Algebra). Recommended courses can be taken concurrently.
Mathematical maturity expected.

Course Description

This course introduces principles, algorithms, and applications of machine learning (ML) from the
point of modeling, prediction, and learning representation. This course will cover concepts such
as generalization, over-fitting, representation, and regularization; topics such as the framework for
ML, decision tree, logistic regression, PAC learning, large-margin classifier, Bayesian learning, EM,
Hidden Markov Model, probability and learning, k-means clustering, principal component analysis,
and reinforcement learning.

Course Organization and Grading Policy

There will be two 75-minute lectures per week. To facilitate the coverage of a large quantity of ma-
terial, copies of the lecture slides will be handed out. There will be about five homework involving
MATLAB and Python programming. The assignments must be turned in by the due date. You
will be given a grace period of three days for the five assignments. You can use the grace period
however you please e.g. three days on one homework or one day each on three homework. You are

1
strictly forbidden to copy other person’s work, but collaboration is encouraged. Anyone suspected
of copying homework will receive no points for that particular homework. In addition to homework
assignments, there will also be a required term project that requires (1) constructing a new dataset
for regression or multi-class classification, (2) designing an ML algorithm, and (3) competing in a
bakeoff.

Midterm 20
Homework 20
Project 20
Participation 10
Final 30
Total 100

References

1. Tom Mitchell, Machine Learning, McGraw Hill, 1997.


2. David J.C. Mackay, Information Theory, Inference, and Learning Algorithms, Cambridge Uni-
versity Press, 2003.

3. Kevin P. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press 2012


4. Ethem Alpaydin, Introduction to Machine Learning, The MIT Press, 2010

5. Bernhard Scholkopf, Alexander J. Smola, Learning with Kernels, Support Vector Machines,
Regularization, Optimization, and Beyond, The MIT Press, Cambridge, Massachusetts, 2002.

6. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer 2006.


7. Trevor Hastie, Robert Tibshirani, The elements of Statistical Learning: Data Mining, Inference
and Prediction, Springer 2001.
8. Gareth James, Daniela Witten, An Introduction to Statistical Learning, Springer.

9. Shai Shalev-Shwartz, Shai Ben-David, Understanding Machine Learning: From Theory to


Algorithms, Cambridge University Press.
10. Mehryar Mohri, Afshin Rostamizadeh and Ameet Talwalkar, Foundations of Machine Learn-
ing, MIT Press, Second Edition, 2018

11. Willi Richert, Luis Pedro Coelho, Building Machine Learning Systems with Python, PACKT

2
Tentative Syllabus Schedule

Lect. Date Topic HW


L2 9/3, T Framework for ML: loss, over-fitting, complexity, generalization
– 9/5, Th No Class
L3 9/10, T Decision tree
L4 9/12, Th Perceptron HW1 out
– 9/17, T Thanksgiving
L5 9/19, Th Nearest Neighbor
L6 9/24, T Unsupervised learning: principal component analysis HW1 due
L7 9/26, Th Unsupervised learning: density estimation
L8 10/1, T Bias-Variance decomposition
– 10/3, Th National Foundation Day
L9 10/8, T Logistic Regress. + Max. Likelihood Est. (MLE) HW 2 out
L10 10/10, Th Unsupervised Learning: k-means clustering
L11 10/15, T Linear Regression and Regularization
L12 10/17, Th Linear Regression and Regularization HW 2 due, HW 3 out
– 10/22, T Midterm Week
– 10/24, Th Midterm Week Th9:00-11:45
L13 10/29, T Neural Network HW3 due, HW4 out
L14 10/31, Th Recurrent Network
L15 11/5, T Large-margin classifier
L16 11/7, Th Large-margin classifier
L17 11/12, T Probability and Learning theory HW4 due, HW 5 out
L18 11/14, Th Boosting
L19 11/19, T Distributions
L20 11/21, Th Learning theory
L21 11/26, T Bayesian Learning : Naive Bayes
L22 11/28, Th Expectation Maximization (EM)
L23 12/3, T Diffusion Model
L24 12/5, Th Diffusion Model
L25 12/10, T Markov Decision Process
L26 12/12, Th Reinforcement Learning
– 12/17, T Final Week

You might also like