Overview

Key Information

Tuesday + Thursday, 9:40am - 11am, Soda 405(New Location: SODA 310)

42% homeworks, 8% peer review, 40% project and proposals, 7% scribing, 3% class participation

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.

Prerequisites

Graduate-level mathematical maturity, including proof-based graduate-level courses in at least two, but recommended three, of the following categories:

  1. Statistics and Probability, e.g., STAT205, STAT210

  2. Economics, e.g., ECON207

  3. Algorithms, e.g., CS270

  4. Optimization, e.g., EE 227

  5. 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.

Schedule (Subject to change)

This schedule of tentative. It is likely that some topics will move around or even be removed from the schedule as the term progresses.

DateTopicSlides/NotesReadings
08/28Introduction and Gentle StartLecture 1 Slides
09/02Statistical learning ILecture 2 NotesUML chapter 2-3
09/04Statistical learning IILecture 3 NotesUML Chapter 4
09/09Statistical learning IIILecture 4 NotesUML Chapter 6
09/11Agnostic Learning and Intro to Online LearningLecture 5 NotesUML Chapter 21
09/16Online Learning IILecture 6 NotesUML Chapter 21 and FoML Chapter 8
09/18Online Learning IIILecture 7 NotesUML Chapter 21
09/23Online Learning with Smoothed AdversariesLecture 8 NotesJournal of the ACM paper
09/25Efficient Algorithms for Online LearningLecture 9 Notes
09/30Bandits and Partial FeedbackLecture 10 Notes
10/02Zero-sum GamesLecture 11 NotesSection 18.3, 20 Lectures on AGT
10/07General-Sum Games and Nash EquilibriaLecture 12 NotesChapter 20.5, 20 Lectures on AGT
10/09Correlated EquilibriaLecture 13 NotesChapter 17, 20 Lectures on AGT
10/14Special lecture on Auctions (Annie Ulichney)
10/16Reductions for Swap RegretChapter 18, 20 Lectures on AGT
10/21Stackelberg Games
10/23Learning in Stackelberg Games I
10/28Learning in Stackelberg Games II
10/30Predictions and Calibration
11/04Sequential Calibration
11/06Calibrated Predictors
11/11No Class
11/13Truthfulness of Calibration
11/18Multi-distribution Learning I
11/20Multi-distribution Learning II
11/25Multi-objective Learning
12/02Multi-calibration
12/04Omni-prediction

Scribing and Class Participation

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.

Homeworks and Projects

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.

Due dates (Subject to change)

HomeworkFilesPostedDue
Homework 009/02 (*)09/10 (*)
Homework 109/0509/16
Homework 209/1909/30
Homework 310/0310/14
Project proposal V110/07
Project proposal Peer Assignment10/0910/21
Project proposal V211/04
Homework 411/0711/20 (*)
Homework 511/25 (*)12/05
Final ProjectPresentation TBDReport TBD

Exams

The class does not have a midterm or final exam!