|
Poster
|
Tue 14:00
|
Diversified Recommendations for Agents with Adaptive Preferences
William Brown · Arpit Agarwal
|
|
|
Poster
|
Wed 14:00
|
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback
Tiancheng Jin · Tal Lancewicki · Haipeng Luo · Yishay Mansour · Aviv Rosenberg
|
|
|
Poster
|
Tue 9:00
|
Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design
Andrew Wagenmaker · Kevin Jamieson
|
|
|
Poster
|
Thu 9:00
|
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update
Georgios Piliouras · Ryann Sim · Stratis Skoulakis
|
|
|
Poster
|
Thu 14:00
|
Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions
Adam Block · Max Simchowitz
|
|
|
Poster
|
Thu 14:00
|
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
Chloé Rouyer · Dirk van der Hoeven · Nicolò Cesa-Bianchi · Yevgeny Seldin
|
|
|
Poster
|
Tue 14:00
|
Online Agnostic Multiclass Boosting
Vinod Raman · Ambuj Tewari
|
|
|
Poster
|
Wed 14:00
|
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
Asaf Benjamin Cassel · Alon Peled-Cohen · Tomer Koren
|
|
|
Poster
|
Tue 14:00
|
Differentially Private Online-to-batch for Smooth Losses
Qinzi Zhang · Hoang Tran · Ashok Cutkosky
|
|
|
Panel
|
Tue 9:15
|
Panel 1B-1: Online Minimax Multiobjective… & Minimax-Optimal Multi-Agent RL…
Gen Li · Georgy Noarov
|
|
|
Poster
|
Wed 9:00
|
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
Sarah Sachs · Hedi Hadiji · Tim van Erven · Cristóbal Guzmán
|
|
|
Poster
|
Tue 14:00
|
Parameter-free Regret in High Probability with Heavy Tails
Jiujia Zhang · Ashok Cutkosky
|
|
