CSE 8673 Machine Learning

This post is intended for preview purposes regarding course selection. Please note that the finalized syllabus may undergo changes.

Tentative Course Schedule

This schedule is subject to change depending on the progress of the course

IndexLectureRefDue
1Course Intro
2Supervised Learning: Intro, linear regressionIntro: 1.2, 10, 11; Applied: Supervised Learning; Hands-on: 3, 4, 5
3Supervised Learning: linear regression, logistic regressionIntro: 10, 11; Applied: Supervised Learning; Hands-on: 3, 4, 5
4Supervised Learning: linear regression, logistic regressionIntro: 10, 11; Applied: Supervised Learning; Hands-on: 3, 4, 5Term Paper - Phase 0, Topic selection
5Supervised Learning: linear regression, logistic regressionIntro: 17; Adv: 18; Hands-on: 3, 4, 5
6Supervised Learning: logistic regressionQuiz 1: Supervised Learning; Intro: 17; Adv: 18; Hands-on: 3, 4, 5
7Supervised Learning: logistic regressionQuiz 1 Explanation; Intro: 21; Applied: unsupervised Learning; Hands-on: 9Term Paper - Phase 1, report
8Supervised Learning: LDARelease of HW 1; Intro: 21; Applied: unsupervised Learning; Hands-on: 9
9Supervised Learning: LDAIntro: 21; Applied: unsupervised Learning; Hands-on: 9Term Paper - Phase 1, report revision
10Supervised Learning: SVMQuiz 2: Logistic regression, LDA; Intro: 2.3, 3.3, 4.6, 5.1, 5.2, 11.7, 17.2; Adv: 3, 6, 15, 18
11Supervised Learning: SVMQuiz 2 Explanation; Intro: 2.3, 3.3, 4.6, 5.1, 5.2, 11.7, 17.2; Adv: 3, 6, 15, 18Term Paper (Oct 3) - Phase 2, report
12Midterm, Term Paper Presentation 1/3Group 1-4; Term Paper - Phase 2, in-class presentation (no submission)
13Midterm, Term Paper Presentation 2/3Group 5-10
14Midterm, Term Paper Presentation 3/3Group 11-16; Intro: 2.3, 3.3, 4.6, 5.1, 5.2, 11.7, 17.2; Adv: 3, 6, 15, 18
15Supervised Learning: SVMIntro: 2.3, 3.3, 4.6, 5.1, 5.2, 11.7, 17.2; Adv: 3, 6, 15, 18HW 1
16Supervised Learning: SVMIntro: 9; Adv: 6; Hands-on: 10, 11Term Paper - Phase 2, report revision, and presentation slides
17Supervised Learning: SVMIntro: 9; Adv: 6; Hands-on: 10, 11
18Unsupervised Learning: ClusteringQuiz 3; Intro: 9; Adv: 6; Hands-on: 10, 11
19Unsupervised Learning: ClusteringIntro: 9; Adv: 6; AP: 29
20Unsupervised Learning: ClusteringQuiz 3 Explanation; Intro: 9; Adv: 6; AP: 29Release of HW 2 (Nov 3)
21Optimization: Linear ProgrammingIntro: 9; Adv: 6; AP: 29Term Paper - Phase 3, report
22Optimization: Linear ProgrammingIntro: 9; Adv: 6; AP: 29
23Optimization: Integer ProgrammingQuiz 4; Intro: 9; Adv: 6; IP, 7, 8
24Optimization: Network SimplexQuiz 4 Explanation; Intro: 9; Adv: 6; IP, 7, 8HW 2 (Nov 17)
25Final, Term Paper Presentation 1/3Group 1-4, (~12 min / group); Intro: 9; Adv: 6; IP, 7, 8Term Paper - Phase 4, report; Phase 4, in-class presentation (no submission)
26Final, Term Paper Presentation 2/3Group 5-10, (~12 min / group)
27Final, Term Paper Presentation 3/3Group 11-15, (~12 min / group); Async Presentation: Group 11, Group 14, Group 15
28No Class, Reserved for Final Report
29No Class, Reserved for Final ReportFinal Project Report, including revision of Phase 4

Reference Books

  • [Intro] Murphy, Kevin P. Probabilistic machine learning: an introduction. MIT press, 2022.
  • [Adv] Murphy, Kevin P. Probabilistic machine learning: Advanced topics. MIT press, 2022.
  • [Applied] Rafatirad, Setareh, Houman Homayoun, Zhiqian Chen, and Sai Manoj Pudukotai Dinakarrao. Machine Learning for Computer Scientists and Data Analysts: From an Applied Perspective. Springer Nature, 2022.
  • [Hands-on] Géron, Aurélien. Hands-on machine learning with Scikit-Learn, Keras, and TensorFlow. " O’Reilly Media, Inc.", 2022.
  • [IP] Integer programming (2021) Laurence A. Wolsey
  • [AP]Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022.

Grading

  • 20% In-Class Quiz (5% * 4)
  • 20% Homework (10% * 2)
  • 60% Term Paper (Group Project)

Grade Policy

10 pt Normal Grade Mode

Letter GradeRange
A100% to 90%
B< 90% to 80%
C< 80% to 70%
D< 70% to 60%
F< 60% to 0%

Examinations and Assignments

All assignments must have your name, student ID and course name/ number. Examinations will heavily emphasize the conceptual understanding of the material. No make-up exams will be given for any other reason than those approved by the college office (serious illness, medical emergency). The exam format will be a mixture of multiple-choice questions and short/long answer questions. If you do not think that your test was graded appropriately, you need to send a valid written explanation for the requested change. This must be done within three days from the date the test was returned to you.

Late Submission Policy

Assignments are required to be submitted by the specified deadlines. Subsequent to the deadline, a penalty of 1% will be deducted from the total score for each hour past the due time, up to a maximum deduction of 50%. If an assignment is submitted after the in-class homework explanation (typically occurring 1-2 weeks post-deadline), submissions will not be accepted, resulting in a score of 0 for the assignment.

陈枳扦
陈枳扦
Assistant Prof.

My research interests include graph learningwith particular interest in graph dynamics.