Fractional Policy Gradients: Reinforcement Learning with Long-Term Memory

Urvi Pawar, Kunal Telangi
6/29/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{pawar2025fractional,
  title  = {Fractional Policy Gradients: Reinforcement Learning with Long-Term Memory},
  author = {Urvi Pawar and Kunal Telangi},
  year   = {2025},
  eprint = {2507.00073},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.00073v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.00073.svg)](https://codeofpaper.com/paper/2507.00073)

Discussion