Hypercube Policy Regularization Framework For Offline Reinforcement Learning
2024 Β· Yi Shen, Hanyan Huang
Abstract
Offline reinforcement learning has received extensive attention from scholars because it avoids the interaction between the agent and the environment by learning a policy through a static dataset. However, general reinforcement learning methods cannot get satisfactory results in offline reinforcement learning due to the out-of-distribution state actions that the dataset cannot cover during training. To solve this problem, the policy regularization method that tries to directly clone policies used in static datasets has received numerous studies due to its simplicity and effectiveness. However, policy constraint methods make the agent choose the corresponding actions in the static dataset. This type of constraint is usually over-conservative, which results in suboptimal policies, especially in low-quality static datasets. In this paper, a hypercube policy regularization framework is proposed, this method alleviates the constraints of policy constraint methods by allowing the agent to ex
Authors
(none)
Tags
Stats
Related papers
- A Behavior Regularized Implicit Policy For Offline Reinforcement Learning (2022)0.00
- Constrained Latent Action Policies For Model-based Offline Reinforcement Learning (2024)0.00
- Policy Regularization With Dataset Constraint For Offline Reinforcement Learning (2023)0.00
- Regularizing A Model-based Policy Stationary Distribution To Stabilize Offline Reinforcement Learning (2022)0.00
- Robust Offline Reinforcement Learning With Gradient Penalty And Constraint Relaxation (2022)0.00
- State-constrained Offline Reinforcement Learning (2024)0.00
- Know Your Boundaries: The Necessity Of Explicit Behavioral Cloning In Offline RL (2022)0.00
- Constrained Policy Optimization With Explicit Behavior Density For Offline Reinforcement Learning (2023)0.00