Maximum-Entropy Exploration with Future State-Action Visitation Measures
cs.LG, stat.ML
Submitted: 2026-03-19
Updated: 2026-10-13
Comments: arXiv admin note: substantial text overlap with arXiv:2412.06655
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: 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
Terminology
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.
Sources
- Optimal Control of Renewable Energy Communities subject to Network Peak Fees with Model Predictive Control and Reinforcement Learning Algorithms
- Behind the Myth of Exploration in Policy Gradients
- Your Policy Regularizer is Secretly an Adversary
- Large-Scale Study of Curiosity-Driven Learning
- Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Tasks
- Off-Policy Actor-Critic
- C-Learning: Learning to Achieve Goals via Recursive Classification
- Geometric Entropic Exploration
- Soft Actor-Critic Algorithms and Applications
- Marginalized State Distribution Entropy Regularization in Policy Optimization
- Generative Temporal Difference Learning for Infinite-Horizon Prediction
- Adam: A Method for Stochastic Optimization
- Efficient Exploration via State Marginal Matching
- Accelerating exploration and representation learning with offline pre-training
- Value function estimation using conditional diffusion models for control
- The Importance of Non-Markovianity in Maximum State Entropy Exploration
- Equivalence Between Policy Gradients and Soft Q-Learning
- Proximal Policy Optimization Algorithms
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks