1 Introduction
For many interesting reinforcement learning tasks, good policies exhibit similar behaviors in different contexts, behaviors that need to be modified only slightly or occasionally to account for the specific task at hand or to respond to information becoming available. For example, a simulated humanoid in navigational tasks is usually required to walk – independently of the specific goal it is aiming for. Similarly, an agent in a simulated maze tends to primarily move forward with occasional left/right turns at intersections.
This intuition has been explored across multiple fields, from cognitive science (e.g. Kool & Botvinick, 2018)
to neuroscience and machine learning. For instance, the idea of bounded rationality
(e.g. Simon, 1956)emphasizes the cost of information processing and the presence of internal computational constraints. This implies that the behavior of an agent minimizes the need to process information, and more generally trades off task reward with computational effort, resulting in structured repetitive patterns. Computationally, these ideas can be modeled using tools from information and probability theory
(e.g. Tishby & Polani, 2011; Ortega & Braun, 2011; Still & Precup, 2012; Rubin et al., 2012; Ortega & Braun, 2013; Tiomkin & Tishby, 2017), for instance, via constraints on the channel capacity between past states and future actions in a Markov decision process.
In this paper we explore this idea, starting from the KL regularized expected reward objective (e.g. Todorov, 2007; Toussaint, 2009; Kappen et al., 2012; Rawlik et al., 2012; Levine & Koltun, 2013; Teh et al., 2017), which encourages an agent to trade off expected reward against deviations from a prior or default distribution over trajectories. We explore how this can be used to inject subjective knowledge into the learning problem by using an informative default policy that is learned alongside the agent policy This default policy encodes default behaviours that should be executed in multiple contexts in absence of additional task information and the objective forces the learned policy to be structured in alignment with the default policy.
To render this approach effective, we introduce an information asymmetry between the default and agent policies, preventing the default policy from accessing certain information in the state. This prevents the default policy from collapsing to the agent’s policy. Instead, the default policy is forced to generalize across a subset of states, implementing a form of default behavior that is valid in the absence of the missing information, and thereby exerting pressure that encourages sharing of behavior across different parts of the state space.
Figure 1 illustrates the proposed setup, with asymmetry imposed by hiding parts of the state from the default policy. We investigate the proposed approach empirically on a variety of challenging problems including both continuous action problems such as controlling simulated highdimensional physical embodied agents, as well as discrete action visual mazes. We find that even when the agent and default policies are learned at the same time, significant speedups can be achieved on a range of tasks. We consider several variations of the formulation, and discuss its connection to several ideas in the wider literature, including information bottleneck, and variational formulations of the EM algorithm for learning generative models.
2 KL and entropy regularized reinforcement learning
Throughout this paper we use and to denote the state and action at time step , and the instantaneous reward for the agent if it executes action in state . We denote the history up to time by , and the whole trajectory by . Our starting point is the KL regularized expected reward objective
(1) 
where is the agent policy (parameterized by and to be learned), the default policy, and is taken with respect to the distribution over trajectories defined by the agent policy and system dynamics: . Note that our policies are historydependent. is the KullbackLeibler (KL) divergence between the agent policy and a default or prior policy given history . The discount factor is and
is a hyperparameter scaling the relative contributions of both terms.
Intuitively, this objective expresses the desire to maximize the reward while also staying close to a reference behaviour defined by . As discussed later, besides being a convenient way to express a regularized RL problem, it also has deep connections to probabilistic inference. One particular instantiation of eq. (1) is when
is the uniform distribution (assuming a compact action space). In this case one recovers, up to a constant, the entropy regularized objective
(e.g. Ziebart, 2010; Fox et al., 2015; Haarnoja et al., 2017; Schulman et al., 2017a; Hausman et al., 2018):(2) 
This objective has been motivated in various ways: it prevents the policy from collapsing to a deterministic solution thus improving exploration, it encourages learning of multiple solutions to a task which can facilitate transfer, and it provides robustness to perturbations and model mismatch. One approximation of the entropy regularized objective is for the history dependent entropy to be used as an additional (auxiliary) loss to the RL loss; this approach is widely used in the literature (e.g. Williams & Peng, 1991; Mnih et al., 2016). While the motivations for considering the entropy regularized objective are intuitive and reasonable, the choice of regularizing towards an uniform policy is less obvious, particularly in cases with large or high dimensional action spaces. In this work we explore whether regularization towards more sophisticated default policies can be advantageous.
Both objectives (1) and (2) can be generalized beyond the typical Markov assumption in MDPs. In particular, additional correlations among actions can be introduced, e.g. using latent variables Hausman et al. (2018). This can be useful when, as discussed below, either or are not given full access to the state, rendering the setup partially observed. In the following we will not explore such extensions, though note that we do work with policies and that depend on history .
3 Learning default policies
Many works that consider the KL regularized objective either employ a simple or fixed default policy or directly work with the entropy formulation (e.g. Rubin et al., 2012; Fox et al., 2015; Haarnoja et al., 2017; Hausman et al., 2018). In contrast, here we will be studying the possibility of learning the default policy itself, and the form of the subjective knowledge that this introduces to the learning system. Our guiding intuition, as described earlier, is the notion of a default behaviour that is executed in the absence of additional goaldirected information. Instances which we explore in this paper include a locomotive body navigating to a goal location where the locomotion pattern depends largely on the body configuration and less so on the goal, and a 3D visual maze environment with discrete actions, where the typical action includes forward motion, regardless of the specific task at hand.
To express the notion of a default behavior, which we also refer to as “goalagnostic” (although the term should be understood very broadly), we consider the case where the default policy is a function (parameterized by ) of a subset of the interaction history up to time , i.e. , where is a subset of the full history and is the goalagnostic information that we allow the default policy to depend on. We denote by the other (goaldirected) information in and assume that the full history is the disjoint union of both. The objective (1) specializes to:
(3) 
To give a few examples: If is empty then the default policy does not depend on the history at all (e.g. uniform policy). If then it depends only on past actions. In multitask learning can be the task identifier, while the state history. And finally, in continuous control can contain proprioceptive information about the body, while contains exteroceptive (goaldirected) information (e.g. vision).
By hiding information from the default policy, the system forces the default policy to learn the average behaviour over histories with the same value of . If hides goaldirected information, the default policy will learn behaviour that is generally useful regardless of the current goal. We can make this precise by noting that optimizing the objective (1) with respect to
amounts to supervised learning of
on trajectories generated by , i.e. this is a distillation process from to (Hinton et al., 2015; Rusu et al., 2016; Parisotto et al., 2016; Teh et al., 2017). In the nonparametric case, the optimal default policy can be derived as:(4) 
where is the probability of seeing history at time step under the policy , and the indicator is 1 if the goalagnostic information of the two histories matches and 0 otherwise.
It is also worth considering the effect of the objective eq. (3) on the learned policy . Since is learned alongside and not specified in advance, this objective does not favor any particular behavior a priori. Instead it will encourage a solution in which similar behavior will be executed in different parts of the state space that are similar as determined by , since the policy is regularized towards the default policy . More generally, during optimization of the default policy effectively acts like a shaping reward while the entropy contained in the KL discourages deterministic solutions.
4 Connection to information bottleneck and variational EM
4.1 Information bottleneck
Reinforcement learning objectives with information theoretic constraints have been considered by multiple authors (Tishby & Polani, 2011; Still & Precup, 2012; Tiomkin & Tishby, 2017). Such constraints can be motivated by the internal computational limitations of the agent, which limit the rate with which information can be extracted from states (or observations) and translated into actions. Such capacity constraints can be expressed via an information theoretic regularization term that is added to the expected reward. Specializing to our scenario, where the “information flow” to be controlled is between the goaldirected history information and action (so that the agent prefers default, goalagnostic, behaviour), consider the objective:
(5) 
where is the conditional mutual information between and given . The conditional mutual information can be upper bounded:
(6) 
where the inequality is from the fact that the KL divergence is positive (see Alemi et al., 2016). Reintroducing this into (5) we find that the KL regularized objective in eq. (3) can be seen as a lower bound to eq. (5), where the agent has a capacity constraint on the channel between goaldirected history information and (future) actions. See section A in the appendix for a generalization including latent variables. In this light, we can see our work as a particular implementation of the information bottleneck principle, where we penalize the dependence on the information that is hidden from the default policy.
4.2 Variational EM
The above setup also bears significant similarity to the training of variational autoencoders
(Kingma & Welling, 2013; Rezende et al., 2014) and, more generally the variational EM framework for learning latent variable models (Dempster et al., 1977; Neal & Hinton, 1999). The setup is as follows. Given observations the goal is to maximize the log marginal likelihood where . This marginal likelihood can be bounded from below by with being a learned approximation to the true posterior . This lower bound exhibits a similar information asymmetry between and as the one introduced between and in the objective in eq. (3). In particular, in the multitask case discussed in section 3 with one task per episode, can be seen to take the role of the task, that of the task reward, that of task conditional policy, and the default policy. Therefore maximizing eq. (3) can then be thought of as learning a generative model of behaviors that can explain the solution to different tasks.5 Algorithm
In practice the objective in eq. 3 can be optimized in different ways. A simple approach is to perform alternating gradient ascent in and . Optimizing with respect to amounts to supervised learning with as the data distribution (distilling into ). Optimizing given requires solving a regularized expected reward problem which can be achieved with a variety of algorithms (Schulman et al., 2017a; Teh et al., 2017; Haarnoja et al., 2017; Hausman et al., 2018; Haarnoja et al., 2018).
The specific algorithm choice in our experiments depends on the type of environment. For the continuous control domains we use SVG(0) (Heess et al., 2015) with experience replay and a modification for the KL regularized setting (Hausman et al., 2018; Haarnoja et al., 2018)
. The SVG(0) algorithm learns stochastic policies by backpropagation from the actionvalue function. We estimate the action value function using
step returns and the Retrace operator for lowvariance offpolicy correction (see
Munos et al. (2016); as well as Hausman et al. (2018); Riedmiller et al. (2018b)). For discrete action spaces we use a batched actorcritic algorithm (see Espeholt et al. (2018)). The algorithm employs a learned statevalue function and obtains value estimates for updating the value function and advantages for computing the policy gradient using step returns in combination with the Vtrace operator for offpolicy correction. All algorithms are implemented in batched distributed fashion with a single learner and multiple actors. In algorithm 1 we provide pseudocode for actorcritic version of the algorithm with step returns. Details of the offpolicy versions of the algorithms for continuous and discrete action spaces can be found in the appendix (section D).6 Related work
There are several well established connections between certain formulations of the reinforcement learning literature and concepts from the probabilistic modeling literature. The formalisms are often closely related although derived from different intuitions, and with different intentions.
Maximum entropy reinforcement learning, stochastic optimal control, and related approaches build on the observation that some formulation of the reinforcement learning problem can be interpreted as exact or approximate variational inference in a probabilistic graphical model in which the reward function takes the role of loglikelihood (e.g. Ziebart, 2010; Kappen et al., 2012; Toussaint, 2009). While the exact formulation and algorithms vary, they result in an entropy or KL regularized expected reward objective. These algorithms were originally situated primarily in the robotics and control literature but there has been a recent surge in interest in deep reinforcement learning community (e.g. Fox et al., 2015; Schulman et al., 2017a; Nachum et al., 2017a; Haarnoja et al., 2017; Hausman et al., 2018; Haarnoja et al., 2018).
Related but often seen as distinct is the familiy of expectation maximization policy search algorithms (e.g. Peters et al., 2010; Rawlik et al., 2012; Levine & Koltun, 2013; Montgomery & Levine, 2016; Chebotar et al., 2016; Abdolmaleki et al., 2018). These cast policy search as an alternating optimization problem similar to the EM algorithm for learning probabilistic models. They differ in the specific implementation of the equivalents of the E and M steps; intuitively the default policy is repeatedly replaced by a new version of the policy.
The DISTRAL algorithm (Teh et al., 2017) as well as the present paper can be seen as taking an intermediate position: unlike in the class of RLasinference algorithms the default policy is not fixed but learned, but unlike in the classical EM policy search the final result of the optimization remains regularized since the default policy is constrained relative to the policy. As explained above this can be seen as analogous to the relative roles of learned model and observation specific posterior in fitting a generative model. Similar to DISTRAL, Divide and Conquer (Ghosh et al., 2018) learns an ensemble of policies, each specializing to a particular context, which are regularized towards one another via a symmetric KL penalty, with the behavior of the ensemble distilled to a single fixed policy. In concurrent work Goyal et al. (2019) propose an information bottleneck architecture for policies with latent variables that leads to a KLregularized formulation similar to the one described in Appendix A.2. The information bottleneck is implemented in latent space and the default policy is obtained by marginalization with a goalagnostic prior.
An important feature of EM policy search and other policy gradient algorithms is the presence of a KL constraint that limits the relative change of the policy to some older version across iterations to control for the rate of change in the policy (e.g. Schulman et al., 2015; Heess et al., 2015; Schulman et al., 2017b; Heess et al., 2017; Nachum et al., 2017b)
. The constraint can be implemented in different ways, and collectively the algorithms are often classified as “trust region” methods. Note that for a KL regularized objective to be a trust region
(Nocedal & Wright, 2006), additional assumptions need to hold. In principle, as an optimization technique, the critical points of the KL regularized objective for some function have to be, provably, the same as for the nonregularized objective. This is not trivial to show unless the trust region for step is around . In our case, there is no such guarantee even if we remove the asymmetry in information between default policy and policy or make the default policy be an old copy of the policy.Other related works motivated from an optimization perspective include Deep Mutual Learning (Zhang et al., 2018) applied in supervised learning, where KLregularization is used with a learned prior that receives the same amount of information as the trained model. Kirkpatrick et al. (2017) introduces EWC to address catastrophic forgetting, where a second order Taylor expansion of the KL, in a KLregularized objective, forces the main policy to stay close to solutions of previously encountered tasks. Czarnecki et al. (2018) also relies on a KLregularized objective to ensure policies explored in a curriculum stay close to each other.
Conceptually distinct but formally closely related to maximum entropy and KLregularized formulations are computational models of bounded rationality (e.g. Tishby & Polani, 2011; Ortega & Braun, 2011; Still & Precup, 2012; Rubin et al., 2012; Tiomkin & Tishby, 2017) which introduce information constraints to account for the agent’s internal computational constraints on its ability to process information. As discussed in section 4 the present formulation can be seen as a more general formulation of the idea.
7 Continuous control experiments
In our experiments, we study the effect of using a learned default policy to regularize the behavior of our agents, across a wide range of environments spanning sparse and dense reward tasks. In particular, we evaluate the impact of conditioning the default policy on various information sets
on the learning dynamics, and evaluate the potential of pretrained default policies for transfer learning. In these experiments, we consider two streams of information which are fed to our agents:
task specific information (task) and proprioception (proprio), corresponding to walker (body) specific observations (joint angles etc.).We consider three walkers: jumping ball
with 3 degrees of freedom (DoF) and 3 actuators;
quadruped with 12 DoF and 8 actuators; humanoidwith 28 DoF and 21 actuators. The task is specified to the agent either via an additional feature vector (referred to as
featuretasks) or in the form of visual input (visiontask). The tasks differ in the type of reward: in sparse reward tasks a nonzero reward is only given when a (sub)goal is achieved (e.g. the target was reached); in dense reward tasks smoothly varying shaping reward is provided (e.g. negative distance to the target). We consider the following tasks.Walking task, a densereward task based on features. The walker needs to move in one of four randomly sampled directions, with a fixed speed; the direction being resampled halfway through the episode. Walls task, a densereward visiontask. Here the walker has to traverse a corridor while avoiding walls. Go to one of K targets task, a sparsereward featurebased task. The walker has to go to one of K randomly sampled targets. For K=1, the target can either reappear within the episode (referred to as the moving target task) or the episode can end upon reaching the target. Move one box to one of K targets, a sparsereward featurebasedtask. The walker has to move a box to one of K targets, and optionally, go on to one of the remaining targets. The latter is referred to as the move one box to one of K targets and go to another target). Foraging in the maze task, a sparsereward visiontask. The walker collects apples in a maze. Figure 2 shows visualizations of the walkers and some of the tasks. Refer to appendix C for more details.
Experimental Setup
As baseline, we consider policies trained with standard entropy regularization. When considering the full training objective of eq. 1, the default policy network shares the same structure as the agent’s policy. In both cases, hyperparameters are optimized on a pertask basis. We employ a distributed actorlearner architecture (Espeholt et al., 2018): actors execute recent copies of the policy and send data to a replay buffer of fixed size; while the learner samples short trajectory windows from the replay and computes updates to the policy, value, and default policy. We experimented with a number of actors in (depending on the task) and a single learner. Results with a single actor are presented in appendix B. Unless otherwise mentioned, we plot average episodic return as a function of the number of environment transitions processed by the learner^{1}^{1}1Note that due to the distributed setup with experience replay this number does not directly translate to the number of environment steps executed or gradient updates performed (the latter can be computed dividing the steps processed by batch size and unroll length).. Each experiment is run with five random seeds. For more details, see appendix D.2
We consider three information sets passed to the default policy: proprioceptive, receiving only proprioceptive information; tasksubset, receiving proprioceptive and a subset of taskspecific information; fullinformation, receiving the same information as the policy.
The main finding of our experiments is that the default policy with limited task information provides considerable speedup in terms of learner steps for the sparsereward tasks with complex walkers (quadruped, humanoid). The results on these tasks are presented in figure 3. More cases are covered in the appendix E.
Overall, the proprioceptive default policy is very effective and gives the biggest gains in the majority of tasks. Providing additional information to the default policy, leads to an improvement only in a small number of cases (figure 3, right and appendix E.3). In these cases, the additional information (e.g. box position), provides useful inductive bias for policy learning. For the densereward tasks or for a simple walker body adding the default policy has limited or no effect (see appendix E.1, E.2). We hypothesize that this is due to the relative simplicity of the regular policy learning versus the KLregularized setup. In the case of densereward tasks the agent receives a strong learning signal. For simple walkers there may be little behavioral structure that can be modeled by the default policy. Finally, when the default policy receives full information, the optimal default policy could, in principle, exactly copy the agent policy, thus bearing similarity to methods which regularize the current policy against an older copy of itself. In all cases, the default policy is likely to be less effective at encouraging the generalization of behavior across different contexts and thus to provide less meaningful regularization.
We analyze the agent behavior on the go to moving target task with a quadruped walker. We illustrate the agent trajectory for this task in figure 4, left. The red dot corresponds to the agent starting position. The green stars on the left and central figures correspond to the locations of the targets with blue numbers indicating the order of achieving the targets. The yellow dots on the left and central curves indicate the segment (of 40 time steps) near the target. In figure 4, center, we show the KL divergence, , from the agent policy to the proprioceptive default policy. We observe that for the segments which are close to the target (yellow dots near green star), the value of the KL divergence is high. In these segments the walker has to stop and turn in order to go to another target. It represents a deviation from the standard, walking behavior, and we can observe it as spikes in the KL. Furthermore, for the segments between the targets, e.g. 4 –> 5, the KL is much lower.
Default Policy Transfer
We additionally explore the possibility of reusing pretrained default policies to regularize learning on new tasks. Our transfer task is moving one box to one of 2 targets and going to another target task with the quadruped. We consider different default policies: GTT proprio: proprioceptive information only trained on going to moving target task (GTT); MB proprio: proprioceptive information only trained on moving one box to one target task (MB); MB box: similar MB proprio, but with box position information as additional input. The results are given in figure 4, right. We observe a significant improvement in learning speed transferring the pretrained default policies to the new task. Performance improves as the trajectory distribution modeled by the default policy is closer to the one appropriate for the transfer task (compare GTT proprio with MB proprio; and MB proprio with MB box).
Ablative Analysis
To gain deeper insights into our method, we compare different forms of regularization of the standard RL objective: entropy bonus  adding an entropy term to the pertimestep actor loss; entropy regularization  optimizing the objective (2); KL bonus  adding the KLdivergence term from the agent policy to the default one to the pertimestep actor loss; KLregularization  optimizing the objective (1); KLregularization to the old policy  optimization of the objective 1 where regularization is done wrt. an older version of the main policy (updated every 100 steps). The default policy receives only proprioceptive information in these experiments. The task is go to moving target. As can be seen in Figure 5 left, all three KLbased variants improve performance over the baseline, but regularizing against the information restricted default policy outperforms regularization against an old version of the policy.
Furthermore, we assess the benefit of the KLregularized objective 1 when used with an idealized default policy. We repeat the gototarget experiment with a pretrained default policy on the same task. Figure 5 center, shows a significant difference between the baseline and different regularization variants: using the pretrained default policy, learning the default policy alongside the main policy or using a pretrained expert (default policy with access to the full state). This suggests that large gains may be achievable in situations when a good default policy is known a priori. We performed the same analysis for the dense reward but we did not notice any gain. The speedup from regularizing to the pretrained expert is significant, however it corresponds to regularizing against an existing solution and can thus primarily be used as a method to speedup the experiment cycles, as it was demonstrated in the kickstarting framework (Schmitt et al., 2018).
Finally, we study impact of the direction of the KL in objective 1 on the learning dynamics. Motivated by the work on policy distillation (Rusu et al., 2016) we flip the KL and use instead of the described before . We use this term either in per time step actor loss (auxiliary loss) or as a regularizer The figure 5 right, shows that there is no significant difference between these regularization schemes, which suggests that the idea of learned default policy can be viewed from studentteacher perspective, where default policy plays the role of the teacher. This teacher can be used in a new task.
8 Discrete action spaces experiments
We also evaluate our method on the DMLab30 set of environments. DMLab (Beattie et al., 2016) provides a suite of rich, firstperson environments with tasks ranging from complex navigation and lasertag to languageinstructed goal finding. Recent works on multitask training (Espeholt et al., 2018) in this domain have used a form of batchedA2C with the Vtrace algorithm to maximize an approximation of the entropy regularized objective described earlier, where the default policy is a uniform distribution over the actions.
Typically, the agent receives visual information at each step, along with an instruction channel used in a subset of tasks. The agent receives no task identifier. We adopt the architecture employed in previous work (Espeholt et al., 2018) in which frames, past actions and rewards are passed successively through a deep residual network and LSTM, finally predicting a policy and value function. All our experiments are tuned with populationbased training (Jaderberg et al., 2017). Further details are provided in appendix D.1.
DMLab exposes a large action space, specifically the cartesian product of atomic actions along seven axes. However, commonly a humanengineered restricted subset of these actions is used at training and test time, simplifying the exploration problem for the agent. For example, the used action space has a forward bias, with more actions resulting in the agent moving forward rather than backwards. This helps with exploration in navigation tasks, where even a random walk can get the agent to move away from the starting position. The uniform default policy is used on top of this human engineered small action space, where its semantics are clear.
In this work, we instead consider a much larger combinatorial space of actions. We show that a pure uniform default policy is in fact unhelpful when human knowledge is removed from defining the right subset of actions to be uniform over, and the agent underperforms. Learning the default policy, even in the extreme case when the default policy is not conditioned on any state information, helps recovering which actions are worth exploring and leads to the emergence of a useful action space without any hand engineering.
Figure 6 shows the results of our experiments. We consider a flat action space of 648 actions, each moving the agent in different spatial dimensions. We run the agent from (Espeholt et al., 2018) as baseline which is equivalent to considering the default policy to be a uniform distribution over the 648 actions, and three variants of our approach, where the default policy is actually learnt.
For feed forward default policy, while the agent is recurrent, the default policy is not. That is the policy is conditioned on the full trace of observed states , while the default policy is conditioned only on the current frame . Given that most of the 30 tasks considered require memory in order to be solvable, the default policy has to generalize over important task details. LSTM default policy on the other hand, while being recurrent as the agent, it observes only the previous action and does not receive any other state information. In this instance, the default policy can only model the most likely actions given recent behaviour in absence of any visual stimuli. For example, if previous actions are moving forward, the default policy might predict moving forward as the next action too. This is because the agent usually moves consistently in any given direction in order to navigate efficiently. Finally, the vector default policy refers to a default policy that is independent of actions and states (i.e. average behaviour over all possible histories of states and actions).
Using any of the default policies outperforms the baseline, with LSTM default policy slightly underperforming compared with the others. The vector default policy performs surprisingly well, highlighting that for DMLab defining a meaningful action space is extremely important for solving the task. Our approach can provide a mechanism for identifying this action space without requiring human expert knowledge on the tasks. Note in middle plot, figure 6, that the entropy of the default policy over learning frames goes down, indicating that the default policy becomes peaky and is quite different from the uniform distribution which the baseline assumes. Note that when running the same experiments with the original humanengineered smaller action space, no gains are observed. This is similar to the continuous control setup, corresponding to changing the walker to a simple one and hence converting the task into a denser reward one.
Additionally, in figure 6 right, for the vector default policy, we show the probability of a few actions of interest by marginalizing over all other actions. We notice that the agent has a tendency of moving forward , while moving backwards is quite unlikely . The default policy discovers one element of the human defined action space, namely forwardbias which is quite useful for exploring the map. The uniform bias would put same weight for moving forward as for moving backwards, making exploration harder. We also note that the agent has a tendency to turn right and look right. Given that each episode involves navigating a new sampled map, such a bias provides a meaningful exploration boost, as it suggest a following the wall strategy, where at any new intersection the agent always picks the same turning direction (e.g. right) to avoid moving in circles. But as expected, since neither looking up or looking down provides any advantage, these actions are equally probable.
9 Discussion and Conclusions
In this work we studied the influence of learning the default policy in the KLregularized RL objective. Specifically we looked at the scenario where we enforce information asymmetry between the default policy and the main one. In the continuous control, we showed empirically that in the case of sparsereward tasks with complex walkers, there is a significant speedup of learning compared to the baseline. In addition, we found that the gain in densereward tasks and/or with simple walkers was limited, or difficult to get. Moreover, we demonstrated that significant gains can be achieved in the discrete action spaces. We provided evidence that these gains are mostly due to the information asymmetry between the agent and the default policy. Best results are obtained when the default policy sees only a subset of information, allowing it to learn taskagnostic behaviour. Furthermore, these default polices can be reused to significantly speedup learning on new tasks.
10 Acknowledgments
The authors would like to thank Abbas Abdolmaleki, Arun Ahuja, Jost Tobias Springenberg, Siqi Liu for their help on experimental side. Furthermore, The authors would like to thank Greg Wayne for useful discussions. Finally, the authors are very grateful to Simon Osindero and Phil Blunsom for their insightful feedback on the paper.
References
 Abdolmaleki et al. (2018) Abbas Abdolmaleki, Jost Tobias Springenberg, Yuval Tassa, Rémi Munos, Nicolas Heess, and Martin A. Riedmiller. Maximum a posteriori policy optimisation. CoRR, abs/1806.06920, 2018.
 Alemi et al. (2016) Alexander A. Alemi, Ian Fischer, Joshua V. Dillon, and Kevin Murphy. Deep variational information bottleneck. CoRR, abs/1612.00410, 2016. URL http://arxiv.org/abs/1612.00410.
 Alemi et al. (2017) Alexander A. Alemi, Ben Poole, Ian Fischer, Joshua V. Dillon, Rif A. Saurous, and Kevin Murphy. Fixing a broken elbo. CoRR, abs/1711.00464, 2017. URL http://arxiv.org/abs/1711.00464.
 Beattie et al. (2016) Charles Beattie, Joel Z. Leibo, Denis Teplyashin, Tom Ward, Marcus Wainwright, Heinrich Küttler, Andrew Lefrancq, Simon Green, Víctor Valdés, Amir Sadik, Julian Schrittwieser, Keith Anderson, Sarah York, Max Cant, Adam Cain, Adrian Bolton, Stephen Gaffney, Helen King, Demis Hassabis, Shane Legg, and Stig Petersen. Deepmind lab. arXiv preprint arXiv:1612.03801, 2016. URL https://arxiv.org/abs/1612.03801.
 Chebotar et al. (2016) Yevgen Chebotar, Mrinal Kalakrishnan, Ali Yahya, Adrian Li, Stefan Schaal, and Sergey Levine. Path integral guided policy search. CoRR, abs/1610.00529, 2016.
 Czarnecki et al. (2018) Wojciech Marian Czarnecki, Siddhant M. Jayakumar, Max Jaderberg, Leonard Hasenclever, Yee Whye Teh, Nicolas Heess, Simon Osindero, and Razvan Pascanu. Mix & match agent curricula for reinforcement learning. In ICML, 2018.
 Dempster et al. (1977) A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B, 39:1–38, 1977.
 Espeholt et al. (2018) Lasse Espeholt, Hubert Soyer, Remi Munos, Karen Simonyan, Volodymir Mnih, Tom Ward, Yotam Doron, Vlad Firoiu, Tim Harley, Iain Dunning, Shane Legg, and Koray Kavukcuoglu. Scalable distributed deeprl with importance weighted actorlearner architectures. arXiv:1802.01561, 2018. URL https://arxiv.org/abs/1802.01561.
 Fox et al. (2015) Roy Fox, Ari Pakman, and Naftali Tishby. Glearning: Taming the noise in reinforcement learning via soft updates. CoRR, abs/1512.08562, 2015.
 Ghosh et al. (2018) Dibya Ghosh, Avi Singh, Aravind Rajeswaran, Vikash Kumar, and Sergey Levine. Divideandconquer reinforcement learning. In International Conference on Learning Representations, 2018.
 Goyal et al. (2019) Anirudh Goyal, Riashat Islam, Daniel Strouse, Zafarali Ahmed, Matthew Botvinick, Hugo Larochelle, Yoshua Bengio, and Sergey Levine. Infobot: Transfer and exploration via the information bottleneck. ICLR, abs/1901.10902, 2019. URL http://arxiv.org/abs/1901.10902.
 Haarnoja et al. (2017) Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. Reinforcement learning with deep energybased policies. CoRR, abs/1702.08165, 2017.
 Haarnoja et al. (2018) Tuomas Haarnoja, Aurick Zhou, Pieter Abbeel, and Sergey Levine. Soft actorcritic: Offpolicy maximum entropy deep reinforcement learning with a stochastic actor. CoRR, abs/1801.01290, 2018. URL http://arxiv.org/abs/1801.01290.
 Hausman et al. (2018) Karol Hausman, Jost Tobias Springenberg, Ziyu Wang, Nicolas Heess, and Martin Riedmiller. Learning an embedding space for transferable robot skills. International Conference on Learning Representations, 2018. URL https://openreview.net/forum?id=rk07ZXZRb.
 He et al. (2015) Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. arXiv:1512.03385, 2015. URL https://arxiv.org/abs/1512.03385.
 Heess et al. (2015) Nicolas Heess, Gregory Wayne, David Silver, Tim Lillicrap, Tom Erez, and Yuval Tassa. Learning continuous control policies by stochastic value gradients. In Advances in Neural Information Processing Systems, pp. 2944–2952, 2015.
 Heess et al. (2017) Nicolas Heess, Srinivasan Sriram, Jay Lemmon, Josh Merel, Greg Wayne, Yuval Tassa, Tom Erez, Ziyu Wang, Ali Eslami, Martin Riedmiller, et al. Emergence of locomotion behaviours in rich environments. arXiv preprint arXiv:1707.02286, 2017.
 Hinton et al. (2015) Geoffrey Hinton, Oriol Vinyals, and Jeffrey Dean. Distilling the knowledge in a neural network. In NIPS Deep Learning and Representation Learning Workshop, 2015. URL http://arxiv.org/abs/1503.02531.
 Jaderberg et al. (2017) Max Jaderberg, Valentin Dalibard, Simon Osindero, Wojciech M. Czarnecki, Jeff Donahue, Ali Razavi, Oriol Vinyals, Tim Green, Iain Dunning, Karen Simonyan, Chrisantha Fernando, and Koray Kavukcuoglu. Population based training of neural networks. arXiv preprint arXiv:1711.09846, 2017. URL https://arxiv.org/abs/1711.09846.
 Kappen et al. (2012) Hilbert J. Kappen, Vicenç Gómez, and Manfred Opper. Optimal control as a graphical model inference problem. Machine Learning, 87(2):159–182, May 2012. ISSN 15730565.
 Kingma & Welling (2013) Diederik P Kingma and Max Welling. Autoencoding variational bayes. arXiv preprint arXiv:1312.6114, 2013.

Kirkpatrick et al. (2017)
James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume
Desjardins, Andrei A Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka
GrabskaBarwinska, et al.
Overcoming catastrophic forgetting in neural networks.
Proceedings of the National Academy of Sciences, pp. 201611835, 2017.  Kool & Botvinick (2018) Wouter Kool and Matthew Botvinick. Mental labour. Nature Human Behaviour, 2018. doi: 10.1038/s4156201804019.
 Levine & Koltun (2013) Sergey Levine and Vladlen Koltun. Variational policy search via trajectory optimization. In Advances in Neural Information Processing Systems, pp. 207–215, 2013.
 Mnih et al. (2015) Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Humanlevel control through deep reinforcement learning. Nature, 518(7540):529–533, 2015.
 Mnih et al. (2016) Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy P Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement learning. In International Conference on Machine Learning (ICML), 2016.
 Montgomery & Levine (2016) William Montgomery and Sergey Levine. Guided policy search as approximate mirror descent. CoRR, abs/1607.04614, 2016. URL http://arxiv.org/abs/1607.04614.
 Munos et al. (2016) Rémi Munos, Tom Stepleton, Anna Harutyunyan, and Marc G. Bellemare. Safe and efficient offpolicy reinforcement learning. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 510, 2016, Barcelona, Spain, pp. 1046–1054, 2016. URL http://papers.nips.cc/paper/6538safeandefficientoffpolicyreinforcementlearning.
 Nachum et al. (2017a) Ofir Nachum, Mohammad Norouzi, Kelvin Xu, and Dale Schuurmans. Bridging the gap between value and policy based reinforcement learning. CoRR, abs/1702.08892, 2017a.
 Nachum et al. (2017b) Ofir Nachum, Mohammad Norouzi, Kelvin Xu, and Dale Schuurmans. Trustpcl: An offpolicy trust region method for continuous control. CoRR, abs/1707.01891, 2017b.
 Neal & Hinton (1999) Radford M. Neal and Geoffrey E. Hinton. Learning in graphical models. chapter A View of the EM Algorithm That Justifies Incremental, Sparse, and Other Variants, pp. 355–368. MIT Press, Cambridge, MA, USA, 1999.
 Nocedal & Wright (2006) Jorge Nocedal and Stephen J. Wright. Numerical Optimization. Springer, New York, NY, USA, second edition, 2006.
 Ortega & Braun (2011) Pedro A. Ortega and Daniel A. Braun. Information, utility & bounded rationality. CoRR, abs/1107.5766, 2011.
 Ortega & Braun (2013) Pedro A. Ortega and Daniel A. Braun. Thermodynamics as a theory of decisionmaking with informationprocessing costs. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 469(2153), 2013.
 Parisotto et al. (2016) Emilio Parisotto, Lei Jimmy Ba, and Ruslan Salakhutdinov. Actormimic: Deep multitask and transfer reinforcement learning. International Conference on Learning Representations (ICLR), 2016.

Peters et al. (2010)
Jan Peters, Katharina Mülling, and Yasemin Altün.
Relative entropy policy search.
In
Proceedings of the TwentyFourth AAAI Conference on Artificial Intelligence (AAAI)
, 2010.  Rawlik et al. (2012) Konrad Rawlik, Marc Toussaint, and Sethu Vijayakumar. On stochastic optimal control and reinforcement learning by approximate inference. In (R:SS 2012), 2012. Runner Up Best Paper Award.
 Rezende et al. (2014) Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. Stochastic backpropagation and approximate inference in deep generative models. In Proceedings of the 31st International Conference on Machine Learning (ICML), 2014.
 Riedmiller et al. (2018a) Martin Riedmiller, Roland Hafner, Thomas Lampe, Michael Neunert, Jonas Degrave, Tom Van de Wiele, Volodymyr Mnih, Nicolas Heess, and Jost Tobias Springenberg. Learning by playing – solving sparse reward tasks from scratch. arXiv:1802.10567, 2018a. URL https://arxiv.org/abs/1802.10567.
 Riedmiller et al. (2018b) Martin A. Riedmiller, Roland Hafner, Thomas Lampe, Michael Neunert, Jonas Degrave, Tom Van de Wiele, Volodymyr Mnih, Nicolas Heess, and Jost Tobias Springenberg. Learning by playing  solving sparse reward tasks from scratch. CoRR, abs/1802.10567, 2018b. URL http://arxiv.org/abs/1802.10567.
 Rubin et al. (2012) Jonathan Rubin, Ohad Shamir, and Naftali Tishby. Trading Value and Information in MDPs, pp. 57–74. Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.
 Rusu et al. (2016) Andrei A. Rusu, Sergio Gomez Colmenarejo, Caglar Gulcehre, Guillaume Desjardins, James Kirkpatrick, Razvan Pascanu, Volodymyr Mnih, Koray Kavukcuoglu, and Raia Hadsell. Policy distillation. In International Conference on Learning Representations (ICLR), 2016. URL https://arxiv.org/abs/1511.06295.
 Schmitt et al. (2018) Simon Schmitt, Jonathan J. Hudson, Augustin Zidek, Simon Osindero, Carl Doersch, Wojciech M. Czarnecki, Joel Z. Leibo, Heinrich Kuttler, Andrew Zisserman, Karen Simonyan, and S. M. Ali Eslami. Kickstarting deep reinforcement learning. arXiv:1803.03835, 2018. URL https://arxiv.org/abs/1803.03835.
 Schulman et al. (2015) John Schulman, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. Trust region policy optimization. In Proceedings of the 32nd International Conference on Machine Learning (ICML15), pp. 1889–1897, 2015.
 Schulman et al. (2017a) John Schulman, Pieter Abbeel, and Xi Chen. Equivalence between policy gradients and soft qlearning. arXiv preprint arXiv:1704.06440, 2017a.
 Schulman et al. (2017b) John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. CoRR, abs/1707.06347, 2017b. URL http://arxiv.org/abs/1707.06347.
 Simon (1956) H.A. Simon. Rational choice and the structure of the environment. Psychological Review, 63:129–138, 1956.
 Still & Precup (2012) Susanne Still and Doina Precup. An informationtheoretic approach to curiositydriven reinforcement learning. Theory in Biosciences, 131(3):139–148, 2012. doi: 10.1007/s120640110142z. URL https://doi.org/10.1007/s120640110142z.
 Teh et al. (2017) Yee Whye Teh, Victor Bapst, Wojciech Marian Czarnecki, John Quan, James Kirkpatrick, Raia Hadsell, Nicolas Heess, and Razvan Pascanu. Distral: Robust multitask reinforcement learning. arXiv preprint arXiv:1707.04175, 2017.
 Tiomkin & Tishby (2017) Stas Tiomkin and Naftali Tishby. A unified bellman equation for causal information and value in markov decision processes. CoRR, abs/1703.01585, 2017.
 Tishby & Polani (2011) Naftali Tishby and Daniel Polani. The information theory of decision and action. In Percept. Action Cycle Springer Ser. in Cognitive Neural Syst., volume 19, pp. 601–636, 01 2011. ISBN 9781441914514.
 Todorov (2007) Emanuel Todorov. Linearlysolvable markov decision problems. In B. Schölkopf, J. C. Platt, and T. Hoffman (eds.), Advances in Neural Information Processing Systems 19, pp. 1369–1376. MIT Press, 2007.
 Toussaint (2009) Marc Toussaint. Robot trajectory optimization using approximate inference. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, pp. 1049–1056, 2009. ISBN 9781605585161.
 Williams & Peng (1991) R. J. Williams and J. Peng. Function optimization using connectionist reinforcement learning algorithms. Connection Science, 3(3):241–268, 1991.
 Zhang et al. (2018) Ying Zhang, Tao Xiang, Timothy Hospedales, and Huchuan Lu. Deep mutual learning. In Computer Vision and Pattern Recognition 2018, 2018.
 Ziebart (2010) Brian D. Ziebart. Modeling Purposeful Adaptive Behavior with the Principle of Maximum Causal Entropy. PhD thesis, Machine Learning Department, Carnegie Mellon University, Dec 2010.
Appendix A KLregularized RL and information bottleneck
In this appendix we derive the connection between KLregularized RL and information bottleneck in detail. For simplicity we assume that is empty, consider dependence only on current state and do not use subscript by in detailed derivations for notational convenience. We also apologize for some notational inconsistencies, and will fix them in a later draft.
a.1 Minimizing information flow from to for unstructured policies
The simple formulation of the information bottleneck corresponds to maximizing reward while minimizing the pertimestep information between actions and state (or a subset of state, like the goal):
(7) 
Upperbounding the mutual information term:
(8)  
(9)  
(10)  
(11) 
since
(12)  
(13) 
Thus
(14)  
(15) 
i.e. the problem turns into one of KLregularized RL.
a.2 Minimizing information flow from to for policies with latent variables
For policies with latent variables such as we obtain:
(16)  
(17) 
as before.
We choose , then:
(18)  
(19)  
(20)  
(21)  
(22)  
(23) 
and thus
(24)  
(25)  
(26) 
Therefore:
(27)  
(28) 
Thus, the KL regularized objective discussed above can be seen as implementing an information bottleneck. Different forms of the default policy correspond to restricting the information flow between different components of the interaction history (past states or observations), and to different approximations to the resulting mutual information penalties.
This perspective suggests two different interpretations of the KL regularized objective discussed above: We can see the role of the default policy implementing a way of restricting information flow between (past) states and (future) actions. An alternative view, more consistent with the analogy between RL and probabilistic modeling invoked above is that of learning a “default” behavior that is independent of some aspect of the state. (Although the information theoretic view has recently gained more hold in the probabilistic modeling literature, too (e.g. Alemi et al., 2016, 2017)).
Appendix B Distributed learning setup
We use a distributed offpolicy setup similar to Riedmiller et al. (2018a). There is one learner and multiple actors. These are essentially the instantiations of the main agent used for different purposes. Each actor is the main agent version which receives the copy of parameters from the learner and unrolls the trajectories in the environment, saving it to the replay buffer of fixed size . The learner is the agent version which samples a batch of short trajectories windows (window size is defined by unroll length) from the replay buffer, calculates the gradients and updates the parameters. The updated parameters are then communicated to the actors. Such a setup speedsup learning significantly and makes the final performance of the policy better. We compare the performance of on go to moving target task with 1 and 32 actors. From figure 7, we see that the effect of the default policy does not disappear when the number of actor decreases to 1, but the learning becomes much slower, noisier and weaker.
Appendix C Continuous control: Walkers and task details
Walkers visualization is provided in figure 8. Below we give a detaatiled description of each continuous control task we studied.
Walking task.
Type. Densereward featurebasedtask.
Description
. Each half of the episode, a random direction among 4 (left, right, forward and backwards) is sampled. Task information is specified via a onehot encoding of the required direction. The walker is required to move in this direction with the target speed
and receives the reward .Reward. .
Technical details. Target speed, . The episode length is 10 seconds. For the humanoid task we use the absolute head height termination criteria: .
Walls.
Type. Densereward visiontask.
Description. Walker is required to run through a terrain and avoid the walls. The taskspecific information is a vision input. It receives the reward defined as a difference between the current walker speed and the target speed along the direction of the track.
Reward. .
Technical details. Target speed, . The episode length is 45 seconds. For the humanoid task we use the absolute head height termination criteria: .
Go to one of K single targets.
Type. Sparsereward featurebasedtask.
Description. On an infinite floor, there is a finite area of size 8x8 with K randomly placed targets. The walker is also randomly placed in a finite area. The walker’s initial position is also randomly placed on the finite area. The walker is required to one of the K targets, specified via command vector. Once it achieves the target, the episode terminates and the walker receives the reward .
Reward. .
Technical details. The episode length is 20 seconds.
Go to one moving target.
Type. Sparsereward featurebasedtask.
Description. Similar to the previous one, but there is only one target and once the walker achieves it, the target reappears in a new random place. The walker receives for 10 consecutive steps staying on the target before the target reappears in a new random position.
Reward. .
Technical details. The episode length is 25 seconds.
Move one box to one of the K targets.
Type. Sparsereward featurebasedtask.
Description
. There is a finite floor of size 3x3 padded with walls with K randomly placed targets and one box. The walker is required to move this box to one of the specified targets. Once the box is placed on the target, the episode terminates and the walker receives the reward
.Reward. .
Technical details. The episode length is 30 seconds. Control timestep is 0.05 for quadruped and 0.025 for jumping ball.
Move one box to one of the K targets and go to another.
Type. Sparsereward featurebasedtask.
Description. Similar to the previous one, but the walker is also required to go to another target (which is different from the one where it must place the box on). The walker receives the a for each task solved, and a if it solves both tasks. The other parameters are the same.
Reward. , .
Technical details. Same as in the previous task.
Foraging in the maze.
Type. Sparsereward visiontask.
Description. There is a maze with 8 apples which walker must collect. For each apple, it receives reward . The episode terminates once the walker collects all the apples or the time is elapsed.
Reward. .
Technical details. The episode length is 90 seconds. Control timestep is 0.025 for jumping ball, and 0.05 for quadruped.
Appendix D Algorithms, baseline and hyperparameters
Our agents run in offpolicy regime sampling the trajectories from the replay buffer. In practice, it means that the trajectories are coming from the behavior (replay buffer) policy , and thus, the correction must be applied (specified below). Below we provide architecture details, baselines, hyperparmaeters as well as algorithm details for discrete and continuous control cases.
d.1 Discrete case
In discrete experiments, we use Vtrace offpolicy correction as in Espeholt et al. (2018). We reuse all the hyperparameters for DMLab from the mentionned paper. At the top of that, we add default policy network and optimize the corresponding parameter using populationbase training. The difference with the setup in Espeholt et al. (2018) is that they use the human prior over actions (table D.2 in the mentionned paper), which results in 9dimensional action space. In our work, we take the rough DMLab action space, consisting of all possible rotations, and moving forward/backward, and "fire" actions. It results in the action space of dimension 648. It make the learning much more challenging, as it has to explore in much larger space.
d.2 Continuous case
The agent network (see figure 1) is divided into actor and critic networks without any parameter sharing. In the case of featurebasedtask, the taskspecific information is encoded by one layer MLP with ELU activations. For the visiontask, we use a 3layer ResNet He et al. (2015). The encoded task information is then concatenated with the proprioceptive information and passed to the agent network. The actor network encodes a Gaussian policy, , by employing a twolayer MLP, with mean and log variance as outputs and applying the following processing procedures:
where
is a sigmoid function:
The critic network is a twolayer MLP and a linear readout. The default policy network has the same structure as actor network, but receives a concatenation of the proprioceptive information with only a subset (potentially, empty) of a taskspecific information. There is no parameter sharing between the agent and the default policy. ELU is used as activation everywhere. The exact actor, critic and default policy network architectures are described below. We tried to use LSTM for the default policy network instead of MLP, but did not see a difference. We use separate optimizers and learning rates for the actor, critic and default policy networks correspondingly. For each network (which we call online), we also define the target network, similar to the target networks (Mnih et al., 2015). The target networks are updated are updated in a slower rate than the online ones by copying their parameters.
We assume that the trajectories are coming from the replay buffer . To correct for being offpolicy, we make use of the Retrace operator (see Munos et al. (2016)). This operator is applied to the function essentially introducing the importance weights. We will note the action for this operator. Algorithm 2 is an offpolicy version with retraced function of the initial algorithm 1.
We use the same update period for actor and critic networks, and a different period for the default network . The baseline is the agent network (see figure 1) without the default policy with an entropy bonus . All the hyperparameters of the baseline are tuned for each task. For each best baseline hyperparameters configuration, we tune the default policy parameters. When we use the default policy, we do not have the entropy bonus. Instead, we have a regularisation parameter . The other parameteres which we consider are: batch size, unroll length. Below we provide the hyperparameters for each of the task. The following default hyperparameters are used unless some particular one is specified.
Default hyperparameters.
Actor learning rate, .
Critic learning rate, .
Default policy learning rate, .
Agent target network update period: .
Default policy target network update period: .
Actor network: MLP with sizes .
Critic network: MLP with sizes .
Default policy network: MLP with sizes .
Command encoder network: 1layer MLP of size .
Image encoder: ResNet with filter sizes .
Gaussian policy maximum noise: .
Batch size: 512.
Unroll length: 10.
Entropy bonus: .
Regularization constant: .
Number of actors: 128.
Walking quadruped
Actor network: MLP with sizes .
Critic network: MLP with sizes .
default policy network: MLP with sizes .
Regularization constant: .
Number of actors: 256.
Walking humanoid
Entropy bonus: .
Regularization constant: .
The rest is similar to Walking quadruped.
Walls quadruped
Actor and critic learning rate: .
Batch size: 48.
Regularization constant: .
Number of actors: 64.
Walls humanoid
Actor and critic learning rate: .
Batch size: 48.
Regularization constant: .
Number of actors: 64.
Go to moving target quadruped
Regularization constant: .
Number of actors: 32.
Go to moving target humanoid
Regularization constant: .
Go to K targets quadruped
Actor and critic learning rate: .
default policy target network update period: .
Regularization constant: .
Move 1 box to 1 target jumping ball
Default
Move 1 box to 1 target quadruped
Actor and critic learning rate: .
Move 1 box to one of 2 targets quadruped
Actor and critic learning rate: .
default policy target network update period: .
Move 1 box to one of 2 targets with go to another one quadruped
Same as previous task.
Move 1 box to one of 3 targets quadruped
Same as previous task.
Foraging jumping ball
Actor and critic learning rate: .
Actor network: LSTM with one hidden unit of size .
Critic network: LSTM with one hidden unit of size .
Batch size: 48.
Number of actors: 64.
Foraging quadruped
Unroll length: 20
Regularization constant: .
For the Foraging quadruped task, the initial agent did not learn, so we used a slightly different version of the agent. In algorithm 2, we essentially learn a function and update the policy by sampling actions from it and backpropagating through . In this algorithm, we learn a value function using Vtrace (Espeholt et al., 2018) and the policy is updated using an offpolicy corrected policy gradient with empirical returns.
Appendix E Continuous Control: Additional results
e.1 Dense reward tasks
In order to understand in more detail the regularization provided by the default policy we study its effect in dense reward tasks. In Figure 9 we show results for the go to moving target task when the reward provided is proportional to the inverse distance between the walker and the target. For the quadruped body, the gain provided by the default policy disappears (Fig. 9 left). For the humanoid body regularization against the default policy appears to provide an initial gain but subsequently slows down learning. This may be due to the fact that the humanoid typically first learns to stand (corresponding to a reward of roughly 200) before beginning to navigate to the target. The regularization provided by the default policy may slow down the second stage of learning. This is supported by the fact that decaying the influence of the default policy as learning progresses leads to gains compared to both fixed regularization and baseline. Figure 10 shows results for additional tasks with dense rewards. Overall, benefits of the default policy are much less clear cut or absent compared to the sparse reward case. One possible explanation is that the dense reward provides a strong learning signal everywhere in state space. Thus the policy learns quickly while the default policy lags behind and the benefit of generalization across the state space is limited. Also, a dense and hence more “prescriptive” reward may be less compatible with a default behavior.
e.2 Sparse reward jumping ball
The results for the sparse reward tasks with jumping ball are given in figure 10. We observe little difference when using a default policy compared to the baseline. We hypothesize that for the simple action space (3 action dimensions) considered in these experiments the regularization effect of the default policy on the stateconditional action distribution is limited. .
e.3 Sparse reward with quadruped additional results
In this section, we provide more results for the sparse reward tasks. In figure 12 the results for going to one of K targets task with quadruped are presented. The proprioceptive default policy gives significant gains comparing to others. What interesting is that when the number of targets increases, the baseline performance drops dramatically, whereas the proprioceptive default policy solve the task reliably. Our hypothesis is that the default policy learns quickly the default walking behavior which becomes very helpful for the agent to explore the floor and search for the target.
We also provide the results for move box to one of K targets task, where , and move box to one of two targets task with go to another. The results are given in figure 13. Similar effect occurs here.
e.4 Additional transfer results
In this section, we provide additional transfer experiment results for the range of the tasks. They are given in figure 14. In the first two cases we see that proprioceptive default policy from the go to target task gives a significant boost to the performance comparing to the learning from scratch. We also observe, that for the box pushing tasks, the default policy with the box position significantly speeds up learning comparing to other cases. We believe it happens because this default policy learns the best default behavior for these tasks possible: going to the box and push it. For the most complicated task, move one box to one of two targets and go to another one, 14, right, the box default policy makes a big difference: it makes the policy avoid being stuck in go to target behavior (line with reward of 10).
Additional results for the transfer experiments are given in figure 14. We observe the same effect happening: whereas the baseline performance drops significantly, the agent with default policy stays
e.5 Ablation Walls quadruped
Ablations for the walls quadruped are given in figure 15.
Comments
There are no comments yet.