|
Oral
|
Wed 17:00
|
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Andrea Zanette
|
|
|
Poster
|
Wed 21:00
|
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Andrea Zanette
|
|
|
Spotlight
|
Wed 17:30
|
Online Learning for Load Balancing of Unknown Monotone Resource Allocation Games
Ilai Bistritz · Nicholas Bambos
|
|
|
Poster
|
Wed 21:00
|
Online Learning for Load Balancing of Unknown Monotone Resource Allocation Games
Ilai Bistritz · Nicholas Bambos
|
|
|
Poster
|
Thu 21:00
|
Boosting for Online Convex Optimization
Elad Hazan · Karan Singh
|
|
|
Spotlight
|
Thu 20:35
|
Boosting for Online Convex Optimization
Elad Hazan · Karan Singh
|
|
|
Spotlight
|
Tue 7:35
|
EMaQ: Expected-Max Q-Learning Operator for Simple Yet Effective Offline and Online RL
Seyed Kamyar Seyed Ghasemipour · Dale Schuurmans · Shixiang Gu
|
|
|
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
|
|
|
Spotlight
|
Thu 6:25
|
PAPRIKA: Private Online False Discovery Rate Control
Wanrong Zhang · Gautam Kamath · Rachel Cummings
|
|
|
Poster
|
Thu 9:00
|
PAPRIKA: Private Online False Discovery Rate Control
Wanrong Zhang · Gautam Kamath · Rachel Cummings
|
|
|
Poster
|
Thu 21:00
|
Learner-Private Convex Optimization
Jiaming Xu · Kuang Xu · Dana Yang
|
|
