Off-Policy Maximum Entropy RL with Visitation Measures
reinforcement learning;maximum entropy RL;exploration
Yes
No ethics review needed.
The experiments are all effectively tabular. Is this necessary under this method to compute the objective? Can you be more clear what you mean by “the intrinsic reward equation (3) can be estimated by Monte-Carlo”? Do you need access to a generative simulator of the environment during training? If this method was applied to more complicated domains, how would it differ from for example “Behavior From the Void” (Liu, Abbeel)?

Can you clearly state the central contribution/thesis of this work, framed with respect to prior work? I had trouble understanding what the main point was, compared with parts that were in support of the main point. You cite “Marginalized State  Distribution Entropy Regularization in Policy Optimization,” which uses a similar measure of entropy – what is the essential difference between that paper and yours?

Can you clarify whether $q*$ refers to the optimal policy’s distribution in Theorem 1? If so, that should be explicit.
Maximum entropy RL is an important subject, and off-policy extensions can drastically improve sample efficiency. Using varying samples from N-step returns is an interesting and sensible idea. The two proofs in the appendix seem rigorous and correct. It’s possible that focusing on state-and-action entropy is an important direction for improving exploration, though the experimental results don't rigorously investigate this.
This paper proposes an exploration method using maximum-entropy RL in the off-policy setting. It describes the MaxEntRL framework in terms of an arbitrary feature-space, unifying state-entropy and action-entropy methods. It describes a way to compute entropy using an N-step bootstrapping operator. The main claim of the paper seems to be the novelty of unifying state-entropy and action-entropy, though I am not positive my interpretation is correct.
To me, the thesis of this submission is somewhat confused, and the empirical evidence undirected towards proving it. What is the core contribution exactly? Is it the N-step sampling for learning an estimator? If so, there should be experiments highlighting its effectiveness, and showing it's benefits over other approaches.  Is it the “off-policy” part? If so, that setting needs to be more clearly defined and explained. Is it the focus on S *and* A entropy rather than prior methods doing either S *o*r A? If this is the main contribution, the paper/experiments should be written to reflect that (e.g. with comparisons to only-state entropy methods). Is it a theoretical contribution of introducing the "S and A as z" framework?

Generally, I think this paper did not do an effective job of positioning itself with respect to prior work. I think the sentence “it results in the first off-policy algorithm with state and action spaces exploration” is either very incorrect or requires much more context to show it’s true. I would argue that most bonus-based exploration satisfies this requirement. For example, pseudocount-based methods at least in theory operate on (S x A), and model-prediction error definitely does. As another example, “Behavior From the Void” (Liu, Abbeel) is an off-policy state-entropy method, isn’t it?

Related, the sentence in the introduction that begins “Optimizing jointly the reward function of the MDP…” is not correct – that’s usually called bonus-based exploration. MaxEntRL can be framed as a subset of BBE, but is not its entirety.

The experimental results in this paper would be made much stronger by including relevant comparisons, such as other exploration or MaxEntRL methods. Additionally, the environments are quite simple and as such don’t convincingly demonstrate this method’s efficacy. Just comparing to vanilla SAC does not seem sufficient to me. As a small comment, the plots should have labels for the x and y axes.

Am I correct that this method is off-policy in the sense that it uses importance sampling to correct for policy-discrepancy? This is much weaker in my mind than off-policy in the Q-learning sense (only requires a dataset of transitions). Is importance sampling the central difference between this and on-policy MaxEntRL methods?

The use of $q^*$ in Equation 3 is confusing or possibly inconsistent. In Eq 3 it is just some arbitrary distribution. But then, as far as I can tell, Theorem 1 makes it seem like the distribution generated by the optimal policy. Unless it’s following established notation, using the $*$ superscript for an arbitrary (non-optimal) distribution is quite confusing.

In Equation 7, $Q^\pi(s,a)$ is undefined. Usually I wouldn’t complain because we all know what it means in standard RL, but here I’m actually unclear whether you’re talking about extrinsic discounted returns or intrinsic+extrinsic.
Yes
No ethics review needed.
Refer to the box above.
- The paper introduces a general framework for MaxEnt RL encompassing all of the previous literature;
- The paper proposes an intrinsic reward that incentives entropy over states beyond the action entropy, which can benefit exploration in sparse-reward tasks especially;
- The paper makes an effort to motivate the resulting intrinsic reward through a theoretical result.
The paper proposes a new intrinsic reward for exploration in RL, which combines the commonly used action entropy and another entropy term on the states visitation. Implementing this intrinsic reward requires to model the state visitation, here obtained through a TD-like methodology in a discounted setting. The intrinsic reward can be incorporated into any discounted RL algorithm, e.g., SAC, for improved exploration on the state space. The resulting method is evaluated against vanilla SAC on some sparse-rewards environment from MiniGrid.
- The paper seems to be built on the misconception that entropy over states has not been thoroughly explored already, as it only mentions three related work on that stream. While the proposed method looks at least partially departing from previous works, this casts some clouds over the novelty of the contribution;
- The main theoretical result in Th. 1 is mostly implied by previous results, while the link with the resulting algorithm fades with the layers of approximations required by the practical implementation;
- The empirical analysis looks weak for an essentially methodological contribution. It only considers MiniGrid with discrete action space and not continuous control as much of the prior works. Moreover, the reported statistics are also non-standard and leaves the significance of the improvement unclear.

Given these concerns, which I further expand in the comments below, I am inclined to a negative evaluation of the paper. However, some of the technical solutions look interesting and putting the spotlight on what is new w.r.t. prior work may go a long way in making this paper a more substantial contribution to the field.

**COMMENTS**

1) Prior Work on State Entropy.

The paper mentions a few works on the maximization of the entropy of the visited states (Lee et al, Guo et al, Islam et al) but seems to neglect a large body of literature on this problem. The problem of the state entropy maximization has been first introduced by Hazan et al (2019) and then studied in a series of subsequent works (below). Notably, the works by Mutti et al (2021), Liu and Abbeel (2021), Seo et al (2021), Yarats et al (2021) also introduce an intrinsic reward derived from kNN entropy estimators that avoid to perform a costly density estimation. Even though the setting of this work may not perfectly match the discounted setting of this paper, I believe they shall be mentioned and discuss at grater length. I provide a (partial) list of the work in this stream below:
- Hazan et al., Provably efficient maximum entropy exploration, 2019;
- Mutti and Restelli, An intrinsically-motivated approach for learning highly exploring and fast mixing policies, 2020;
- Zhang et al., Exploration by maximizing Rényi entropy for reward-free rl framework, 2021;
- Mutti et al., Task-agnostic exploration via policy gradient of a non-parametric state entropy estimate, 2021;
- Liu and Abbeel, Behaviour from the void: Unsupervised active pre-training, 2021;
- Liu and Abbeel, Aps: Active pretraining with successor features, 2021;
- Seo et al., State entropy maximization with random encoders for efficient exploration, 2021;
- Yarats et al., Reinforcement learning with prototypical representations, 2021;
- Mutti et al., Unsupervised reinforcement learning in multiple environments, 2022;
- Mutti et al., The importance of non-Markovianity in maximum state entropy exploration, 2022;
- Nedergaard and Cook, k-means maximum entropy exploration, 2022;
- Mutti, Unsupervised reinforcement learning via state entropy maximization, 2023; 
- Yang & Spaan, CEM: Constrained entropy maximization for task-agnostic safe exploration, 2023; 
- Zisselman et al., Explore to generalize in zero-shot rl, 2023;
- Tiapkin, Fast rates for maximum entropy exploration, 2023;
- Jain et al., Maximum state entropy exploration using predecessor and successor representations, 2023;
- Kim et al., Accelerating reinforcement learning with value-conditional state entropy exploration, 203;
- Zamboni et al., How to explore with belief: State entropy maximization in pomdps, 2024;
- Zamboni et al., The limits of pure exploration in POMDPs: When the observation entropy is enough, 2024.

2) Novelty.

The previous comment also open some questions on the novelty of the presented intrinsic reward. In fairness, most of the previous works they are unsupervised (do not consider the presence of an external reward) and in the finite-horizon setting. However, extending them to discounted settings looks mostly doable and there are some papers studying the combination of external and intrinsic rewards (e.g., Seo et al. 2021). Especially, the claim for which this paper introduces the "first off-policy algorithm with state and action spaces exploration" seems a little overblown. RE3 also does that as it can be implemented with a SAC backbone. However, important implementation details between the two may make a huge difference

The main novelty seems to lie into the choice of a discounted visitation measure (instead of finite horizon) and an incentive for the entropy of future states (instead of all the states into the replay buffer). I believe the paper shall focus on those novel aspects and analyse how they contribute to improved performance.

Several time the method by Janner et al is mentioned in the paper, without an explicit comparison. Can the authors thoroughly compare their method with that of Janner et al?

3) Theoretical Ground for the Intrinsic Reward.

Result of Th. 1 looks a little bit trivial: It is basically saying that the error can be bounded with the infinity norm of the occupancy, which is well known (see Kakade and Langford, "Approximately optimal approximate reinforcement learning", 2002, and Pirotta et al., "Safe policy iteration", 2013). In practice, the problem would be to set a target $q^*$ that stays close to the occupancy of the optimal policy, which is non-trivial without prior knowledge.

Whereas the paper makes an effort to ground the method theoretically. However, going from the ideal method to the implemented version requires a series of changes and approximations that seems to diminish considerably the link with the theory.

4) Experiments.

The experiments are conducted with a quite severe discount (0.95 and 0.9 instead of the most common 0.99). However, it is unclear whether the sampling fo the trajectories is also discounted, or it merely considers chopped trajectories at a fixed step.

Figure 1: As mentioned above, other papers tried to maximize the entropy of the state distribution, why not comparing to them?

Figure 3: The choice of evaluation with the median, the min and max values is quite odd and a departure from common practices (Agarwalet al., "Deep RL at the edge of the statistical precipice", 2021). Moreover, even if the improvement over SAC turns out to be statistically significant, it warrants a comparison with other methods already trying to maximize the entropy of the states together with the entropy of the actions (e.g, RE3?) 

5) Minor and Typos

In Theorem 2, the $\overline{L}_n$-norm does not seem to have been formally introduced? How is it defined? In the next line also $\mathcal{T}^N$ appears, which is likely a typo for $(\mathcal{T}^\pi)^N$?
Yes
No ethics review needed.
I've already outlined my questions in the 'weaknesses' section above. In particular:
1)  how does the proposed method compare to prior works, both intuitively and empirically?
2) What conclusions can we draw from the suboptimality gap in Theorem 1?
The paper's topic is interesting and significant: entropy maximization is a promising direction for improving exploration, which can often be a bottleneck in RL. The paper nicely combines both theory and application. Moreover, the proposed method can easily be incorporated into existing methods, which makes it easier to apply in practice.
In this paper, the authors propose a new framework for MaxEnt RL based on conditional state-action visitation distributions $d^{\pi,\gamma}(s',a'|s,a)$ (in contrast to non-conditional and/or state-based methods). Theoretically, the authors provide a suboptimality bound for using this framework and prove that a unique optimal policy exists by reframing the method using Bellman operators. Empirically, the authors show their method achieves good coverage on a number of benchmarks.
Next, the authors show how their method can be incorporated in off-the-shelf RL algorithms to provide online of off-line policy improvements. Empirically, they show this improves the performance of SAC on the same benchmarks.
In my opinion, this paper suffers from three main weaknesses:

**1: The comparison to prior works is lacking.** The main contribution of this paper is the introduction and analysis of a framework that uses conditional state-action visitation distributions $d^{\pi,\gamma}(s',a'|s,a)$. However, no intuition is given as to why this is the right choice. Moreover, the authors do not cite or compare to [1], which uses the (very similar) non-conditional state-action visitation $d^{\pi,\gamma}(s',a')$ instead. A more in-depth discussion of the pros and cons of the proposed method, as well as a more thorough explanation of existing work, is required.

**2: The empirical evaluation is limited.** In the experiments, the proposed method is only compared to SAC. However, SAC uses entropy regularization for its actions, not the states it reaches, and thus, it is unsurprising that it performs worse on the chosen benchmarks. No comparison is made to other methods that use state visitation distributions. Without such a comparison, I find it hard to judge whether the proposed method improves prior works. Moreover, the experiments do not give any information on the additional computational cost of the method: these should be mentioned.

**3: The proven suboptimality gap (Theorem 1) is confusing.** In the theoretical analysis, the authors show a bound for the sub-optimality of a policy based on the conditional state-action distribution. However, the implications of this bound are poorly explained. As far as I understand, the gap cannot practically be computed since it depends on the (unknown) visitation distribution of an optimal policy. Furthermore, the choice of $q^*$ is arbitrary: since the proof uses a triangle inequality (in equation 17, Appendix A), $q^*$ could be replaced by any function to give a valid bound, and there is no reason to assume $q^*$ would yield a tighter bound than any other function. Lastly, a policy that optimizes this bound does not necessarily perform better than one that does not, so we cannot use it for policy improvement. Thus, I don't understand why the bound is provided: it should either be removed, or the implications should be explained more clearly.

[1] : Zhang et. al., Exploration by Maximizing Renyi Entropy for Reward-Free RL Framework. AAAI, 2021.
Yes
No ethics review needed.
The authors may address any of the weaknesses discussed above.
The paper addresses a very relevant topic for the RL comminity. There are many works in maximum-entropy RL and it is true that, unlike this work, most papers focus on maximizing the entropy of the immediate actions. Maximizing the visitation frequency is a recent algoritmic addition, which deserves further study.

The proposed method is relatively easy to implement. In particular, eq (12) appears to be a practical approximation of the objective that was originally considered for the discounted occupancy measure.
The paper is quite easy to follow and presentation quality is good.

The authors claim that the source code of the algorithm will be made public after acceptance.
The authors propose a maximum entropy RL algorithm whose optimization objective is composed of from two reward components. One is the classic reward function and the other is an intrinsic reward, added for improving exploration. This second term is inversely proportional to the divergence with respect to some high-entropy distribution, such as the uniform. Specifically, the authors propose to minimize the discounted occupancy measure of the policy towards this target distribution. Since the discounted occupancy measure is unknwon, an approximation of this distribution is also optimized durig the main loop. They develop an adaptation of Soft Actor Critic (SAC) for a surrogate of their objective function and they conducted some validation experiments in discrete domains.
I believe that the two theorems are not strong enough to support some important claims of from the paper.
1. [Theorem 1] In the abstract, the authors say that maximizing the intrinsic rewards is related to minimizing an approximation of the suboptimality gap, thus, suggesting that a suboptimality theorem proves the correctness of the proposed intrinsic rewards. However, by looking at the proof Theorem 1, we can see that the statement mostly comes from an algebraic manipulation of the terms, and the same inequality would also hold for any couple of policies $\pi$, $\pi^*$, and for any third term $q^*$. Therefore, this does not confirm the correctness of the intrinsic rewards, as previously implied in the paper. Lastly, regarding the tightness of the result, we can see that arbitrary small differences near 0 probability become maximally wide suboptimality gaps, making the inequality trivially satisfied for common policies.
2. [Theorem 2] Theorem 2 also lack specificity with respect to the proposed algorithm. Indeed, it only proves that the Bellman update for the discounted occupancy measure is contractive, which I would regard as a widely known fact. This is due to the tight relationship between each component of unnormalized occupancy measure and the value function with respect to a positive reward in each state component.

Regarding the experimental evaluation:

3. [Experiments] The experiments test the proposed algorithm against one baseline, SAC, in a few gridworld environments. From my experience, in such small environments, I would also expect SAC to converge, even if at a slower rate than the competitor. Instead this is not the case, and in some environments, SAC does not sample the goal even once. Unfortunately, I cannot exclude that other factors may have prevented SAC from a more natural convergence. For example, has $\alpha$ been tuned in the version of the algorithm that does not use $\lambda$? The limited set of environments and algorithms considered is also a limitation of the experimental evaluation.

Minor:
- The role of the function $g()$ is unclear. In the text, the authors say that this can be an "arbitrary distribution over the state". However, different functions, such as deterministic one, would dramatically alter the objectives.
- $\pi^*$ in Theorem 1 has not been defined. This might be misunderstood among: the optimum with respect to the original rewards, the intrinsic rewards, or the combined rewards.
- The norm appearing in Theorem 2 has not been defined.
A maximum entropy reinforcement learning framework is proposed, using intrinsic rewards based on the relative entropy of the distribution of future state-action pairs, resulting in high-performing control policies and efficient off-policy learning.
@inproceedings{
anonymous2024offpolicy,
title={Off-Policy Maximum Entropy {RL} with Visitation Measures},
author={Anonymous},
booktitle={Submitted to The Thirteenth International Conference on Learning Representations},
year={2024},
url={https://openreview.net/forum?id=L34BvDTwls},
note={under review}
}
We introduce a new maximum entropy reinforcement learning framework based on the distribution of states and actions visited by a policy. More precisely, an intrinsic reward function is added to the reward function of the Markov decision process that shall be controlled. For each state and action, this intrinsic reward is the relative entropy of the discounted distribution of states and actions (or features from these states and actions) during the next time steps. We prove that this distribution is the fixed point of a contractive operator. Furthermore, the problem of maximizing the expected discounted sum of these intrinsic rewards is proven to be an approximation of the minimization of an upper bound on the suboptimality gap of the state-action value function of the policy. We finally describe how existing algorithms can integrate these intrinsic rewards to enhance exploration and introduce a practical algorithm for learning this fixed point off-policy, using state-action transitions, relying on N-step bootstrapping of the operator. Empirically, this maximum entropy reinforcement learning framework provides exploration policies with good coverage of the state-action space, and high-performing control policies, which both can be computed off-policy.
I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
reinforcement learning maximum entropy RL exploration
I certify that there is no acknowledgement section in this submission for double blind review.
/pdf/2ef6aba0ac075d22c76b7e5b9879f6aecd841fea.pdf
reinforcement learning
I understand the reciprocal reviewing requirement as described on https://iclr.cc/Conferences/2025/CallForPapers. If none of the authors are registered as a reviewer, it may result in a desk rejection at the discretion of the program chairs. To request an exception, please complete this form at https://forms.gle/Huojr6VjkFxiQsUp6.
I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
Off-Policy Maximum Entropy RL with Visitation Measures
ICLR 2025 Conference Submission
ICLR.cc/2025/Conference/Submission