Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xue, Zhenghai, Cai, Qingpeng, Liu, Shuchang, Zheng, Dong, Jiang, Peng, Gai, Kun, An, Bo
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2306.03552
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909116271689728
author Xue, Zhenghai
Cai, Qingpeng
Liu, Shuchang
Zheng, Dong
Jiang, Peng
Gai, Kun
An, Bo
author_facet Xue, Zhenghai
Cai, Qingpeng
Liu, Shuchang
Zheng, Dong
Jiang, Peng
Gai, Kun
An, Bo
contents In many real-world scenarios, Reinforcement Learning (RL) algorithms are trained on data with dynamics shift, i.e., with different underlying environment dynamics. A majority of current methods address such issue by training context encoders to identify environment parameters. Data with dynamics shift are separated according to their environment parameters to train the corresponding policy. However, these methods can be sample inefficient as data are used \textit{ad hoc}, and policies trained for one dynamics cannot benefit from data collected in all other environments with different dynamics. In this paper, we find that in many environments with similar structures and different dynamics, optimal policies have similar stationary state distributions. We exploit such property and learn the stationary state distribution from data with dynamics shift for efficient data reuse. Such distribution is used to regularize the policy trained in a new environment, leading to the SRPO (\textbf{S}tate \textbf{R}egularized \textbf{P}olicy \textbf{O}ptimization) algorithm. To conduct theoretical analyses, the intuition of similar environment structures is characterized by the notion of homomorphous MDPs. We then demonstrate a lower-bound performance guarantee on policies regularized by the stationary state distribution. In practice, SRPO can be an add-on module to context-based algorithms in both online and offline RL settings. Experimental results show that SRPO can make several context-based algorithms far more data efficient and significantly improve their overall performance.
format Preprint
id arxiv_https___arxiv_org_abs_2306_03552
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle State Regularized Policy Optimization on Data with Dynamics Shift
Xue, Zhenghai
Cai, Qingpeng
Liu, Shuchang
Zheng, Dong
Jiang, Peng
Gai, Kun
An, Bo
Machine Learning
Artificial Intelligence
In many real-world scenarios, Reinforcement Learning (RL) algorithms are trained on data with dynamics shift, i.e., with different underlying environment dynamics. A majority of current methods address such issue by training context encoders to identify environment parameters. Data with dynamics shift are separated according to their environment parameters to train the corresponding policy. However, these methods can be sample inefficient as data are used \textit{ad hoc}, and policies trained for one dynamics cannot benefit from data collected in all other environments with different dynamics. In this paper, we find that in many environments with similar structures and different dynamics, optimal policies have similar stationary state distributions. We exploit such property and learn the stationary state distribution from data with dynamics shift for efficient data reuse. Such distribution is used to regularize the policy trained in a new environment, leading to the SRPO (\textbf{S}tate \textbf{R}egularized \textbf{P}olicy \textbf{O}ptimization) algorithm. To conduct theoretical analyses, the intuition of similar environment structures is characterized by the notion of homomorphous MDPs. We then demonstrate a lower-bound performance guarantee on policies regularized by the stationary state distribution. In practice, SRPO can be an add-on module to context-based algorithms in both online and offline RL settings. Experimental results show that SRPO can make several context-based algorithms far more data efficient and significantly improve their overall performance.
title State Regularized Policy Optimization on Data with Dynamics Shift
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2306.03552