The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model

Documenti analoghi

• Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
  di: Li, Gen, et al.
  Pubblicazione: (2022)
• Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
  di: Li, Gen, et al.
  Pubblicazione: (2020)
• Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
  di: Li, Gen, et al.
  Pubblicazione: (2023)
• Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
  di: Li, Gen, et al.
  Pubblicazione: (2021)
• Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
  di: Wang, He, et al.
  Pubblicazione: (2024)