This course introduces students to the mathematical foundation of learning in the presence of strategic and societal agency. This is a theory-oriented course that will draw from the statistical and computational foundations of machine learning, computer science, and economics. As a research-oriented course, a range of advanced topics will be explored to paint a comprehensive picture of classical and modern approaches to learning for the purpose of decision making. These topics include foundations of learning, foundations of algorithmic game theory, cooperative and non-cooperative games, equilibria and dynamics, learning in games, information asymmetries, mechanism design, and learning with incentives. Assigned classwork includes written proof-based homework assignments, participation in discussions and peer evaluations, scribing and contributing to creating enrichment material, and research projects.
Potential list of topics is subject to change but will likely include the following:
Basics of offline and online learning, including VC theory, online learning, mistake bounds, etc.
Smoothed Analysis of Learning.
Bandits and online learning with partial information.
Game theory and solution concepts such as Nash equilibria, Correlated Equilibria, and Stackelberg Games.
Learning Dynamics in Games.
Trustworthy predictions, calibration, and decision-theoretic notions of prediction quality.
Multi-distribution and multi-objective learning.
Fine-grained learning guarantees, multi-calibration, omni-prediction, and pan-prediction.
Graduate-level mathematical maturity, including proof-based graduate-level courses in at least two, but recommended three, of the following categories:
Statistics and Probability, e.g., STAT205, STAT210
Economics, e.g., ECON207
Algorithms, e.g., CS270
Optimization, e.g., EE 227
Control theory, e.g., EE 221A
Please note that some of these pre-requisites play a larger role than others. For example, the course assume that you are comfortable with (1) and lack of preparation in category (1) will be hard to overcome. On the other hand, the course takes a slower approach to the introduction of category (2) concepts and lack of preparation in category (2) can be more easily overcome. It is highly recommended that you feel comfortable with at least one of category (3-5) topics, as the course is strongly algorithmic in nature.
This schedule of tentative. It is likely that some topics will move around or even be removed from the schedule as the term progresses.
| Date | Topic | Slides/Notes | Readings | 
|---|---|---|---|
| 08/28 | Introduction and Gentle Start | Lecture 1 Slides | |
| 09/02 | Statistical learning I | Lecture 2 Notes | UML chapter 2-3 | 
| 09/04 | Statistical learning II | Lecture 3 Notes | UML Chapter 4 | 
| 09/09 | Statistical learning III | Lecture 4 Notes | UML Chapter 6 | 
| 09/11 | Agnostic Learning and Intro to Online Learning | Lecture 5 Notes | UML Chapter 21 | 
| 09/16 | Online Learning II | Lecture 6 Notes | UML Chapter 21 and FoML Chapter 8 | 
| 09/18 | Online Learning III | Lecture 7 Notes | UML Chapter 21 | 
| 09/23 | Online Learning with Smoothed Adversaries | Lecture 8 Notes | Journal of the ACM paper | 
| 09/25 | Efficient Algorithms for Online Learning | Lecture 9 Notes | |
| 09/30 | Bandits and Partial Feedback | Lecture 10 Notes | |
| 10/02 | Zero-sum Games | Lecture 11 Notes | Section 18.3, 20 Lectures on AGT | 
| 10/07 | General-Sum Games and Nash Equilibria | Lecture 12 Notes | Chapter 20.5, 20 Lectures on AGT | 
| 10/09 | Correlated Equilibria | Lecture 13 Notes | Chapter 17, 20 Lectures on AGT | 
| 10/14 | Special lecture on Auctions (Annie Ulichney) | ||
| 10/16 | Reductions for Swap Regret | Chapter 18, 20 Lectures on AGT | |
| 10/21 | Stackelberg Games | ||
| 10/23 | Learning in Stackelberg Games I | ||
| 10/28 | Learning in Stackelberg Games II | ||
| 10/30 | Predictions and Calibration | ||
| 11/04 | Sequential Calibration | ||
| 11/06 | Calibrated Predictors | ||
| 11/11 | No Class | ||
| 11/13 | Truthfulness of Calibration | ||
| 11/18 | Multi-distribution Learning I | ||
| 11/20 | Multi-distribution Learning II | ||
| 11/25 | Multi-objective Learning | ||
| 12/02 | Multi-calibration | ||
| 12/04 | Omni-prediction | 
Every student will be responsible for scribing 1-2 lectures, based on the number of student enrolled in class. Scribing is worth 7% of your final grade. A form will be posted to sign up for scribing.
The first draft of the scribed notes are due 2 work days after the corresponding lecture, i.e., Tuesday lecture note are due on Thursday and Thursday lecture notes are due on the following Monday. Within these two days, the student has to also schedule a short (15-30 min) meeting with the instructor or staff to go over the draft of the scribed notes and receive feedback. The final scribed notes are due within 2 work days after the initial draft.
Written homeworks will involve deriving and proving mathematical results and critically analyzing the material presented in class. Please submit your assignments on Gradescope. We highly encourage you to typeset your submissions. Any part of the submitted work that is not readable by the TAs will be ignored. The homeworks can be done in groups of up to 2 students.
The project involves performing novel research that is directly related to the material covered in the class. Surveys are not within scope for the class project. All students participate in peer reviewing project proposals. The first version of your project proposal will be shared with a few students in the classroom who will be asked to critique your proposal. Your proposal will also be reviewed by the course staff and instructor. You will take this feedback into account when preparing the second version of your proposal.
Solutions will be released about 3-5 days after the deadline.
| Homework | Files | Posted | Due | 
|---|---|---|---|
| Homework 0 | 09/02 (*) | 09/10 (*) | |
| Homework 1 | 09/05 | 09/16 | |
| Homework 2 | 09/19 | 09/30 | |
| Homework 3 | 10/03 | 10/14 | |
| Project proposal V1 | 10/07 | ||
| Project proposal Peer Assignment | 10/09 | 10/21 | |
| Project proposal V2 | 11/04 | ||
| Homework 4 | 11/07 | 11/20 (*) | |
| Homework 5 | 11/25 (*) | 12/05 | |
| Final Project | Presentation TBD | Report TBD | 
The class does not have a midterm or final exam!