Theory of reinforcement learning (RL), with a focus on sample complexity analyses.
|08/23||Overview & logistics||slides (updated: 08/30)|
|08/25||MDP basics||note1, reading homework 0|
|09/08||Policy Iteration||blackboard, HW1 available|
|09/15||Concentration inequalities||note2, blackboard|
|09/20||Certainty Equivalence||blackboard (updated: 09/22), note3|
|09/27||Abstraction||note4, slides, HW2 available|
Time & Location
Wed & Fri, 2-3:15pm. 0216 Siebel.
Canvas will be used as the platform for announcement, discussions, and homework submissions. It is important that you join Canvas and turn on notifications to receive announcements in a timely manner.
Philip Amortila, Yuheng Zhang. (Please contact the TAs via Canvas messages.)
I will stay till 4pm for questions after each lecture (may leave early if no one is in the classroom). Additional TA OHs may be added in an on-demand manner.
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
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. Grades decomposition: tentatively 40% homework and 60% project; subject to +-10% changes depending on the actual number of graded homework assignments (expected: 3; there may be separate ad hoc assignments that are not graded).
Statement on CS CARES and CS Values and Code of Conduct
All members of the Illinois Computer Science department - faculty, staff, and students - are expected to adhere to the CS Values and Code of Conduct. The CS CARES Committee is available to serve as a resource to help people who are concerned about or experience a potential violation of the Code. If you experience such issues, please contact the CS CARES Committee. The instructors of this course are also available for issues related to this class.
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, Wen Sun, 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 (not in any particular order; list from 2019 and has not been updated since then):