REVIEW 1 cited by
Model-based Reinforcement Learning for Parameterized Action Spaces
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We propose a novel model-based reinforcement learning algorithm -- Dynamics Learning and predictive control with Parameterized Actions (DLPA) -- for Parameterized Action Markov Decision Processes (PAMDPs). The agent learns a parameterized-action-conditioned dynamics model and plans with a modified Model Predictive Path Integral control. We theoretically quantify the difference between the generated trajectory and the optimal trajectory during planning in terms of the value they achieved through the lens of Lipschitz Continuity. Our empirical results on several standard benchmarks show that our algorithm achieves superior sample efficiency and asymptotic performance than state-of-the-art PAMDP methods.
Forward citations
Cited by 1 Pith paper
-
Learn A Flexible Exploration Model for Parameterized Action Markov Decision Processes
FLEXplore combines an L2 dynamics loss with a Wasserstein-style critic loss, FGSM reward smoothing, and a mutual-information auxiliary reward to improve sample efficiency in parameterized-action MDPs.
Discussion (0). Continue with ORCID to comment.