|
Poster
|
|
Trading Off Resource Budgets For Improved Regret Bounds
Thomas Orton · Damon Falck
|
|
|
Poster
|
Tue 9:00
|
Simple and Optimal Greedy Online Contention Resolution Schemes
Vasilis Livanos
|
|
|
Poster
|
Thu 9:00
|
Non-convex online learning via algorithmic equivalence
Udaya Ghai · Zhou Lu · Elad Hazan
|
|
|
Poster
|
Thu 14:00
|
Algorithms that Approximate Data Removal: New Results and Limitations
Vinith Suriyakumar · Ashia Wilson
|
|
|
Poster
|
Thu 14:00
|
Augmenting Online Algorithms with ε-Accurate Predictions
Anupam Gupta · Debmalya Panigrahi · Bernardo Subercaseaux · Kevin Sun
|
|
|
Poster
|
Wed 9:00
|
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
Billy Jin · Will Ma
|
|
|
Poster
|
|
Distributed Online Convex Optimization with Compressed Communication
Zhipeng Tu · Xi Wang · Yiguang Hong · Lei Wang · Deming Yuan · Guodong Shi
|
|
|
Poster
|
Wed 9:00
|
Online Algorithms for the Santa Claus Problem
Max Springer · MohammadTaghi Hajiaghayi · Debmalya Panigrahi · Mohammad Khani
|
|
|
Poster
|
Wed 14:00
|
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm
Changlong Wu · Mohsen Heidari · Ananth Grama · Wojciech Szpankowski
|
|
|
Poster
|
Tue 9:00
|
Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification
Junpei Komiyama · Taira Tsuchiya · Junya Honda
|
|
|
Poster
|
Wed 9:00
|
(Optimal) Online Bipartite Matching with Degree Information
Anders Aamand · Justin Chen · Piotr Indyk
|
|
|
Poster
|
Wed 14:00
|
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
Elena Grigorescu · Young-San Lin · Sandeep Silwal · Maoyuan Song · Samson Zhou
|
|
