Skip to yearly menu bar Skip to main content


Search All 2021 Events
 

Filter by Keyword:

94 Results

<<   <   Page 2 of 8   >   >>
Oral
Wed 19:00 Improved Regret Bound and Experience Replay in Regularized Policy Iteration
Nevena Lazic · Dong Yin · Yasin Abbasi-Yadkori · Csaba Szepesvari
Poster
Thu 9:00 First-Order Methods for Wasserstein Distributionally Robust MDP
Julien Grand-Clement · Christian Kroer
Spotlight
Wed 19:30 Provably Correct Optimization and Exploration with Non-linear Policies
Fei Feng · Wotao Yin · Alekh Agarwal · Lin Yang
Poster
Wed 21:00 Logarithmic Regret for Reinforcement Learning with Linear Function Approximation
Jiafan He · Dongruo Zhou · Quanquan Gu
Poster
Wed 9:00 Bootstrapping Fitted Q-Evaluation for Off-Policy Inference
Botao Hao · Xiang Ji · Yaqi Duan · Hao Lu · Csaba Szepesvari · Mengdi Wang
Spotlight
Wed 18:30 Randomized Exploration in Reinforcement Learning with General Value Function Approximation
Haque Ishfaq · Qiwen Cui · Viet Nguyen · Alex Ayoub · Zhuoran Yang · Zhaoran Wang · Doina Precup · Lin Yang
Poster
Wed 9:00 Kernel-Based Reinforcement Learning: A Finite-Time Analysis
Omar Darwiche Domingues · Pierre Menard · Matteo Pirotta · Emilie Kaufmann · Michal Valko
Poster
Wed 21:00 Fast active learning for pure exploration in reinforcement learning
Pierre Menard · Omar Darwiche Domingues · Anders Jonsson · Emilie Kaufmann · Edouard Leurent · Michal Valko
Spotlight
Wed 17:30 Near-Optimal Representation Learning for Linear Bandits and Linear RL
Jiachen Hu · Xiaoyu Chen · Chi Jin · Lihong Li · Liwei Wang
Spotlight
Tue 7:45 Improved Denoising Diffusion Probabilistic Models
Alexander Nichol · Prafulla Dhariwal
Poster
Wed 9:00 Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with √T Regret
Asaf Cassel · Tomer Koren
Oral
Wed 17:00 Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Andrea Zanette