Stochastic Recursive Momentum for Policy Gradient Methods
원문 초록
In this paper, we propose a novel algorithm named STOchastic Recursive Momentum for Policy Gradient (STORM-PG), which operates a SARAH-type stochastic recursive variance-reduced policy gradient in an exponential moving average fashion. STORM-PG enjoys a provably sharp $O(1/\epsilon^3)$ sample complexity bound for STORM-PG, matching the best-known convergence rate for policy gradient algorithm. In the mean time, STORM-PG avoids the alternations between large batches and small batches which persists in comparable variance-reduced policy gradient methods, allowing considerably simpler parameter tuning. Numerical experiments depicts the superiority of our algorithm over comparative policy gradient algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Direct Retrieval-augmented Optimization: Synergizing Knowledge Selection and Language Models
Hierarchical Policy-Gradient Reinforcement Learning for Multi-Agent Shepherding Control of Non-Cohesive Targets
Convergence Guarantees of Model-free Policy Gradient Methods for LQR with Stochastic Data
Reevaluating Policy Gradient Methods for Imperfect-Information Games
Fine-Tuning Discrete Diffusion Models with Policy Gradient Methods
Divergence-Augmented Policy Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.