Data-Driven Decision Processes Boot Camp

Program

Data-Driven Decision Processes

Location

Calvin Lab Auditorium

Date

Monday, Aug. 22 – Friday, Aug. 26, 2022

Back to calendar

All talks are listed in Pacific Time.

9 – 9:25 a.m.

Coffee and Check-In

9:25 – 9:30 a.m.

Opening Remarks

9:30 – 10:30 a.m.

Stochastic Bandits: Foundations and Current Perspectives

Shipra Agrawal (Columbia University)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Stochastic Bandits: Foundations and Current Perspectives

Shipra Agrawal (Columbia University)

12 – 2 p.m.

Lunch

2 – 3:15 p.m.

Adversarial Bandits: Theory and Algorithms

Haipeng Luo (USC)

3:15 – 3:45 p.m.

Break

3:45 – 5 p.m.

Bridging Stochastic and Adversarial Bandits

Thodoris Lykouris (MIT)

5 – 6 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Fundamentals of Markov Decision Processes

Weina Wang (Carnegie Mellon University)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Foundations of RL

Rayadurgam Srikant (University of Illinois Urbana-Champaign)

12 – 2 p.m.

Lunch

2 – 3:15 p.m.

Foundations of RL

Rayadurgam Srikant (University of Illinois Urbana-Champaign)

3:15 – 3:45 p.m.

Break

3:45 – 5 p.m.

Online Reinforcement Learning and Regret

Christina Lee Yu (Cornell University),
Sean Sinclair (Cornell)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Competitive Analysis of Online Algorithms (Parts 1 and 2)

Anupam Gupta (Carnegie Mellon University)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Competitive Analysis of Online Algorithms (Parts 1 and 2)

Anupam Gupta (Carnegie Mellon University)

12 – 2 p.m.

Lunch

2 – 3:15 p.m.

Competitive Analysis Meets Stochastic Input: Secretary Problems And Prophet Inequalities

Shuchi Chawla (UT Austin)

3:15 – 3:45 p.m.

Break

3:45 – 5 p.m.

Machine Learning For Algorithm Design

Ellen Vitercik (Stanford)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

(Sequential) Information Design

Laura Doval (Columbia University)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Limited Commitment: Mechanism Design Meets Information Design

Laura Doval (Columbia University)

12 – 2 p.m.

Lunch

2 – 3:15 p.m.

Multicalibration: Towards Fair Decision Making

Michael Kim (UC Berkeley)

3:15 – 3:45 p.m.

Break

3:45 – 5 p.m.

Multi-Distribution Learning, for Robustness, Fairness, and Collaboration

Nika Haghtalab (UC Berkeley)

9 – 9:30 a.m.

Coffee and Check-In

9:10 – 9:50 a.m.

Blackwell’s Approachability Theorem

Rakesh Vohra (UPenn)

9:50 – 10:30 a.m.

Offline-to-Online Transformation via Blackwell Approachability

Negin Golrezaei (MIT)

10:30 – 10:50 a.m.

Break

10:50 – 11:30 a.m.

The Blackwell-Rao Theorem

Daniel Alabi (Columbia University)

11:30 a.m. – 12:10 p.m.

Understanding, Simplicity, And Decision Trees

Bin Yu (UC Berkeley)

12:10 – 2 p.m.

Lunch

2 – 3 p.m.

Reflections of David Blackwell on the Work of David Blackwell

Bill Massey (Princeton)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

David Blackwell: Teacher And Colleague And A Sample Of His Work

Peter Bickel (UC Berkeley)