Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds

Documenti analoghi

• Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
  di: Vakili, Sattar, et al.
  Pubblicazione: (2024)
• Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
  di: Boudart, Pierre, et al.
  Pubblicazione: (2026)
• Kernelized Reinforcement Learning with Order Optimal Regret Bounds
  di: Vakili, Sattar, et al.
  Pubblicazione: (2023)
• Robust Offline Reinforcement learning with Heavy-Tailed Rewards
  di: Zhu, Jin, et al.
  Pubblicazione: (2023)
• Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
  di: Zhong, Han, et al.
  Pubblicazione: (2023)