Fractional Policy Gradients: Reinforcement Learning with Long-Term Memory

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Pawar, Urvi, Telangi, Kunal
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911030233268224
author Pawar, Urvi
Telangi, Kunal
author_facet Pawar, Urvi
Telangi, Kunal
contents We propose Fractional Policy Gradients (FPG), a reinforcement learning framework incorporating fractional calculus for long-term temporal modeling in policy optimization. Standard policy gradient approaches face limitations from Markovian assumptions, exhibiting high variance and inefficient sampling. By reformulating gradients using Caputo fractional derivatives, FPG establishes power-law temporal correlations between state transitions. We develop an efficient recursive computation technique for fractional temporal-difference errors with constant time and memory requirements. Theoretical analysis shows FPG achieves asymptotic variance reduction of order O(t^(-alpha)) versus standard policy gradients while preserving convergence. Empirical validation demonstrates 35-68% sample efficiency gains and 24-52% variance reduction versus state-of-the-art baselines. This framework provides a mathematically grounded approach for leveraging long-range dependencies without computational overhead.
format Preprint
id arxiv_https___arxiv_org_abs_2507_00073
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Fractional Policy Gradients: Reinforcement Learning with Long-Term Memory
Pawar, Urvi
Telangi, Kunal
Machine Learning
I.2.6; I.2.8
We propose Fractional Policy Gradients (FPG), a reinforcement learning framework incorporating fractional calculus for long-term temporal modeling in policy optimization. Standard policy gradient approaches face limitations from Markovian assumptions, exhibiting high variance and inefficient sampling. By reformulating gradients using Caputo fractional derivatives, FPG establishes power-law temporal correlations between state transitions. We develop an efficient recursive computation technique for fractional temporal-difference errors with constant time and memory requirements. Theoretical analysis shows FPG achieves asymptotic variance reduction of order O(t^(-alpha)) versus standard policy gradients while preserving convergence. Empirical validation demonstrates 35-68% sample efficiency gains and 24-52% variance reduction versus state-of-the-art baselines. This framework provides a mathematically grounded approach for leveraging long-range dependencies without computational overhead.
title Fractional Policy Gradients: Reinforcement Learning with Long-Term Memory
topic Machine Learning
I.2.6; I.2.8
url https://arxiv.org/abs/2507.00073