← authors · overview

• Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
  2020 · 29 citations
• Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
  2021 · 18 citations
• Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization
  2021 · 10 citations
• Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity
  2022 · 8 citations
• Softmax Policy Gradient Methods Can Take Exponential Time to Converge
  2021 · 7 citations
• Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
  2022 · 7 citations
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
  2020 · 5 citations
• Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting
  2021 · 5 citations
• Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model
  2022 · 3 citations
• High-probability sample complexities for policy evaluation with linear function approximation
  2023