arXiv:1701.00867
A K-fold Method for Baseline Estimation in Policy Gradient Algorithms
원문 초록
The high variance issue in unbiased policy-gradient methods such as VPG and REINFORCE is typically mitigated by adding a baseline. However, the baseline fitting itself suffers from the underfitting or the overfitting problem. In this paper, we develop a K-fold method for baseline estimation in policy gradient algorithms. The parameter K is the baseline estimation hyperparameter that can adjust the bias-variance trade-off in the baseline estimates. We demonstrate the usefulness of our approach via two state-of-the-art policy gradient algorithms on three MuJoCo locomotive control tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Enhanced DACER Algorithm with High Diffusion Efficiency
Residual Policy Gradient: A Reward View of KL-regularized Objective
Off-OAB: Off-Policy Policy Gradient Method with Optimal Action-Dependent Baseline
Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction
Deep Reinforcement Learning with Gradient Eligibility Traces
Generalized Adaptive Transfer Network: Enhancing Transfer Learning in Reinforcement Learning Across Domains
토론
이 논문과 연결된 포럼 글이 아직 없습니다.