Calendar
Please Log In for full access to the web site.
Note that this link will take you to an external site (https://shimmer.mit.edu) to authenticate, and then you will be redirected back to this page.
Spring 2025, subject to change
| Week | Lectures, Readings | Homework | Info |
|---|---|---|---|
| Week 1 02/03 - 02/07 | M: Lec 1: Course Intro Readings: AIMA 6.1,6.2, 1(opt), 2(opt) W: Lec 2: Constraint Satisfaction Problems Readings: AIMA 6.2--6.4 | HW 0: Background | |
| Week 2 02/10 - 02/14 | M: Lec 3: Probabilistic Graphical Models Readings: AIMA 13.1--2 W: Lec 4: Belief Propagation Readings: Barber 4.1, 4.4, 5.1--2 | HW 1: CSP and Graphical Models | |
| Week 3 02/17 - 02/21 | M: Lec 5: General inference methods Readings: AIMA 13.3.2, 13.2.3 or Barber 5.3, 5.4 W: Lec 6: Sampling Readings: AIMA 13.4 or Barber 27.1--4 | HW 2: Inference in GMs | Monday is a holiday! Lecture on Tuesday |
| Week 4 02/24 - 02/28 | M: Lec 7: Discrete temporal models Readings: AIMA 14.1--14.3; Barber 23.2 W: Lec 8: Continuous temporal models Readings: AIMA 14.4, 14.5.3; Barber 24.1, 24.3--4, 27.6 | HW 3: Temporal models | |
| Week 5 03/03 - 03/07 | M: Lec 9: Propositional logic Readings: AIMA 7.3--7.5 W: Lec 10: Resolution proof Readings: AIMA 7.5, 8.1.2, 8.2 | HW 4: Kalman Filters and Propositional Logic | |
| Week 6 03/10 - 03/14 | M: Lec 11: First-order Logic 1 W: Lec 12: First-order Logic 2 | HW 5: First-order logic and search | |
| Week 7 03/17 - 03/21 | M: Lec 13: Search: A* and MCTS W: Midterm 3/19 (7PM--9PM) | No (new) Homework | |
| Week 8 03/24 - 03/28 | M: No Lecture W: No Lecture | No (new) Homework | SPRING BREAK |
| Week 9 03/31 - 04/04 | M: Lec 14: Symbolic planning W: Lec 15: Continuous-space planning | HW 6: Planning | |
| Week 10 04/07 - 04/11 | M: Lec 16: Conditional and Conformant Planning W: Lec 17: Decision / Utility Theory | HW 7: Decision theory and MDPs | |
| Week 11 04/14 - 04/18 | M: Lec 18: MDP Introduction and Search Methods W: Lec 19: MDP Dynamic Programming | HW 8: Dynamic programming | |
| Week 12 04/21 - 04/25 | M: No Lecture W: Lec 20: Approximate Dynamic Programming | No (new) Homework | M 4/21 Holiday |
| Week 13 04/28 - 05/02 | M: Lec 21: POMDP Search Methods W: Lec 22: POMDP Dynamic Programming | HW 9: POMDPs and Bandits | |
| Week 14 05/05 - 05/09 | M: Lec 23: Bandit Problems W: Lec 24: Basic Game Theory | HW 10: Bandits and FOL | |
| Week 15 05/12 - 05/16 | M: Lec 25: Connections to Machine Learning W: No Lecture | HW 11: (Optional) Game theory | |
| Finals 5/16 - 5/21 |