|
Oral
|
Wed 17:00
|
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Andrea Zanette
|
|
|
Oral Session
|
Tue 6:00
|
Deep Learning Algorithms 2
|
|
|
Workshop
|
Sat 7:25
|
Differentiable learning Under Algorithmic Triage Q&A
|
|
|
Workshop
|
|
DFUQ poster 1 -- Online Multivalid Learning
|
|
|
Oral Session
|
Tue 7:00
|
Deep Learning Algorithms 3
|
|
|
Oral Session
|
Tue 7:00
|
Deep Learning Algorithms 4
|
|
|
Poster
|
Thu 21:00
|
Efficient Online Learning for Dynamic k-Clustering
Dimitris Fotakis · Georgios Piliouras · Stratis Skoulakis
|
|
|
Spotlight
|
Thu 18:30
|
Efficient Online Learning for Dynamic k-Clustering
Dimitris Fotakis · Georgios Piliouras · Stratis Skoulakis
|
|
|
Poster
|
Wed 21:00
|
Regularized Online Allocation Problems: Fairness and Beyond
Santiago Balseiro · Haihao Lu · Vahab Mirrokni
|
|
|
Spotlight
|
Wed 17:25
|
Regularized Online Allocation Problems: Fairness and Beyond
Santiago Balseiro · Haihao Lu · Vahab Mirrokni
|
|
|
Poster
|
Wed 9:00
|
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs
Chloé Rouyer · Yevgeny Seldin · Nicolò Cesa-Bianchi
|
|
|
Spotlight
|
Wed 6:45
|
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs
Chloé Rouyer · Yevgeny Seldin · Nicolò Cesa-Bianchi
|
|
