Theory of reinforcement learning (RL), with a focus on sample complexity analyses.
Please self-enroll on Piazza.
|08/26||Overview, logistics, and MDP basics||video, slides|
|08/28||MDP basics||video, note1, reading hw1|
|09/02||Value Iteration||video, blackboard|
|09/09||Policy Iteration||hw2, video, blackboard|
|09/11||PI, LP||video, blackboard|
|09/16||MAB basics||video, blackboard, note2|
|09/18||Learning settings||video, slides|
|09/23||Sample complexity of certainty equivalence||video, blackboard, note3, Hw2 due before class|
|09/25||Sample complexity of CE (cont)||video, blackboard|
|09/30||Cancelled (Simons workshop)|
|10/02||State abstractions||video, annotated slides (updated), note4, clean slides|
|10/09||Abstractions & FQI||video, clean slides|
|10/21||FQI proof||video, annotated slides & handwriting, note5|
|10/23||Importance sampling||video, note6, blackboard|
|10/28||IS, PG||video, blackboard, hw3 available|
|10/30||Marginalized IS||video, blackboard (updated: 11/4)|
|11/06||Office hour (no lecture)|
|11/11||Exploration (Rmax)||note7, video, blackboard (updated: 11/13), hw3 due|
|11/18||Bellman rank||video, paper, slides (updated: 11/20)|
|12/02||Exploration in linear MDPs||video, blackboard (see clarification at the end)|
|12/04||Partial observability||video, slides|
|12/11||Project due EOD|
Time & Location
Wed & Fri, 12:30-01:45pm. Zoom link
Tengyang Xie (please contact the TA via Piazza)
Linear algebra, probability & statistics, and basic calculus. Experience with machine learning (e.g., CS 446), and preferably reinforcement learning. It is also recommended that the students are familiar with stochastic processes and numerical analysis.
Coursework & Grading
Homework may be assigned on an ad hoc basis to help students digest particular material. The main assignment will be a course project that involves literature review, reproduction of theoretical analyses in existing work, and original research (see details below). No exams.
Topics Covered in Lectures
You will work individually. You can choose one of the following three types of projects:
Reproduce the proofs of existing paper(s). You must fully understand the proofs and rewrite them in your own words. Sometimes a paper considers a relatively general setting and the analysis can be quite complicated. In this case you should aim at scrutinizing the results and presenting them in the cleanest possible way. Ask yourself: What’s the most essential part of the analysis? Can you introduce simplification assumptions to simplify the proofs sigificantly without trivializing the results?
Novel research Pick a new research topic and work on it. Be sure to discuss with me before you settle on the topic. The project must contain a significant theoretical component.
Something between 1 & 2 I would encourage most of you to start in this category. The idea is to reproduce the proofs of existing results and see if you can extend the analysis to a more challenging and/or interesting setting. This way, even if you do not get the new results before the end of semester, your project will just fall back to category 1.
See the link at the top of this page for potential topics. You are expected to submit a short project proposal in the middle of the semester. The proposal should consist of a short paragraph describing your project topic, the papers you plan to work on, and the original research question (if applicable).
Useful inequalities cheat sheet (by László Kozma)
Concentration of measure (by John Lafferty, Han Liu, and Larry Wasserman)
We will not follow a specific textbook, but here are some good books that you can consult:
Alekh Agarwal, Sham Kakade, and I also have a draft monograph which contained some of the lecture notes from this course.
There are also many related courses whose material is available online. Here is an incomplete list of them (not in any particular order):