On the Statistical Complexity for Offline and Low-Adaptive Reinforcement Learning with Structures

Documents similaires

• Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Data
  par: Madhow, Sunil, et autres
  Publié: (2023)
• Is Inverse Reinforcement Learning Harder than Standard Reinforcement Learning? A Theoretical Perspective
  par: Zhao, Lei, et autres
  Publié: (2023)
• Adaptive Neighborhood-Constrained Q Learning for Offline Reinforcement Learning
  par: Mao, Yixiu, et autres
  Publié: (2025)
• On The Statistical Complexity of Offline Decision-Making
  par: Nguyen-Tang, Thanh, et autres
  Publié: (2025)
• On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage
  par: Liu, Haolin, et autres
  Publié: (2026)