← authors · overview

• Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?
  2020 · 7 citations
• Minimax Sample Complexity for Turn-based Stochastic Game
  2020 · 5 citations
• Randomized Exploration for Reinforcement Learning with General Value Function Approximation
  2021 · 3 citations
• On Gap-dependent Bounds for Offline Reinforcement Learning
  2022 · 3 citations
• When is Offline Two-Player Zero-Sum Markov Game Solvable?
  2022 · 2 citations
• Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation
  2023 · 2 citations
• Near-Optimal Randomized Exploration for Tabular Markov Decision Processes
  2021 · 1 citations
• Preference-Based Multi-Agent Reinforcement Learning: Data Coverage and Algorithmic Techniques
  2024
• Provably Efficient Offline Multi-agent Reinforcement Learning via Strategy-wise Bonus
  2022
• A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning
  2023
• Free from Bellman Completeness: Trajectory Stitching via Model-based Return-conditioned Supervised Learning
  2023
• Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
  2024
• $\mathbf(N,K)$-Puzzle: A Cost-Efficient Testbed for Benchmarking Reinforcement Learning Algorithms in Generative Language Model
  2024