← authors · overview

• Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds
  2019 · 66 citations
• Learning Near Optimal Policies with Low Inherent Bellman Error
  2020 · 38 citations
• Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
  2020 · 18 citations
• Frequentist Regret Bounds for Randomized Least-Squares Value Iteration
  2019 · 17 citations
• Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning
  2021 · 14 citations
• Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation
  2021 · 7 citations
• Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs
  2019 · 4 citations
• ArCHer: Training Language Model Agents via Hierarchical Multi-Turn RL
  2024 · 2 citations