Workshop on Learning-Augmented Algorithms

Date: August 19-21, 2024
Location: TTIC, Chicago, IL
Address: 6045 S Kenwood Ave, Chicago, IL 60637

Parking Information

Organizers:

Sponsors:

This workshop is part of the 2024 TTIC Summer Workshop Program and is sponsored by generous support from TTIC and NSF.

Registration:

Registration Form

We will be holding sessions for poster and lightning talks. If you are interested in presenting a poster or giving a lightning talk, please indicate your interest and preference in the registration form. While we aim to accommodate all submissions, we may have to limit the number of presentations due to time and space constraints

Participants:

Schedule (Tentative):

Monday: Day 1 Link
9:30-9:50 Breakfast
9:50-10 Opening Remarks
10-10:30 Adam Polak: Approximation Algorithms with Predictions [abstract]
10:30-11 Nina Balcan: Learning Machine Learning Algorithms [abstract]
11-11:30 Discussion/break
11:30-12 Aditya Bhaskara: Online Learning and Bandits with Hints [abstract]
12-1 Lightning Talks
1-2 Lunch
2-2:30 Ben Moseley: Incremental Topological Ordering and Cycle Detection with Predictions [abstract]
2:30-3 Michael Mitzenmacher: SkipPredict: When to Invest in Predictions for Scheduling [abstract]
3-3:30 Discussion/break
3:30-4 Sami Davies: Correlation Clustering in the Online-with-a-Sample Model [abstract]
4-4:30 Huy L. Nguyen: Improved Frequency Estimation Algorithms with and without Predictions [abstract]
4:30-5:30 Poster session

Tuesday: Day 2 Morning Link Day 2 Afternoon Link
9:30-10 Breakfast
10-10:30 Yossi Azar: Online Predictions and Close to 1-Smoothness [abstract]
10:30-11 Quanquan Liu: The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations [abstract]
11-11:30 Discussion/break
11:30-12 Ravi Kumar: Linear Elastic Caching [abstract]
12-1 Lightning Talks
1-2 Lunch
2-2:30 David Woodruff: Learning CountSketch [abstract]
2:30-3 Barna Saha: Clustering with Queries [abstract]
3-3:30 Discussion/break
3:30-4 Adam Wierman: Learning Augmented Algorithms for MDPs [abstract]
4-4:30 Anupam Gupta: Graph Exploration with Predictions [abstract]
4:30-5:30 Open problem session

Wednesday: Day 3 Link
9:30-10 Breakfast
10-10:30 Eric Balkanski: Fair Secretaries with Unfair Predictions [abstract]
10:30-11 Negin Golrezaei: Online Resource Allocation with Convex-Set Machine-Learned Advice [abstract]
11-11:30 Discussion/break
11:30-12 Rad Niazedeh: Robust Dynamic Staffing with Predictions [abstract]
12-12:30 Debmalya Panigrahi: Learning-augmented Assignment: Santa Claus Does Load Balancing [abstract]
12:30-1:30 Lunch
1:30-2 Sungjin Im: Online Load and Graph Balancing for Random Order Inputs [abstract]
2-2:30 Ellen Vitercik: Online Matching with Graph Neural Networks [abstract]