Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918060082855936 |
|---|---|
| author | Horprasert, Amornyos Apriaskar, Esa Liu, Xingyu Su, Lanlan Mihaylova, Lyudmila S. |
| author_facet | Horprasert, Amornyos Apriaskar, Esa Liu, Xingyu Su, Lanlan Mihaylova, Lyudmila S. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13111 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy Horprasert, Amornyos Apriaskar, Esa Liu, Xingyu Su, Lanlan Mihaylova, Lyudmila S. Machine Learning Artificial Intelligence 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. |
| title | Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2506.13111 |