Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning

Documenti analoghi

• Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
  di: Chen, Zijun, et al.
  Pubblicazione: (2025)
• A Finite Sample Complexity Bound for Distributionally Robust Q-learning
  di: Wang, Shengbo, et al.
  Pubblicazione: (2023)
• Sample Complexity of Variance-reduced Distributionally Robust Q-learning
  di: Wang, Shengbo, et al.
  Pubblicazione: (2023)
• On the Foundation of Distributionally Robust Reinforcement Learning
  di: Wang, Shengbo, et al.
  Pubblicazione: (2023)
• Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values
  di: Wang, Shengbo, et al.
  Pubblicazione: (2026)