High-probability sample complexities for policy evaluation with linear function approximation

Documenti analoghi

• Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
  di: Li, Gen, et al.
  Pubblicazione: (2020)
• Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
  di: Li, Gen, et al.
  Pubblicazione: (2021)
• Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
  di: Li, Gen, et al.
  Pubblicazione: (2022)
• Statistical and Algorithmic Foundations of Reinforcement Learning
  di: Chi, Yuejie, et al.
  Pubblicazione: (2025)
• Accelerating Convergence of Score-Based Diffusion Models, Provably
  di: Li, Gen, et al.
  Pubblicazione: (2024)