Toggle Poster Visibility
Oral
Thu Jul 21 07:30 AM -- 07:50 AM (PDT) @ Ballroom 3 & 4
First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach
Spotlight
Thu Jul 21 07:50 AM -- 07:55 AM (PDT) @ Ballroom 3 & 4
Generic Coreset for Scalable Learning of Monotonic Kernels: Logistic Regression, Sigmoid and more
Spotlight
Thu Jul 21 07:55 AM -- 08:00 AM (PDT) @ Ballroom 3 & 4
Shuffle Private Linear Contextual Bandits
Spotlight
Thu Jul 21 08:00 AM -- 08:05 AM (PDT) @ Ballroom 3 & 4
Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity
Spotlight
Thu Jul 21 08:05 AM -- 08:10 AM (PDT) @ Ballroom 3 & 4
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes
Oral
Thu Jul 21 08:10 AM -- 08:30 AM (PDT) @ Ballroom 3 & 4
Label Ranking through Nonparametric Regression
Spotlight
Thu Jul 21 08:30 AM -- 08:35 AM (PDT) @ Ballroom 3 & 4
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
Spotlight
Thu Jul 21 08:35 AM -- 08:40 AM (PDT) @ Ballroom 3 & 4
A Simple Unified Framework for High Dimensional Bandit Problems
Spotlight
Thu Jul 21 08:40 AM -- 08:45 AM (PDT) @ Ballroom 3 & 4 None
A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds
Spotlight
Thu Jul 21 08:45 AM -- 08:50 AM (PDT) @ Ballroom 3 & 4
Branching Reinforcement Learning
Spotlight
Thu Jul 21 08:50 AM -- 08:55 AM (PDT) @ Ballroom 3 & 4
Fast rates for noisy interpolation require rethinking the effect of inductive bias
Spotlight
Thu Jul 21 08:55 AM -- 09:00 AM (PDT) @ Ballroom 3 & 4
Near-Optimal Algorithms for Autonomous Exploration and Multi-Goal Stochastic Shortest Path