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