Finite-Time Complexity of Online Primal-Dual Natural Actor-Critic Algorithm for Constrained Markov Decision Processes

Documenti analoghi

• Natural Policy Gradient and Actor Critic Methods for Constrained Multi-Task Reinforcement Learning
  di: Zeng, Sihan, et al.
  Pubblicazione: (2024)
• A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning
  di: Zeng, Sihan, et al.
  Pubblicazione: (2021)
• Fast Two-Time-Scale Stochastic Gradient Method with Applications in Reinforcement Learning
  di: Zeng, Sihan, et al.
  Pubblicazione: (2024)
• Fast Nonlinear Two-Time-Scale Stochastic Approximation: Achieving $O(1/k)$ Finite-Sample Complexity
  di: Doan, Thinh T.
  Pubblicazione: (2024)
• Accelerated Multi-Time-Scale Stochastic Approximation: Optimal Complexity and Applications in Reinforcement Learning and Multi-Agent Games
  di: Zeng, Sihan, et al.
  Pubblicazione: (2024)