AI RESEARCH

Dreaming Smoothly and Sample Efficiently with Gradient Penalized Latent Dynamics

arXiv CS.AI

ArXi:2605.23089v1 Announce Type: cross Model-based reinforcement learning improves sample efficiency by learning a world model. However, existing latent world models such as DreamerV3 do not explicitly enforce local smoothness in their learned transition dynamics, leaving a useful inductive bias for transition dynamics learning unexploited. We propose GPLD, a gradient-penalized latent dynamics regularizer for DreamerV3 that applies a row-wise Jacobian penalty to the posterior latent distribution to encourage locally smooth transition learning.