Fourier Policy Gradients
Not on the map. Why?
Abstract (arXiv)
We propose a new way of deriving policy gradient updates for reinforcement learning. Our technique, based on Fourier analysis, recasts integrals that arise with expected policy gradients as convolutions and turns them into multiplications. The obtained analytical solutions allow us to capture the low variance benefits of EPG in a broad range of settings. For the critic, we treat trigonometric and radial basis functions, two function families with the universal approximation property. The choice of policy can be almost arbitrary, including mixtures or hybrid continuous-discrete probability distributions. Moreover, we derive a general family of sample-based estimators for stochastic policy gradients, which unifies existing results on sample-based approximation. We believe that this technique has the potential to shape the next generation of policy gradient approaches, powered by analytical results.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Feb 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1.
3 papers.
- 2021Bayesian Bellman Operatorscited by 16
- 2024Fourier Controller Networks for Real-Time Decision-Making in Embodied Learningcited by 3
- 2023Taylor TD-learningcited by 0
- 2024Fourier Controller Networks for Real-Time Decision-Making in Embodied Learning30 May 2024
- 2023Taylor TD-learning27 Feb 2023
- 2021Bayesian Bellman Operators9 Jun 2021