Saved in:
Bibliographic Details
Main Authors: Zheng, Hua, Xie, Wei, Feng, M. Ben, Choy, Keilung
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.05379
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914307533438976
author Zheng, Hua
Xie, Wei
Feng, M. Ben
Choy, Keilung
author_facet Zheng, Hua
Xie, Wei
Feng, M. Ben
Choy, Keilung
contents Effective reinforcement learning (RL) for complex stochastic systems requires leveraging historical data collected in previous iterations to accelerate policy optimization. Classical experience replay treats all past observations uniformly and fails to account for their varying contributions to learning. To overcome this limitation, we propose Variance Reduction Experience Replay (VRER), a principled framework that selectively reuses informative samples to reduce variance in policy gradient estimation. VRER is algorithm-agnostic and integrates seamlessly with existing policy optimization methods, forming the basis of our sample-efficient off-policy algorithm, Policy Gradient with VRER (PG-VRER). Motivated by the lack of rigorous theoretical analysis of experience replay, we develop a novel framework that explicitly captures dependencies introduced by Markovian dynamics and behavior-policy interactions. Using this framework, we establish finite-time convergence guarantees for PG-VRER and reveal a fundamental bias-variance trade-off: reusing older experience increases bias but simultaneously reduces gradient variance. Extensive empirical experiments demonstrate that VRER consistently accelerates policy learning and improves performance over state-of-the-art policy optimization algorithms.
format Preprint
id arxiv_https___arxiv_org_abs_2602_05379
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Variance Reduction Based Experience Replay for Policy Optimization
Zheng, Hua
Xie, Wei
Feng, M. Ben
Choy, Keilung
Machine Learning
Effective reinforcement learning (RL) for complex stochastic systems requires leveraging historical data collected in previous iterations to accelerate policy optimization. Classical experience replay treats all past observations uniformly and fails to account for their varying contributions to learning. To overcome this limitation, we propose Variance Reduction Experience Replay (VRER), a principled framework that selectively reuses informative samples to reduce variance in policy gradient estimation. VRER is algorithm-agnostic and integrates seamlessly with existing policy optimization methods, forming the basis of our sample-efficient off-policy algorithm, Policy Gradient with VRER (PG-VRER). Motivated by the lack of rigorous theoretical analysis of experience replay, we develop a novel framework that explicitly captures dependencies introduced by Markovian dynamics and behavior-policy interactions. Using this framework, we establish finite-time convergence guarantees for PG-VRER and reveal a fundamental bias-variance trade-off: reusing older experience increases bias but simultaneously reduces gradient variance. Extensive empirical experiments demonstrate that VRER consistently accelerates policy learning and improves performance over state-of-the-art policy optimization algorithms.
title Variance Reduction Based Experience Replay for Policy Optimization
topic Machine Learning
url https://arxiv.org/abs/2602.05379