L EARNING V ALUE F UNCTIONS FROM U NDIRECTED S TATE - ONLY E XPERIENCE
Anonymous authors
Paper under double-blind review
A BSTRACT
This paper tackles the problem of learning value functions from undirected stateonly experience (state transitions without action labels i.e. ( s, s (cid:48) , r ) tuples).
We ﬁrst theoretically characterize the applicability of Q-learning in this setting.
We show that tabular Q-learning in discrete Markov decision processes (MDPs) learns the same value function under any arbitrary reﬁnement of the action space.
This theoretical result motivates the design of Latent Action Q-learning or LAQ, an ofﬂine RL method that can learn effective value functions from state-only experience.
Latent Action Q-learning (LAQ) learns value functions using Q-learning on discrete latent actions obtained through a latent-variable future prediction model.
We show that LAQ can recover value functions that have high correlation with value functions learned using ground truth actions.
Value functions learned using
LAQ lead to sample efﬁcient acquisition of goal-directed behavior, can be used with domain-speciﬁc low-level controllers, and facilitate transfer across embodiments.
Our experiments in 5 environments ranging from 2D grid world to 3D visual navigation in realistic environments demonstrate the beneﬁts of LAQ over simpler alternatives, imitation learning oracles, and competing methods.
I NTRODUCTION
Ofﬂine or batch reinforcement learning focuses on learning goal-directed behavior from prerecorded data of undirected experience in the form of ( s t , a t , s t +1 , r t ) quadruples.
However, in many realistic applications, action information is not naturally available ( e g. when learning from video demonstrations), or worse still, isn’t even well-deﬁned ( e.g. when learning from the experience of an agent with a different embodiment).
Motivated by such use cases, this paper studies if, and how, intelligent behavior can be derived from undirected streams of observations: ( s t , s t +1 , r t ) .
Our key conceptual insight is that while an observation-only dataset doesn’t tell us the precise action to execute, i.e. the policy π ( a | s ) ; it may still tell us which states are more likely to lead us to the goal than not, i.e. the value function V ( s ) .
For example, simply by looking at someone working in the kitchen, we can infer that approaching the microwave handle is more useful ( i.e. has higher value) for opening the microwave than to approach the buttons.
Thus, we can still make use of observationonly data, if we focused on learning value functions as opposed to directly learning goal-directed policies.
Once we have learned a good value function, it can be used to quickly acquire or infer behavior.
Using learned value functions as dense rewards can lead to quick policy learning through some small amount of interaction in the environment.
Alternatively, they could be used to directly guide the behavior of low-level controllers that may already be available for the agent (as is often the case in robotics) without any further training.
Furthermore, decoupling the learning of value functions from policy learning enables deriving behavior for agents with a different embodiment as long as the overall strategy to solve the task remains similar.
Thus, the central technical question is how to learn a good value function from undirected observation streams.
Is it even possible?
If so, under what conditions?
This paper tackles these questions from a theoretical and practical perspective.
We start out by characterizing the behavior of tabular Q-learning from Watkins (1989) under missing action labels.
We note that Q-learning with naively imputed action labels is equivalent to the TD(0) policy evaluation, which serves as a simple baseline method for deriving a value function.
However, depending on the policy that generated the data, the learned values (without any action grounding) can differ from the optimal values.
Furthermore, it is possible to construct simple environments where the behavior implied by the learned value function is also sub-optimal.
Next, we present a more optimistic result.
There are settings in which Q-learning can recover the optimal value function even in the absence of the knowledge of underlying actions.
Concretely, we prove that if we are able to obtain an action space which is a strict reﬁnement of the original action space, then Q-learning in this reﬁned action space recovers the optimal value function.
This motivates a practical algorithm for learning value functions from the given undirected observation-only experience.
We design a latent-variable future prediction model that seeks to obtain a reﬁned action space.
It operates by predicting s t +1 from s t and a discrete latent variable ˆ a from a set of actions
ˆA (Section 4.1).
Training this latent variable model assigns a discrete action ˆ a t to each ( s t , s t +1 ) tuple.
This allows us to employ Q-learning to learn good value functions (Section 4.2).
The learned value function is used to derive behavior (Section 4.3) either through some online interaction with the environment, or through the use of domain speciﬁc low-level controllers.
The use of a latent action space for Q-learning allows us to exceed the performance of methods based on policy evaluation (Edwards & Isbell, 2019), which will learn the value of the demonstration policy, not the optimal value function.
Additionally, it side-steps the problem of reconstructing highdimensional images faced by other state-only value learning methods (Edwards et al., 2020).
Other approaches for learning from state-only data rely on imitating the demonstration data, which renders them unable to improve on sub-optimal demonstration data.
See Section 7 for more discussion. Our experiments in ﬁve environments (2D grid world, 2D continuous control, Atari game Freeway, robotic manipulation, and visual navigation in realistic 3D environments) test our proposed ideas.
Our method approximates a reﬁnement of the latent space better than clustering alternatives, and in turn, learns value functions highly correlated with ground truth.
Good value functions in-turn lead to sample efﬁcient acquisition of behavior, leading to signiﬁcant improvement over learning with only environment rewards.
Our method compares well against existing methods that learn from undirected observation-only data, while being also applicable to the case of high-dimensional observation spaces in the form of RGB images.
We are also able to outperform imitation learning methods, even when these imitation learning methods have access to privileged ground-truth action information.
Furthermore, our method is able to use observation-only experience from one agent to speed up learning for another agent with a different embodiment.
Code, models, simulation environments will be released.
P RELIMINARIES
Following the notation from Sutton & Barto (2018), our Markov decision process (MDP) is speciﬁed by ( S , A , p, γ ) , where S is a state space, A is an action space, γ is the discount factor, and p ( s (cid:48) , r | s, a ) is the state/reward joint dynamics function.
It speciﬁes the probability distribution that the agent ends up in state s (cid:48) , receives a reward of r on executing action a from state s .
Ofﬂine or batch RL (Lange et al., 2012; Levine et al., 2020) studies the problem of deriving high reward behavior when only given a dataset of experience in an MDP, in the form of a collection of quadruples ( s, a, s (cid:48) , r ) .
In this paper, we tackle a harder version of this problem where instead we are only given a collection of triplets ( s, s (cid:48) , r ) , i.e. experience without information about intervening actions.
In general, this dataset could contain any quality of behavior, from optimal, to actively adversarial.
In contrast to some methods (see Section 7), we will not assume that demonstrations in the dataset are of high quality, and design our method to be robust to sub-optimal data.
In this paper, we will focus on methods based on Q-learning (Watkins, 1989) for tackling this problem.
Q-learning has the advantage of being off-policy , i.e. , experience from another policy (or task) can be used to learn or improve a different policy for a different task.
Q-learning seeks to learn the optimal Q-function Q ∗ ( s, a ) by iteratively updating Q ( s t , a t ) to the Bellman equation.
This process converges to the Q ∗ under mild conditions in many settings (Watkins, 1989), and gives the optimal state-value function as V ∗ ( s ) = max a Q ∗ ( s, a ) . [Figure] See Section 3.2 for
C HARACTERIZING Q- LEARNING WITHOUT T RUE A CTION L ABELS
We characterize the outcome of Q-learning in settings where we don’t have ground truth intervening actions in the ofﬂine dataset being used for Q-learning.
We ﬁrst consider the case of ignoring the action altogether, which amounts to TD(0) policy evaluation.
Next, we study if labeling ( s, s (cid:48) , r ) samples with actions from a different action space ˆA to construct a new MDP could aid learning.
More speciﬁcally, can the optimal Q-function for this new MDP, as obtained through Q-learning on samples ( s, s (cid:48) , r ) labeled with actions from ˆA , be useful in the original MDP?
We show that under the right conditions the value function learned under the altered action space ˆA is identical to the value function learned for the original MDP.
Q-learning naive action labels (single action): Without action labels, one could simply assign all transitions the same label.
In this case, Q-Learning becomes TD(0) policy evaluation.
The induced value function isn’t the optimal value function for the MDP, but rather the value according to the policy that generated the dataset.
Depending on the dataset, this could be sub-optimal.
3. O PTIMALITY OF A CTION R EFINEMENT
Assume we have a Markov Decision Process (MDP) M speciﬁed by ( S , A , p, γ ) .
Let the action space
A be composed of actions a 1 , a 2 , a 3 , ..., a n ∈ A .
We are interested in the value learned under a modiﬁed MDP, ˆ M composed of ( S , ˆA , ˆ p, γ ) .
We will show that if the actions and transitions ˆA and ˆ p are a reﬁnement of A and p , then the value function learned on ˆ M , V ˆ M is identical to the value function learned on M , V M .
We deﬁne actions and transitions in ˆ M to be a reﬁnement of those in M when, a) in each state, for every action in ˆA , there is at least one action in A which is functionally identical in the same state, and b) in each state, for each action in A is represented by at least one action in ˆA in that state. {+Deﬁnition 3.
 Given a discrete ﬁnite MDP, M speciﬁed by ( S , A , p ) and MDP, ˆ M speciﬁed by ( S , ˆA , ˆ p ) , ˆ M is a reﬁnement of M when+}
[Equation] Note that this deﬁnition of reﬁnement requires a state conditioned correspondence between action behavior.
Actions do not need to have to correspond across states.
Theorem 3.1.
Given a discrete ﬁnite MDP, ˆ M which is a reﬁnement of ˆ M (Deﬁnition 3.1) then both
MDPs induce the same optimal value function, i.e. ∀ s V ∗ ˆ M ( s ) =
V ∗ M ( s ) .
We prove this by showing that optimal policies under both MDPs induce the same value function.
Lemma 3.2.
For any policy π M on M , there exists a policy π ˆ M on ˆ M such that
V π ˆ M ˆ M ( s ) =
V π M M ( s ) , ∀ s , and for any policy π ˆ M on ˆ M there exists a policy π M on M such that
V π ˆ M ˆ M ( s ) =
V π M M ( s ) ∀ s .
For this lemma we introduce the notion of fundamental actions , which are actions which correspond to sets of actions which have the same state and reward transition distributions in a given state.
We
[Figure]
utilize the equivalence of fundamental actions between MDPs to construct a policy in the new MDP which induces the same value function as a given policy in the original MDP.
We provide proofs for Theorem 3.1 and Lemma 3.2 in Section A.1.
3. G RIDWORLD C ASE S TUDY
We validate these results in a tabular grid world setting.
In particular, we measure the error in learned value functions and the induced behavior, when conducting Q-learning with datasets with different qualities of intervening actions.
The agent needs to navigate from the top left of a 6 ×grid to the bottom right with sparse reward.
We generate data from a ﬁxed, sub-optimal policy to evaluate all methods in an ofﬂine fashion (additional details in Section A.5).
We generate 20 K episodes with this policy, and obtain value functions using Q-learning under the following 4 choices for the intervening actions: (1) Ground truth actions ( V gt ), (2) One action ( V one-act , ammounts to TD(0) policy evaluation), (3) 4 × reﬁnement of original action space ( V 4 × -gt ). We modify the data so that each sample for a particular action in the original action space is randomly mapped to one ofactions in the augmented space. (4) Obfuscated actions ( V impure-act ).
Original action with probability 0 . 5 , and a random action with probability 0 .
Figure 1 shows the learned value functions under these different action labels, and reports the MSE from the true value function, along with induced behavior.
In line with our expectations, V 4 × -gt which uses a reﬁnement of the actions is able to recover the optimal value function.
V one-act fails to recover the optimal value function, and recovers the value corresponding to the policy that generated the data.
V impure-act , under noise in action labels (non-reﬁnement) also fails to recover the optimal value function.
Furthermore, the behavior implied by V impure-act and V one-act is sub-optimal.
We also analyze the effect of the action impurity on learned values and implied behavior.
Behavior becomes increasingly inaccurate as action impurity increases.
More details in Section A.3.
L ATENT A CTION Q-L EARNING
Our analysis in Section 3 motivates the design of our approach for learning behaviors from stateonly experience.
Our proposed approach decouples learning into three steps: mining latent actions from state-only trajectories, using these latent actions for Q-learning to obtain value functions, and learning a policy to act according to the learned value function.
As per our analysis, if learned latent actions are a state-conditioned reﬁnement of the original actions, Q-learning will result in good value functions, that will lead to good behaviors. Refer to Algorithm 1 for details.
4. L ATENT A CTIONS FROM F UTURE P REDICTION
Given a dataset D of observations streams . . .
, o t , o t +1 , . .
. , the goal in this step is to learn latent actions that are a reﬁnement of the actual actions that the agent executed 2 .
We learn these latent actions through future prediction.
We train a future prediction model f θ , that maps the observation o t at time t , and a latent action ˆ a (from a set ˆA of discrete latent actions) to the observation o t +1 at time t + 1 , i.e. f θ ( o t , ˆ a ) .
f is trained to minimize a loss l between the prediction f
θ ( o t , ˆ a ) and the ground truth observation o t +1 .
ˆ a is treated as a latent variable during learning.
Consequently, f θ is trained using a form of expectation maximization (Bishop, 2006).
Each training sample ( o t , o t +1 ) is assigned to the action that leads to the lowest loss under the current forward model.
The function f θ is optimized to minimize the loss under the current latent action assignment.
More formally, the loss for each sample ( o t , o t +1 ) is: L ( o t , o t +1 ) :
=
min ˆ a ∈ ˆA l ( f θ ( o t , ˆ a ) , o t +1 ) .
We minimize (cid:80) ( o t ,o t +1 )
∈ D L ( o t , o t +1 ) over the dataset to learn f θ .
Latent action ˆ a t for observation pairs ( o t , o t +1 ) are obtained from the learned function f
θ as: arg min ˆ a ∈ ˆA l ( f θ ( o t , ˆ a ) , o t +1 ) .
Choice of the function f θ and loss l vary depending on the problem.
We use L2 loss in the observation space (low-dimensional states, or images).
4. Q- LEARNING WITH L ATENT A CTIONS
Latent actions mined from Section 4.1 allow us to complete the given ( o t , o t +1 , r t ) tuples into ( o t , ˆ a t , o t +1 , r t ) quadruples for use in Q-learning Watkins (1989).
As our actions are discrete we can easily adopt any of the existing Q-learning methods for discrete action spaces ( e.g. Mnih et al.
Though, we note that this Q-learning still needs to be done in an ofﬂine manner from prerecorded state-only experience.
While we adopt the most basic Q-learning in our experiments, more sophisticated versions that are designed for ofﬂine Q-learning ( e.g. Kumar et al.
(2020); Fujimoto et al.
(2019)) can be directly adopted, and should improve performance further.
Value functions are obtained from the Q-functions as V ( s ) =
max ˆ a ∈ ˆA Q ( s, ˆ a ) .
4. B EHAVIORS FROM V ALUE F UNCTIONS
Given a value function, our next goal is to derive behaviors from the learned value function.
In general, this requires access to the transition function of the underlying MDP.
Depending on what assumptions we make, this will be done in the following two ways.
Densiﬁed Reinforcement Learning.
Learning a value function from state-only experience can be extremely valuable when a dense reward function for the underlying task is not readily available.
In this case, using the learned value function can densify sparse reward functions, making previously intractable RL problems solvable.
Speciﬁcally, we use the value function to create a potential-based shaping function F ( s, s (cid:48) )
=
V ( s (cid:48) )
− V ( s ) , based on Ng et al. (1999), and construct an augmented reward function r (cid:48) ( s, a, s (cid:48) ) =
r ( s, a, s (cid:48) )
+ F ( s, s (cid:48) ) .
Our experiments show that using this densiﬁed reward function speeds up behavior acquisition.
Domain Speciﬁc Low-level Controllers.
In more speciﬁc scenarios, it may be possible to employ hand designed low-level controllers in conjunction with a model that can predict the next state s (cid:48) on executing any of low-level controllers.
In such a situation, behavior can directly be obtained by picking the low-level controller that conveys the agent to the state s (cid:48) that has the highest value under the learned V ( s ) .
Such a technique was used by Chang et al.
We show results in their setup.
E XPERIMENTS
We design experiments to assess the quality of value functions learned by LAQ from undirected state-only experience.
We do this in two ways.
First, we measure the extent to which value functions learned with LAQ without ground truth information agree with value functions learned with
Q-learning with ground truth action information.
This provides a direct quality measure and allows us to compare different ways of arriving at the value function: other methods in the literature (D3G (Edwards et al., 2020)), and simpler alternatives of arriving at latent actions.
Our second evaluation measures the effectiveness of LAQ-learned value functions for deriving effective behavior in different settings: when using it as a dense reward, when using it to guide low-level controllers, and when transferring behavior across embodiments.
Where possible, we compare to behavior cloning (BC) with privileged ground truth actions.
BC with ground truth actions serves as an upper bound on the performance of state-only imitation learning methods (BCO from Torabi et al.
(2018a),
ILPO from
Edwards et al.
(2019), etc. )
and allows us to indirectly compare with these methods.
Test Environments.
Our experiments are conducted in ﬁve varied environments: the grid world environment from Section 3, the Atari game Freeway from Bellemare et al.
, 3D visual navigation in realistic environments from Chang et al.
(2020); Savva et al.
(2019), and two continuous control tasks from Fu et al.
(2020)’s D4RL:
Maze2D (2D continuous control navigation), and
FrankaKitchen (dexterous manipulation in a kitchen).
For Maze2D and FrankaKitchen environments, we also consider embodiment transfer , where we seek to learn policies for an ant and a hook [Figure] [Figure]
[Table]
respectively from the observation-only experience of a point mass and the Franka arm.
Together, these environments test our approach on factors that make policy learning hard: continuous control, high-dimensional observations and control, complex real world appearance, 3D geometric reasoning, and learning across embodiments.
See visualizations in Figure 3, details in Section A.4.
Experimental Setup For each setting, we work with a pre-collected dataset of experience in the form of state, next state and reward triplets, ( o t , o t +1 , r t ) .
We use our latent-variable forward model (Section 4.1) and label triplets with latent actions to obtain quadruples ( o t , ˆ a t , o t +1 , r ) .
We perform
Q-learning on these quadruples to obtain value functions V ( s ) , which are used to acquire behaviors either through densiﬁed RL by interacting with the environment, or through use of domains-speciﬁc low-level controllers.
We use the ACME codebase (Hoffman et al., 2020) for experiments.
Latent Action Quality.
In line with the theory developed in Section 3, we want to establish how well our method learns a reﬁnement of the underlying action space.
To assess this, we study the stateconditioned purity of the partition induced by the learned latent actions.
It computes the proportion of the most frequent action of all ground truth actions mapped to a latent action (for any given state).
Overall, our method is effective at ﬁnding reﬁnement of the original action space.
It achieves higher state-conditioned purity than a single action and clustering.
In high-dimensional image observation settings, it surpasses baselines by a wide margin.
More details in Section A.6.
5. Q UALITY OF L EARNED V ALUE F UNCTIONS
We evaluate the quality of the value functions learned through LAQ.
We use as reference the value function V gt-act , obtained through ofﬂine Q-learning (DDPG for continuous action cases) with true ground truth actions i.e. ( o t , a t , o t +1 , r t ) .
3 For downstream decision making, we only care about the relative ordering of state values.
Thus, we measure the Spearman’s rank correlation coefﬁcient between the different value functions.
Table 1 reports the Spearman’s coefﬁcients of value functions obtained using different action labels: single action, clustering, latent actions (ours), and with ground truth actions.
We also report Spearman’s correlations of value functions produced using the distance between the end-effector and the microwave handle (lower better) and the angle of the microwave door (higher better) this as the value function
[Figure] D3G (Edwards et al., 2020).
In all settings we do Q over
Our method out performs all baselines in settings with high-dimensional image observations (3D
Visual Navigation, Freeway).
In state based settings, where clustering state differences is a helpful inductive bias, we see that our method is still on-par with, or superior to clustering state differences and even D3G, which predicts state differences.
5. U SING V ALUE F UNCTIONS FOR D OWNSTREAM T ASKS
Our next experiments test the utility of LAQ-learned value functions for acquiring goal-driven behavior.
We ﬁrst describe the 3 settings that we use to assess this, and then summarize our takeaways.
• Using value functions as dense reward functions .
We combine sparse task reward with the learned value function as a potential function (Section 4.3).
We scale up the sparse task rewards by a factor of 5 so that behavior is dominated by the task reward once policy starts solving the task.
Figure 4 measures the learning sample efﬁciency.
We compare to only using the sparse reward, behavior cloning (BC) with ground truth actions, and BC followed by spare reward RL.
• Using value functions to learn behavior of an agent with a different embodiment.
Decoupling the learning of value function and the policy has the advantage that learned value functions can be used to improve learning across embodiment.
We demonstrate this, we keep the same task, but change the embodiment of the agent in Maze2D and FrankaKitchen environments.
Note that we do not assume access to ground truth actions in these experiments either.
For Maze2D, the pointmass is replaced with a 8-DOF quadrupedal ant.
For FrankaKitchen, the Franka arm is replaced with a position-controlled hook.
We may need to deﬁne how we query the value function when the embodiment (and the underlying state space) changes.
For the ant in Maze2D, the location (with 0 velocity) of the ant body is used to query the value function learned with the point-mass.
For the hook in FrankaKitchen, the value function is able to transfer directly as both settings observe end-effector position and environment state.
We report results in Figure 5.
• Using value functions to guide low-level controllers.
Learned value functions also have the advantage that they can be used directly at test time to guide the behavior of low-level controllers.
We do this experiment in context of 3D visual navigation in a scan of a real building and use the branching environment from Chang et al.
We follow their setup and replace their value functions with ones learned using LAQ in their hierarchical policy, and compare the efﬁciency of behavior encoded by the different value functions.
LAQ value functions speed up downstream learning.
Learning plots in Figure 4 show that LAQlearned value functions speed up learning in the different settings over learning simply with sparse rewards (orange line vs. blue line).
In all settings except Freeway, our method not only learns more quickly than sparse reward, but converges to a higher mean performance.
LAQ discovers stronger behavior than imitation learning when faced with undirected experience.
An advantage of LAQ over other imitation-learning based methods such as BCO (Torabi et al., 2018a) and ILPO (Edwards et al., 2019) is LAQ’s ability to learn from sub-optimal or undirected experience.
To showcase this, we compare the performance of LAQ with behavior cloning (BC) with ground truth actions. Since BCO and ILPO recover ground truth actions to perform behavior [Figure] [Table]
[Figure]
[Table] [Figure] [Figure] cloning (BC), BC with ground truth actions serves as an upper bound on the performance of all methods in this class.
Learning plots in Figure 4 shows the effectiveness of LAQ over BC and BC followed by ﬁne-tuning with sparse rewards for environments where the experience is undirected (Maze2D, and GridWorld).
For Freeway, the experience is fairly goal-directed, thus BC already works well.
A similar trend can be seen in the higher Spearman’s coefﬁcient for LAQ vs. V one-act in
Table 1.
LAQ discovers stronger behavior than imitation learning when faced with undirected data.
LAQ is compatible with other advances in batch RL.
Although LAQ uses the most basic QLearning as our ofﬂine value learning method, it is compatible with recent more advanced ofﬂine
RL value-learning methods (such as CQL (Kumar et al., 2020) and BCQ (Fujimoto et al., 2019)).
We validate by simply swaping to using (discrete)
BCQ with our latent actions.
Figures. 4 andshow that LAQ with BCQ is the strongest method, outperforming ours with DQN, and D3G, on Maze2D and embodiment transfer environments.
Analysis of Spearman’s correlations in Tableshows the same trend as before with latent actions: better than single actions, and clustering variants.
Note also that use of BCQ leads to value functions with better Spearman’s correlations than DQN.
LAQ value functions allow transfer across embodiments.
Figure 5 shows learning plots of agents trained with cross-embodiment value functions.
LAQ-densiﬁed rewards functions, speed-up learning and consistently guide to higher reward solutions than sparse task rewards, or D3G.
LAQ compares favorably to D3G. We compare LAQ and D3G (a competing state-only method) in different ways.
D3G relies on generating potential future states.
This is particularly challenging for image observations, and D3G doesn’t show results with image observations.
In contrast, LAQ maps state transitions to discrete actions, and hence works with image observations as our experiments show.
Even in scenarios with low-dimensional state inputs, LAQ learns better value functions than
D3G, as evidences by Spearman’s correlations in Table 1, and learning plots in Figure 4 and Figure 5.
LAQ value functions can guide low-level controllers for zero-shot control: We report the SPL for 3D navigation using value functions combined with low-level controllers in Figure 6.
We report the efﬁciency of behavior induced by LAQ learned value functions as measured by the SPL metric from Anderson et al.
(2018) (higher is better).
The branching environment has two goal states, one optimal and one sub-optimal.
The demonstrations there-in were speciﬁcally designed to emphasize the utility of knowing the intervening actions.
Simple policy evaluation leads sub-optimal behavior (SPL of 0.53) and past work relied on using an inverse model to label actions (Chang et al., 2020) to derive better behavior.
This inverse model itself required 40 K interactions with the environment for training, and boosted the SPL to 0.95.
LAQ is able to navigate to the optimal goal (w/ SPL 0.82) but without the 40 K online interaction samples necessary to acquire the inverse model.
It also performs better than clustering transitions, doing which achieves an SPL of 0.57.
The improvement is borne out in visualizations in Figure 6.
LAQ correctly learns to go to the nearer goal, even when the underlying experience came from a policy that preferred the further away goal.
D ISCUSSION
Our theoretical characterization and experiments in ﬁve representative environments showcase the possibility and potential of deriving goal-directed signal from undirected state-only experience.
Here we discuss some scenarios which are fundamentally hard, and some avenues for future research.
Non-deterministic MDPs.
Our theoretical result relies on a reﬁnement where state-action transition probabilities are matched.
However, the latent action mining procedure in LAQ results in deterministic actions.
Thus, for non-deterministic MDPs (where executing the same action in the same state takes the agent to different next state), LAQ will be unable to achieve a strict reﬁnement, leading to sub-optimal value functions.
However, note that this limitation isn’t speciﬁc to our method, but applies to any deterministic algorithm that seeks to learn from observation only data.
We formalize this concept and provide a proof in Section A.2.
Constraining evaluation of V ( s ) to within its domain.
LAQ learns a value function V ( s ) over the set of states that were available in the experience dataset, and as such its estimates are only accurate within this set.
In situations where the experience dataset doesn’t span the entire state space, we may need to assess where the predictions of V ( s ) are valid to avoid degenerate solutions due to OOD observations.
We discuss a density based model solution we used for this problem in Section A.4.
Ofﬂine RL Validation.
Validation ( e.g. when to stop training) is a known issue in ofﬂine RL (Gulcehre et al., 2020).
Like other ofﬂine RL methods, LAQ suffers from it too.
LAQ’s use of Q-learning makes it compatible to recent advances (Kumar et al., 2021) that tackle this validation problem.
R ELATED W ORK
Our work focuses on batch (or ofﬂine) RL with state-only data using a latent-variable future prediction model.
We survey works on batch RL, state-only learning, and future prediction.
Batch Reinforcement Learning.
As the ﬁeld of reinforcement learning has matured, batch
RL (Lange et al., 2012; Levine et al., 2020) has gained attention as a component of practical systems.
A large body of work examines solutions the problem of extrapolation error in batch RL settings.
Advances in these works are complementary to our approach, as substantiated by our experiments with BCQ. A more detailed discussion of batch RL methods can be found in Section A.0. State-only Learning. Past works have explored approaches for dealing with the lack of actions in ofﬂine RL when given goal-directed or undirected state-only experience.
Works in the former category rely on high quality behavior in the data, and suffer on sub-optimal data.
Past work on stateonly learning from undirected experience relies on either domain knowledge or state reconstruction and only show results with low dimensional states.
See Section A.0 for continued discussion.
Future Prediction Models.
Past work from Oh et al.
; Agrawal et al.
Finn et al.
(2016) (among many others) has focused on building action conditioned forward models in pixel and latent spaces.
Yet other work in computer vision studies video prediction problems (Xue et al., 2016; Castrejon et al., 2019).
Given the uncertainty in future prediction, these past works have pursued variational (or latent variable) approaches to make better predictions.
Our latent variable future model is inspired from these works, but we explore its applications in a novel context.
Latent MDP Learning One way to interpret our method is that of learning an approximate MDP homomorphism (Taylor et al., 2008; Ravindran & Barto, 2004).
Other works have explored learning latent homorphic MDPs.
These methods tend to focus on learning equivalent latent state spaces (Li et al., 2006; Givan et al., 2003).
Most similarly to our work (van der Pol et al., 2020) also learns a latent action space, but relies on ground truth action data to do so.
ELATED
W
ORK C ONTINUED
Discussion continued from Section 7:
Batch Reinforcement Learning.
In recent times, Gulcehre et al.
(2020) and Fu et al.
(2020) propose datasets and experimental setups for studying ofﬂine RL problems.
A large body of work examines solutions to the batch RL problem.
Researchers have identiﬁed that extrapolation error , the phenomenon in which batch RL algorithms incorrectly estimate the value of states/actions not present in the training batch, is a major challenge, and have proposed methods to tackle it, e.g. BCQ (Fujimoto et al., 2019), BEAR (Kumar et al., 2019b), IRIS from (Mandlekar et al., 2020), and CQL (Kumar et al., 2020) among many others.
In contrast to these model-free methods, Argenson & Dulac-Arnold (2021); Rajeswaran et al.
Rafailov et al.
(2020) learn a forward predictive model from the batch data and use it for model predictive control.
These methods all approach the traditional batch RL problem, while we consider a different and harder setting in which the action labels are unavailable.
Aforementioned advances in ofﬂine RL are complementary to our work.
Ofﬂine value learning approaches (such as CQL and BCQ) can serve as a drop-in replacement for Q-learning in our pipeline and improve our results.
In fact, our experiments with BCQ substantiate this.
State-only Learning.
In line of work which studies learning form goal-directed state-only experience, researchers use imitation learning-based techniques (Radosavovic et al., 2020; Torabi et al., 2018a; Edwards et al., 2019; Kumar et al., 2019a), learn policies that match the distribution of visited states (Torabi et al., 2018b; 2019a;b), or use demonstrations to construct dense reward functions (Shao et al., 2020; Sermanet et al., 2017; Singh et al., 2019; Xie et al., 2018; Edwards & Isbell, 2019).
These methods make strong assumptions about the quality and goal-directed nature of the experience data, and suffer in performance when faced with low-quality or undirected experience.
Instead of goal-directed experience our work tackles the problem of learning from undirected experience.
Past work in this area employs Q-learning to learn optimal behavior from sub-optimal data (Chang et al., 2020; Song et al., 2020;
Edwards et al., 2020).
Chang et al.
(2020) and Song et al.
(2020) use domain speciﬁc insights.
Edwards et al.
(2020) rely on being able to generate the next state and only demonstrate results in environments with low-dimensional states.
Instead, our work maps transition tuples to discrete latent actions and can thus easily work with high-dimensional observations such as RGB images. A. P ROOFS Proof.
Proof for Lemma 3.2. We will start by showing that for any policy π ˆ M on ˆ M , there exists a policy π M on M such that V π ˆ M ˆ M ( s ) = V π M M ( s ) , for all s .
To do this we need to introduce the idea of fundamental actions , which are classes of actions which have the same state and reward transition distributions in a given state. If we have a fundamental action b , corresponding to some state and reward distributions, let α ( b, s ) ⊆ A give the set of actions in A that have the matching state and reward transition distributions, [Equation]
Similarly, let ˆ α ( b, s ) ⊆ ˆA give the set of actions in ˆA belonging to b in state s . In any given state, there are at most min ( | A | , | ˆA | ) fundamental actions for M and the union of all actions belonging to all fundamental actions gives the set of actions that make up the original action space. For our
MDP let’s denote B ( s ) as the set of fundamental actions in the state s for M , and ˆ B ( s ) as the set of fundamental actions in the state s for ˆ M . Let β ( s, a ) , and ˆ β ( s, a ) be functions which return the set of actions which correspond to the same fundamental action containing as a in state s for M , and ˆ M respectively. This means,
[Equation] With this notation out of the way we can construct a policy π ˆ M from π M , which achieves the same value in ˆ M as π M does in M . We do this by constructing π ˆ M such that the probability distributions over each fundamental action is equivalent. We deﬁne this policy as
[Equation] Following Sutton & Barto (2018) we can deﬁne the value function for a given policy as [Equation] From the properties in Eq.
[Equation]
we know a sum over fundamental actions will count each action exactly once
[Equation]
so we can write this sum as
[Equation] substituting in the constructed policy we have [Equation] since the third sum is over ˆ β ( s, a ) with a ∈ α ( b, s ) , we can rewrite this sum as over ˆ a ∈ ˆ α ( b, s ) , giving
[Equation]
For the ﬁnal sum, from the deﬁnition of fundamental actions, we know p ( s (cid:48) , r | s, a ) =
p ( s (cid:48)
[Equation]
r | s, α
[Equation]
b, s
[Equation]
, r | s, ˆ α
[Equation]
b
[Equation]
s )
[Equation]
) , so we can rewrite that term as
[Equation]
Crucially, in the second sum (over a ∈ α ( b, s ) ), β ( s, a ) is the same for all a ∈ α ( b, s ) , so the term in brackets can be treated as a constant.
Similarly, since | B ( s, a ) | = | α ( b, s ) | we can simplify the second sum leaving
[Equation]
This gives the deﬁnition of V π ˆ M ˆ M ( s ) using the same decomposition as equation Eq. 2, meaning
[Equation]
One can show the opposite direction, that a policy there exists a policy π M (cid:48) for any policy π M such
V π M M ( s ) =
V π ˆ M ˆ M ( s ) , with a symmetric construction.
Note that Lemma 3.2 holds true regardless of the stochasticity of the policy, as the constructed policy matches probability of the original policy for taking each fundamental action.
Proof for Theorem 3.1. Under the new MDP ˆ M , Q-learning will learn the same optimal value function value function as learned under MDP M , i.e. ∀ s V ∗ ˆ M ( s ) = V ∗ M ( s ) .
Proof.
This follows from Lemma 3.2 by contradiction.
Assume there is a state s (cid:48) where V ∗ ˆ M ( s ) (cid:54) =
V ∗ M ( s ) .
Two cases must be considered.
In the ﬁrst case, V ∗ ˆ M ( s ) > V ∗ M ( s ) .
We will notate the optimal policy in ˆ M as ˜ π ∗ ˆ M ( i.e. V ∗ ˆ M = V ˜ π ∗ ˆ M ˆ M ) and the optimal policy in M as π ∗ M .
We know there must exist a policy ˜ π ∗ M such that V ˜
π ∗ M M ( s ) =
V ˜
π ∗ ˆ M ˆ M ( s ) from Lemma 3.2.
We arrive at a contradiction because
V ˜
π ∗ M M ( s ) >
V π ∗ M M ( s ) , so π ∗ M could not have been the optimal policy on M .
The other direction follows a symmetric argument.
If V ˜ π ∗ ˆ M ˆ M ( s ) < V π ∗ M M ( s ) , we know there must be a policy π ∗ ˆ M in ˆ M such that V π ∗ M M ( s ) =
V π ∗ ˆ M ˆ M ( s ) .
This implies V π ∗ ˆ M ˆ M ( s ) >
V ˜ π ∗ ˆ M ˆ M ( s ) , meaning that ˜ π ∗
ˆ M could not have been the optimal policy.
Since Q-learning is known to converge to the optimal value function
Watkins (1989), Q-learning on ˆ M will converge to the original value function V ∗ M .
A. S TATE O NLY L EARNING F ROM S TOCHASTIC MDP S
Here we will brieﬂy prove that problem of deducing the optimal value function of an MDP M , from some state-only experience dataset D , cannot be solved in general for non-deterministic MDPs.
We notate D as the space of all complete state-only datasets, and V as the space of all value functions.
By complete state-only dataset, we mean datasets in which all possible transition triples ( s, s (cid:48) , r ) appear.
Note that exactly one complete dataset exists for each MDP.
We denote D M as the complete dataset corresponding to an MDM M .
In short, the idea is to construct a single state-only dataset which ambiguously could have been produced from two different MDPs which have different optimal value functions.
Since no function deterministic function can model two outputs from the same input, no such function can exist.
Theorem A.1.
For any function f : D → V which maps from the set of of state-only datasets, D , to a set of value functions.
There exists some MDP M , with corresponding dataset D M such that f ( D ) (cid:54) =
V ∗ M .
[Equation]
Proof.
We proceed by contradiction, assume any f : D → V such that
[Equation]
If we can construct M 1 and M 2 such that V ∗ M 1 (cid:54) =
V ∗ 2 , and D such that D
= D M 1 = D M 2 , then f cannot produce the correct value function for f ( D ) in all cases, from the deﬁnition of a function.
We will now show a very simple construction which exhibits this property.
Consider an MDP M 1 , with 3 states, s 1 , s 2 , s t , and 2 actions a 1 , a 2 .
s t is terminal, and gives reward 1, other states give reward 0 .
The transition dynamics of the two actions are given below.
[Table]
s
[Table]
s
[Table] [Table]
For simplicity, assume M 1 has a discount factor of 0 .
This means V ∗ ( s 1 ) =
V ∗ ( s 2 ) = 1 .
We deﬁne M 2 as identical to M 1 , only with stochastic transitions.
[Table] [Table]
[Table]
In this MDP, with a discount factor of 0.9, V ∗ ( s 2 ) = 1 , but V ∗ ( s 1 ) = 0 .
1 + 0 .
9 ∗ 0 .
9 = 0 .
Since both M 1 and M 2 share the same states, actions, and possible transitions, D M 1 = D M 2 .
So we have satisﬁed our condition that D
= D M 1 = D M 2 , and V ∗ M 1 (cid:54)
=
V ∗ M 2 .
Thus, no f can model the value functions for both MDPs in general.
[Figure]
RID W ORLD B EHAVIOR vs. P URITY
Figure S7 plots the MSE in value function and the proportion of states with correct implied actions as a function of the noise in the action labels.
[Figure]
A. E NVIRONMENT D ETAILS
2D Grid World.
We use the environment and data from Section 3.2.
We use the ( x, y ) coordinates as our state for this environment.
We use a multi-layer perceptron for f θ and L2 loss for l .
2D Continuous Control Navigation.
We use the Maze2D data from D4RL Fu et al.
Observation space here is ( x, y, v x , v y ) i.e. location and velocity of the agent, and action space is force along x and y directions.
We use a frame skip of 3.
We use a multi-layer perceptron for f θ and
L2 loss for l .
In the embodiment transfer variant, we swap the agent for a 4-legged ant, also from
D4RL.
The ant embodiment is far more challenging to control, with an 8-d action space and 29-d observation space.
Atari Game.
We work with Freeway.
We generated our own data using the protocol described in Agarwal et al.
We turned off sticky actions and store frames both at the default resolution ( 84 × 84 ) and full resolution ( 224 × 224 ).
Other settings are same as is typical: stack last 4 frames to represent the observations, and use frame-skip of 4.
We use a convolutional encoder-decoder model for f θ and predict raw future observations.
We use L2 distance in the pixel space as our loss function l .
3D Visual Navigation.
We work with the branching environment from Chang et al.
(2020) in the AI
Habitat Simulator Savva et al.
and use the provided dataset of ﬁrst-person trajectories as our pre-recorded experience dataset.
Following Chang et al.
(2020), we employ low-level controllers for deriving behaviors from the learned value functions.
We use a convolutional encoder-decoder for f θ , and L2 loss in pixel space as l .
Kitchen Manipulation.
In this task a 9-DOF Franka arm can interact with several different objects physically simulated kitchen.
The observations are 24-d, containing the end-effector position and state of various objects in the environment (microwave door angle, kettle position, etc.).
The action space represents the 9-d joint velocity.
In cross-embodiment experiments we replace the Franka arm with a hook.
The observation space remains the same while the action space becomes 3-d position control.
For experiments in kitchen manipulation, we add an additional component to the reward computation to incentivize behavior to remain within the region of the state space covered by the demonstrations (where the learned value function is in-distribution).
To do this, we build a density model over the end effector position using a 2 component Gaussian mixture model.
If a state s has a less than 1% probability according to the GMM density model, then we assign V ( s ) = 0 , for the update described in Section 5.2.
We apply this shaping to both ours and D3G in Figure 4.
We give sparse reward the same beneﬁt of this shaping by giving reward − 1 outside of the GMM distribution, and 0 inside.
Sparse task reward remains the same.
For all environments, we throw out the provided action labels when learning our models.
A. D ATA C OLLECTION
2D Grid World.
The setting for this experiment is a 6 × 6 grid with 8 actions, corresponding to moving in the 4 cardinal directions and 4 diagonal directions.
The agent starts in the top left (0,0), and gets reward 0 everywhere, except for in the bottom right, (5,5).
Reaching the bottom right gives the agent reward 1 and terminates the episode.
In the starting square (0,0), the agent has probability 0.5 of moving right, and probability 0.5 of moving down.
When the agent is on the top or bottom edge of the maze (row = 0 or row = 5) it moves right with probability 0.9, and takes a random action with probability 0.1.
When it is on the left or right edge of the grid (column = 0 or column = 5), it moves down with probability 0.9 and takes a random action with probability 0.1.
Otherwise, it is in the interior of the grid, where it takes an action away from the goal (randomly chosen from: up, left, or up-left) with probability 0.9, and one of the remaining actions otherwise (randomly chosen from: down, right, down-right, up-right, down-left).
This policy is rolled out for 20,000 policies to generate the data for methods described in main paper Section 3.2 and Figure 1.
Atari Game.
Data for the Freeway environment had to be additionally collected, as native high resolution resolution images of the episodes from Agarwal et al.
(2020) are not readily available.
For this, we re-generated the data using the protocal described in Agarwal et al.
(2020), without sticky actions.
Then, the high resolution data was collected by taking the action sequences from the re-generated dataset and executing them in an emulator, while storing the native resolution images.
Because we re-generated the data without sticky actions, the high resolution episodes are perfect recreations of the low resolution episodes.
Visual Navigation.
The data used for the visual navigation experiment was generated using the same protocol as Chang et al.
Agents are tasked to reach one of two goals ( G near and G far ) in a visually realistic simulator Savva et al.
Navigating to G near is the optimal path as it is nearer to the agent’s starting location.
The dataset contains 3 types of trajectories, T 1 , T 2 , and T 3 , representing 50%, 49.5%, and 0.5% of the trajectories in the dataset respectively .
T 1 takes a sub-optimal path to G near , T 3 takes the optimal path to G near , and T 2 navigates to G far .
2D Continuous Control (Maze2D)
We use the Maze2D dataset from D4RL as is.
Kitchen Manipulation.
The data used for the Kitchen Manipulation environment comes from the partial version of the D4RL FrankaKitchen dataset.
To facilitate cross-embodiment transfer we convert the state representation to contain end-effector location instead of joint angles.
A. L ATENT A CTION Q UALITY
We ﬁrst measure the effectiveness of our latent action mining process by judging the extent to which the induced latent actions are a reﬁnement of the original actions.
We measure this using the stateconditioned purity of the partition induced by the learned latent actions.
In a given state, for any latent action ˆ a , there must be some ground truth action which most frequently mapped to ˆ a .
We deﬁne the purity of ˆ a as the proportion of the most frequent action among all actions mapped to ˆ a .
For example, in a given state s if a set of actions [0 , 0 , 0 , 1 , 2] , were mapped to latent action ˆ a , then 0 is the most frequent action mapped to ˆ a and thus the purity of ˆ a would be 0 .
For a given state, the purity of an entire set of latent actions is the weighted mean of purity of individual latent actions.
Overall purity is the average of all state wise purities weighted by how often the states appear in the dataset.
We extend this deﬁnition of state-conditioned purity to continuous or high-dimensional states by measuring the validation accuracy of a function g that is trained to map the high-dimensional state (or observation) s , and the associated latent action ˆ a to the actual ground truth action a .
Training such a function induces an implicit partition of the state space.
Learning to predict the ground truth action from the latent action ˆ a within this induced partition estimates the most frequent ground truth action, and accuracy measures its proportion, i.e. purity.
This exact procedure reduces to the above deﬁnition for discrete state spaces, but also handles continuous and high-dimensional states well.
For continuous action spaces, we measure the mean squared error in action prediction instead of classiﬁcation accuracy.
Table S3 reports the purity (and MSE for continuous action environment) obtained by our proposed future prediction method.
For reference, we also report the purity obtained when using single action that maps all samples into a single cluster, and 2 clustering methods that cluster either concatenation of the two observations i.e. [ o t +1 ; o t ] , or the difference between the two observations i.e. [ o t +1 − o t ] .
We use 8 latent actions for all environments except the FrankaKitchen environment for which we use 64 because of its richer underlying action space.
In general, our forward models are effective at generating a latent action space that is a stateconditioned reﬁnement of the original action space.
This is indicated by the improvement in stateconditioned purity values over using a single action or naive clustering.
For the 2D Grid World and 2D Continuous Navigation, clustering in the correct space (state difference vs. state concatenation) works well as expected.
But our future prediction model, which directly predicts s t +1 and doesn’t use any domain speciﬁc choices, is able to outperform the corresponding clustering method.
We also observe large improvements over all baselines for the challenging case of environments with high-dimensional state representations: Freeway and 3D Visual Navigation.
[Table]
A. A NALYSIS OF L EARNED L ATENT A CTIONS
We analyze the latent actions learned for the Freeway environment.
We visualize our future prediction model’s predictions for the Freeway environment in Figure S8.
In line with our expectations, the one action future prediction model and the latent action future prediction model are both able to reconstruct the background and the vehicles perfectly.
At the same time, the one action future prediction model fails to reconstruct the agent accurately, whereas the latent action future prediction model is able to reconstruct the agent almost perfectly.
This provides evidence for the effectiveness of our proposed latent action mining approach at discovering pure action groundings.
[Figure] [Figure]
C h a n g e i n
A g e n t y - po s i t i o n
R e l a t i v e t
o P r e v i o u s F r a m e
Furthermore, we visualize the learned latent actions for Freeway in Figure S9.
In Freeway, the agent can only move along the yaxis, and consequently, the environment action space only has three actions: move up, move down, and no-op.
This means that the agent’s y-displacement between the current frame and the previous frame directly corresponds to the ground truth action taken.
In this visualization, we visualize the the chosen latent action (by color: blue, orange, or green) as a function of the agent’s y-position in the current frame (xaxis) and the y-displacement relative to the previous frame (y-axis).
Note that as mentioned in the paper, we learn the value functions over the top three most dominant actions to stabilize training; for this reason, the visualization only consists of three latent actions.
Within each vertical region marked by the red bars, we see that the latent actions are split into distinct clusters based on the agent’s y-displacement.
Because the agent’s y-displacement directly corresponds to the ground truth action taken, this indicates that given the agent’s y-position, the learned latent actions encode information about the ground truth action.
Hence, we qualitatively conﬁrm that the state-based purity of the latent actions is high.
A. V ALUE F UNCTION D ETAILS
Value Function Model Selection
The numbers reported in Table 1 are the 95 th percentile Spearman’s correlation coefﬁcients over the course of training.
If training is stable and converges, this corresponds to taking the ﬁnal value, and in the case that training is not stable and diverges, this acts as a form of early stopping.
We take the 95 th percentile as opposed to the maximum to eliminate outliers.
Below we present visualizations of value functions learned from LAQ.
Freeway.
We visualize the value functions learned using our latent actions for Freeway.
Figure S plots the values over the course of an episode.
In Freeway, the agent has to move vertically up and down the screen to cross a busy freeway, receiving reward when it successfully gets to the other side.
In a single episode, the agent can cross the freeway multiple times; each time the agent makes it to the other side, the agent’s location is reset to the original starting location, allowing the agent to attempt to cross the freeway once again.
For this reason, we see the value increase as the agent gets closer to the other side of the road, and then drop as soon as its position resets to the starting location.
As evident, the peaks of the learned value function correspond highly to the environment reward.
3D Visual Navigation.
Figure S11 visualizes the learned value map in the 3D Visual Navigation branching environment from Chang et al.
As depicted in Figure 6, there are two goals: G near and G far .
The ﬁgure on the right illustrates that the value function learned by utilizing our latent actions correctly assigns high value to the regions surrounding the two goal locations, and low value elsewhere.
Additionally, we learn the value functions with DQN using a dataset obtained by using a sub-optimal policy which prefers to go to the goal further away rather than the goal close by.
Despite this sub-optimality, the learned value function correctly assigns a higher value to the nearby goal than the goal which is further away.
2D Continuous Control.
Figure S12 shows a visualization of the value function learned using latent actions for the 2D Continuous Control environment.
While the observation space of this environment is ( x, y, v x , v y ) i.e. location and velocity of the agent, we produce this visualization over just the location of the agent.
Based on just the location of the agent, the optimal value function would be a monotonically decreasing function as the distance from the goal location increases.
In this particular environment, the goal of the agent is to get to the top-right corner of the maze.
The visualization shows that the learned value function produces high values around this goal region at the topright corner of the maze, and gradually lower values the farther away you go.
This ﬁgure visually is in line with our quantitative results in
Table 1 which show that the value function learned using latent actions in the 2D Continuous Control environment highly correlates to that learned using ground truth actions.
[Figure]
The x-axis is the microwave angle in radians, the y-axis is the distance between the end-effector and the microwave door handle, with the colors corresponding to the magnitude of the values.
Kitchen Manipulation.
We visualize the values as a function of both the angle that the microwave door makes with respect to its starting state as well as the distance between the endeffector and the microwave door handle in Figure S13.
The task here is to open the microwave door: the agent receives a binary reward when the angle that the microwave door makes with respect to its starting state (i.e. closed microwave door) is above a threshold (approx.
radians), and zero otherwise.
As expected, we see that the predicted value of a state increases as the angle of the microwave door increases.
The end-effector position does not start out at the microwave door handle, but rather is initialized a ﬁxed distance away from the handle.
As a result, the agent must ﬁrst move the end-effector to the microwave door handle, before interacting with the door handle to open it.
In addition to this, we hypothesize that as the distance between the end-effector and the microwave door handle decreases, the predicted value should increase.
While not as obvious as the relation between the microwave door angle and the value, we see some indication that as the distance between the end-effector and the microwave door handle decreases, the value increases. A. LAQ IN S TOCHASTIC MDP S
We have conducted experiments on stochastic MDPs in the gridworld environment.
Speciﬁcally, we do this by adding sticky actions, such that with a certain probability (called the stickiness parameter), the environment executes the previous action as opposed to the given action.
We run LAQ with data from this stochastic environment and examine a) purity of latent actions, b) quality of learned value functions
[Figure]
and c) correctness of implied behavior
[Figure]
As expected
[Figure]
Figure S14 (left) shows that the state-based purity of the learned latent actions falls off as the stochasticity (stickiness) increases.
However, these impure latent actions have little effect on the Spearman’s rank correlation (top right).
The Spearman’s rank correlation does decrease but remains reasonably high even when the stickiness parameter is set to 95%.
While the ordering of the values of the different states doesn’t change by much, we note increasing amount of overestimation in the values (bottom right).
This is expected as with increasing stochasticity, there is an increasingly large gap between what LAQ thinks it can control, and what it can actually control.
However, the behavior implied by LAQ is still always correct (bottom left), as the over-estimation is uniform over all states.
Thus, it is possible to get good performance from LAQ in some stochastic environments.
However, it is possible to also construct simple scenarios where LAQ, and for that matter any deterministic algorithm, will suffer as we describe in Section A.2.
do 4:
L t t
1 ) =
min ˆ a ∈ ˆ A l f θ t
ˆ a o t
1 ) 5: θ θ − α θ L t
Section 4.
ˆ a ∈ ˆ A t
ˆ g
| t t
∈ D } do 11: do
Q
Q s
13: end
14: end for 15: V s max ˆ a ∈ ˆ A Q s