# Schedule
AEFIS Syllabus: TBA
| Week |
Date |
Topics |
RN |
SS |
Q |
D |
M |
P |
| W1 |
20-May |
Perceptron Algorithm |
19 |
9 |
Q1 |
D1 |
M1 |
P1 |
|
20-May |
Logistic Regression |
19 |
14 |
Q2 |
|
M2 |
|
| W2 |
27-May |
Neural Network |
19 |
20 |
Q3 |
D2 |
M3 |
|
|
27-May |
Backpropagation |
19 |
20 |
Q4 |
|
|
|
| W3 |
3-Jun |
Support Vector Machine |
19 |
15-16 |
Q5 |
D3 |
M4 |
P2 |
|
3-Jun |
Decision Tree, K-Nearest-Neighbors |
19 |
18-19 |
Q6 |
|
|
|
| W4 |
10-Jun |
Computer Vision, Convolutional Network |
25 |
|
Q7 |
D4 |
M5 |
|
|
10-Jun |
Natural Language and Speech |
21 |
|
Q8 |
|
|
|
| W5 |
17-Jun |
Bayesian Network, Naive Bayes |
23 |
|
Q9 |
D5 |
|
|
|
17-Jun |
Large Language Models |
20 |
24 |
Q10 |
|
M6 |
P3 |
| W6 |
24-Jun |
Midterm Review |
24 |
|
|
D6 |
|
|
|
24-Jun |
Midterm Review |
|
|
|
|
|
|
| W7 |
1-Jul |
Midterm Exam |
22 |
|
Q11 |
|
|
|
|
1-Jul |
Midterm Exam |
22 |
|
Q12 |
|
|
|
| W8 |
8-Jul |
Hierarchical Clustering, K-Means Clustering |
|
|
|
|
|
P6 |
|
8-Jul |
Principal Component Analysis |
|
|
|
|
|
|
| W9 |
15-Jul |
Markov Decision Process |
20 |
22 |
Q13 |
D7 |
M7 |
P4 |
|
15-Jul |
Reinforcement Learning |
20 |
23 |
Q14 |
|
|
|
| W10 |
22-Jul |
Uninformed Search, Robotics |
20 |
22 |
Q15 |
D8 |
M8 |
|
|
22-Jul |
Informed Search |
20 |
23 |
Q16 |
|
|
|
| W11 |
29-Jul |
Hill-Climbing, Simulated Annealing |
3 |
|
Q17 |
D9 |
M9 |
P5 |
|
29-Jul |
Genetic Algorithms, Constraint Satisfaction |
3 |
|
Q18 |
|
|
|
| W12 |
5-Aug |
Game Theory |
4 |
|
Q19 |
D10 |
M10 |
|
|
5-Aug |
Minimax Game, Alpha-Beta Pruning |
4 |
|
Q20 |
|
|
|
| W13 |
12-Aug |
Final Exam Review |
5 |
|
Q21 |
D11 |
M12 |
P6 |
|
12-Aug |
Final Exam Review |
5 |
|
Q22 |
|
M11 |
|
| W14 |
19-Aug |
Final Exam |
|
|
|
D12 |
|
|
|
19-Aug |
Final Exam |
|
|
|
|
|
|
📗 (RN) Russell and Norvig: Chapters from the optional textbook: Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig
Link.
📗 (SS) Shai and Shai: Chapters from the optional textbook: Understanding Machine Learning: From Theory to Algorithms by Shai Shalev-Schwartz and Shai Ben-David
Link.
📗 (D) Participation: Weekly in-class Quizzes and group Discussions.
📗 (M) Math homework: Weekly Math homework.
📗 (P) Programming homework and competitions: Bi-weekly Programming homework and programming competitions.
📗 Synchronous lectures: official lecture time slots will be used for: (~5 min) participation games, (~20 min) review of basic materials, (~45 min) going over examples and quizzes, on Zoom and recorded. You will login TopHat using your wiscID to complete the quizzes.
📗 (Optional) Asynchronous lectures: pre-recorded lectures from last two years are posted on YouTube (~2 hour each lecture, divided into six parts). Pre-recorded discussions of quiz and homework questions will be posted on YouTube. They cover the same materials as the Zoom lectures, and can be watched either before or after the official lecture time slots. If you are comfortable with the materials and quiz questions from the Zoom lectures, you can skip these videos.
# Grading Scheme
| Component |
Frequency |
Number |
Points Each |
Total |
| (P) Programming |
Biweekly |
5 |
8 |
40 |
| (X) Exam |
Midterm and Final |
2 |
30 |
60 |
📗 The recommended programming language is Java and Python. Code written in other languages will be accepted. The course staff will only be able to provide help with code in Java and Python.
📗 The lowest Programming homework grade can be replaced by a programming project you choose (P6).
📗 Each of the Exams is worth 30 percent of the final grade, but you can use Quizzes and/or Discussions and/or Math homework to replace a maximum of 15 percent for each Exams.
Alternatives to exams:
| Component |
Frequency |
Number |
Max Points Each |
Total |
| (Q) Quizzes |
Daily |
20 |
0 or 0.5 |
10 |
| (M) Math |
Weekly |
10 |
0 or 1 |
10 |
| (C) Competitions |
- |
2 |
8 |
16 |
📗 The total points earned from Quizzes, Discussions, Competitions and Math homework cannot exceed 30 percent of the final grade, but the unearned points will be used in case of borderline grades (89, 84, 79, etc).
📗 There will be in-class participation quizzes on Tuesdays, Wednesdays and Thursdays, and a group discussion on Fridays.
📗 Competitions are new this summer: you will train machine learning algorithms to play games and the winners (or with the highest scores) can earn bonus points. Competitions can be used to replace programming project grades or exams grades.
| Grade |
Letter |
Numeric |
| 91+ |
A |
4 |
| 86+ |
AB |
3.5 |
| 81+ |
B |
3 |
| 76+ |
BC |
2.5 |
| 71+ |
C |
2 |
| 61+ |
D |
1 |
| 0+ |
F |
0 |
📗 Midterm and final exam grades will be curved by dropping the questions with a negative point biserial correlation coefficient (RPBI < 0) or less than a quarter of the students answered correctly (PROB < 25%). The students who answered those correctly keep the points as bonus points. Quiz and homework grades will not be curved. The final grade will not be curved.
| Exams |
Time |
Format |
Coverage |
| Midterm |
3 hours |
30 Short Answer |
W1 to W6 |
| Final |
3 hours |
30 Short Answer |
W8 to W13 |
# Admin
📗 Instructor: Young Wu
📗 Lectures (recorded): Monday from 5:30 to 8:30
📗 Office Hours (not recorded): TBA
📗 TA:
| Day |
Office Hours |
Staff |
Due |
| Monday |
5:30 - 8:30 |
Young |
Q, M, P, D |
# Course Website
📗 This webpage (for lecture notes and assignments).
📗 Summer 2019 to 2023 Courses:
Link.
📗 Canvas (for grades):
📗 TopHat (for quizzes):
📗 Piazza (for questions):
📗 Professor Jerry Zhu:
2022.
📗 Professor Yingyu Liang:
2018 and
2019 and
2020
📗 Professor Sharon Li:
2021
📗 Professor Charles Dyer:
2019;
📗 Professor Jude Shavlik:
2016.
# Document Links
📗 List of M Test Pages:
M1,
M2,
M3,
M4,
M5,
M6,
M7,
M8,
M9,
M10,
M11,
📗 List of P Pages:
P1,
P2,
P3,
P4,
P5,
P6,
📗 List of X Test Pages:
X1,
X2,
X3,
X4,
X5,
X6,
X7,
X8,
📗 Anonymous Feedback Form:
Link
📗 List of Regrade Request Forms:
M:
Link,
P:
Link,
Q:
Link,
X:
Link.
Last Updated: April 06, 2024 at 1:53 AM