Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy

One of the key challenges that Reinforcement Learning (RL) faces is its limited capability to adapt to a change of data distribution caused by uncertainties. This challenge arises especially in RL systems using deep neural networks as decision makers or policies, which are prone to overfitting after prolonged training on fixed environments. To address this challenge, this paper proposes Gaussian Process Diffusion Policy (GPDP), a new algorithm that integrates diffusion models and Gaussian Process Regression (GPR) to represent the policy. GPR guides diffusion models to generate actions that maximize learned Q-function, resembling the policy improvement in RL. Furthermore, the kernel-based nature of GPR enhances the policy’s exploration efficiency under distribution shifts at test time, increasing the chance of discovering new behaviors and mitigating overfitting. Simulation results on the Walker2d benchmark show that our approach outperforms state-of-the-art algorithms under distribution shift condition by achieving around 67.74% to 123.18% improvement in the RL’s objective function while maintaining comparable performance under normal conditions.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/ssp64130.2025.11073292
Citations
1
Primary Topic
Gaussian Processes and Bayesian Inference
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy

Esa Apriaskar, Lyudmila Mihaylova, Lanlan Su, Xingyu Liu et al.
1 citations
Gaussian Processes and Bayesian Inference
2.48
article

Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy

Esa Apriaskar, Lyudmila Mihaylova, Lanlan Su, Xingyu Liu, Amornyos Horprasert
article en
1 citations

Abstract

One of the key challenges that Reinforcement Learning (RL) faces is its limited capability to adapt to a change of data distribution caused by uncertainties. This challenge arises especially in RL systems using deep neural networks as decision makers or policies, which are prone to overfitting after prolonged training on fixed environments. To address this challenge, this paper proposes Gaussian Process Diffusion Policy (GPDP), a new algorithm that integrates diffusion models and Gaussian Process Regression (GPR) to represent the policy. GPR guides diffusion models to generate actions that maximize learned Q-function, resembling the policy improvement in RL. Furthermore, the kernel-based nature of GPR enhances the policy’s exploration efficiency under distribution shifts at test time, increasing the chance of discovering new behaviors and mitigating overfitting. Simulation results on the Walker2d benchmark show that our approach outperforms state-of-the-art algorithms under distribution shift condition by achieving around 67.74% to 123.18% improvement in the RL’s objective function while maintaining comparable performance under normal conditions.

University of Manchester (GB), University of Sheffield (GB)
Openalex Percentile: Top 9%
Gaussian Processes and Bayesian Inference
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy — Esa Apriaskar, Lyudmila Mihaylova, et al. · (2025) | TGRS Research Map | TGRS