analiza aiqbench
This paper advances maximum entropy reinforcement learning by proposing intrinsic rewards based on the future discounted distribution of state-action features, offering improved convergence for exploration-only agents while maintaining comparable control performance. The authors establish theoretical bounds relating these rewards to trajectory entropy and demonstrate that the underlying distribution is a fixed point of a contraction operator, enabling off-policy estimation.
Maximum-Entropy Exploration with Future State-Action Visitation Measures
arXiv:2603.18965v2 Announce Type: replace Abstract: Maximum entropy reinforcement learning motivates agents to explore states and actions to maximize the entropy of some distribution, typically by providing additional intrinsic rewards proportional to that entropy function. In this paper, we study intrinsic rewards proportional to the entropy of the discounted distribution of state-action features visited during future time steps. This approach is motivated by two results. First, we show that the expected sum of these intrinsic rewards is a lower bound on the entropy of the discounted distribution of state-action features visited in trajectories starting from the initial states, which we relate to an alternative maximum entropy objective. Second, we show that the distribution used in the intrinsic reward definition is the fixed point of a contraction operator and can therefore be estimated off-policy. Experiments highlight that the new objective often leads to improved visitation of features within individual trajectories, in exchange for slightly reduced visitation of features in expectation over different trajectories, as suggested by the lower bound. It also leads to improved convergence speed for learning exploration-only agents. Control performance remains similar across most methods on the considered benchmarks.
Abstract:Maximum entropy reinforcement learning motivates agents to explore states and actions to maximize the entropy of some distribution, typically by providing additional intrinsic rewards proportional to that entropy function. In this paper, we study intrinsic rewards proportional to the entropy of the discounted distribution of state-action features visited during future time steps. This approach is motivated by two results. First, we show that the expected sum of these intrinsic rewards is a lower bound on the entropy of the discounted distribution of state-action features visited in trajectories starting from the initial states, which we relate to an alternative maximum entropy objective. Second, we show that the distribution used in the intrinsic reward definition is the fixed point of a contraction operator and can therefore be estimated off-policy. Experiments highlight that the new objective often leads to improved visitation of features within individual trajectories, in exchange for slightly reduced visitation of features in expectation over different trajectories, as suggested by the lower bound. It also leads to improved convergence speed for learning exploration-only agents. Control performance remains similar across most methods on the considered benchmarks.
arXiv admin note: substantial text overlap with arXiv:2412.06655
Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2603.18965 [cs.LG]
(or arXiv:2603.18965v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2603.18965 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 287 cuvinte
Subiecte conexe

NVIDIA GTC Taipei at COMPUTEX: Live Updates on What’s Next in AI
NVIDIA · 21 mai 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026

Southeast University Team Identifies Extremal Bethe Solutions for Minimal Entanglement
Quantum Zeitgeist · 15 iun. 2026

Runway’s WorldPrompt and the Engineering of Real-Time Worlds
Latent Space · 25 sept. 2026