AI RESEARCH

Global Optimality for Constrained Exploration via Penalty Regularization

arXiv CS.LG

ArXi:2604.28144v1 Announce Type: new Efficient exploration is a central problem in reinforcement learning and is often formalized as maximizing the entropy of the state-action occupancy measure. While unconstrained maximum-entropy exploration is relatively well understood, real-world exploration is often constrained by safety, resource, or imitation requirements. This constrained setting is particularly challenging because entropy maximization lacks additive structure, rendering Bellman-equation-based methods inapplicable.