M ODEL -B ASED R EINFORCEMENT L EARNING VIA L ATENT -S PACE C OLLOCATION
Anonymous authors
Paper under double-blind review
A BSTRACT
The ability to plan into the future while utilizing only raw high-dimensional observations, such as images, can provide autonomous agents with broad and general capabilities.
However, realistic tasks may require handling sparse rewards and performing temporally extended reasoning, and cannot be solved with only myopic, short-sighted planning.
Recent work in model-based reinforcement learning (RL) has shown impressive results using heavily shaped reward functions that require only short-horizon reasoning.
In this work, we study how techniques trajectory optimization can enable more effective long-horizon reasoning.
We draw on the idea of collocation-based planning and adapt it to the image-based setting by leveraging probabilistic latent variable models, resulting in an algorithm that optimizes trajectories over latent variables.
Our latent collocation method (LatCo) provides a general and effective approach to longer-horizon visual planning.
Empirically, our approach signiﬁcantly outperforms prior model-based approaches on challenging visual control tasks with sparse rewards and long-term goals.
I NTRODUCTION
In order for autonomous agents to perform complex tasks in open-world settings, they must be able to process high-dimensional sensory inputs, such as images, and reason over long horizons about the potential effects of their actions.
Recent work in model-based reinforcement learning (RL) has shown impressive results in autonomous skill acquisition directly from image inputs, demonstrating beneﬁts such as learning efﬁciency and improved generalization.
While these advancements have been largely fueled by improvements on the modeling side – from better uncertainty estimates and incorporation of temporal information (Ebert et al., 2017), to the explicit learning of latent representation spaces (Hafner et al., 2019) – they leave much room for improvement on the planning and optimization side.
Most of the current best-performing deep learning approaches for vision-based planning use only gradient-free action sampling as the underlying optimizer, and are typically applied to settings where a dense and well-shaped reward signal is available.
In this work, we argue that more powerful planners are necessary for longer-horizon reasoning.
With this goal of long-horizon planning, we aim to extend the myopic planning behavior of existing visual planning methods.
Whether it’s to avoid local minima due to short-sightedness, or to reason further into the future in order to solve multi-step or sparse-reward tasks, this ability to perform long-horizon planning is critical.
Many of the current state-of-the-art visual planning approaches use gradient-free sampling-based optimization methods such as shooting (Ebert et al., 2018; Nagabandi
Collocation jointly optimizes dynamics satisfaction constraints as well as rewards.
This ability to violate dynamics allows for the rapid discovery of high-reward regions (where the object is next to the goal), while the subsequent reﬁnement of the planned trajectory focuses on feasibly achieving it.
et al., 2020); as shown in Figure 8, these approaches can get stuck when they must reason further into the future.
Here, the curse of dimensionality in conjunction with a lack of shaped reward signal can prevent greedy planning methods from succeeding.
Instead, we look to the gradient-based optimization approach of collocation, where crucially, dynamics satisfaction constraints are optimized jointly with the rewards.
As shown in Figure 1, this ability to violate dynamics constraints and imagine even impossible trajectories enables collocation to explore much more effectively and take shortcuts through the optimization landscape in order to learn about high-reward regions before ﬁguring out how to get to those regions.
In contrast to shooting approaches, or even to gradient-based approaches such as backpropagating rewards through model predictions, this ability to violate dynamics greatly helps to prevent getting stuck in local minima while still avoiding the need for special dense or shaped reward signals.
Collocation, as introduced above, can provide many beneﬁts over other optimization techniques, but it has thus far been demonstrated (Ratliff et al., 2009; Mordatch et al., 2012; Schulman et al., 2014) mostly in conjunction with known dynamics models and when performing optimization over states.
In this work, we are interested in autonomous skill acquisition directly from image inputs, where both the underlying states as well as the underlying dynamics are unknown.
Na¨ıvely applying collocation to this visual planning setting would lead to intractable optimization, due to the high-dimensional as well as partially observed nature of images, in addition to the fact that only a thin manifold in the pixel space constitutes valid images.
Instead, we draw from the representation learning literature and leverage latent dynamics models, which learn a latent representation of the observations that is not only Markovian but also compact and lends itself well to planning.
In this learned latent space, we propose to perform collocation over states and actions with the joint objective of maximizing rewards as well as minimizing dynamics violations.
Bridging control theory literature with modern deep-RL techniques for learning from images, we propose in this work to perform collocation in a learned latent space in order to enable effective long-horizon planning.
The main contribution of this work is an algorithm for latent-space collocation (LatCo), which is an efﬁcient model-based RL approach for solving challenging planning tasks that works directly from image observations by leveraging collocation in a learned latent space.
To the best of our knowledge, our paper is the ﬁrst to scale collocation to visual observations, thus enabling longer-horizon reasoning in model-based RL.
In our experiments, we analyze various aspects of our algorithm, and we demonstrate our approach signiﬁcantly outperforming prior model-based approaches on visual control tasks that require longer-horizon planning with sparse rewards.
R ELATED W ORK
Model-based reinforcement learning.
Recent work has scaled model-based reinforcement learning to complex systems leveraging powerful neural network dynamics models (Chua et al., 2018;
Nagabandi et al., 2020), while showing signiﬁcant data efﬁciency improvements over model-free agents.
Further, these neural network models can be scaled to high-dimensional image observations using convolutional architectures (Ebert et al., 2018; Hafner et al., 2019).
However, despite these successes in building better predictive models, planning with these black-box neural network dynamics remains a challenge.
While this prior work used simple trajectory optimization techniques like derivative-free shooting, we propose to leverage the more powerful collocation methods.
Latent Planning.
Other works have considered different optimization methods such as iterative
Linear-Quadratic Regulator (iLQR)
(Watter et al., 2015; Zhang et al., 2019).
However, these approaches require specialized locally-linear predictive models, and still rely on shooting and local search in the space of actions, which is prone to local minima.
Instead, our collocation approach can be used with any latent state model, and is able to optimize in the state-space, which we show often enables us escape local minima and plan better trajectories.
Another line of work relied on graph-based optimization (Kurutach et al., 2018;
Savinov et al., 2018;
Eysenbach et al., 2019; Liu et al., 2020) or tree search (Schrittwieser et al., 2019; Parascandolo et al., 2020), while we use continuous optimization, which is more suitable for continuous control.
Recent work has designed hierarchical planning methods that plan over extended periods of time by considering intermediate subgoals (Nair & Finn, 2019; Nasiriany et al., 2019;
Pertsch et al., 2020).
These approaches are orthogonal to our trajectory optimization method, but they present many possible synergies as collocation can be naturally used in hierarchical approaches.
Many of these methods (Buesing et al.,
2018; Hafner et al., 2019; 2020) used latent state-space models for improved prediction quality and reduced computational requirements.
Our proposed method leverages this latent state-space design to construct an effective trajectory optimization method with collocation, and we design our method to be model-agnostic, such that it can beneﬁt from improved latent variable models in the future.
Collocation-based planning.
Collocation is a powerful optimal control technique for trajectory optimization (Hargraves & Paris, 1987; Witkin & Kass, 1988) that optimizes a sequence of states for the sum of expected reward, while eventually enforcing the constrained that the optimized trajectory conform to a dynamics model (also see Kelly (2017) for a recent tutorial).
Prior work in optimal control has explored many versions of collocation for complex motion planning tasks, including
Hamiltonian optimization (Ratliff et al., 2009), contact-invariant optimization (Mordatch et al., 2012), sequential convex programming (Schulman et al., 2014), as well as stochastic trajectory optimization (Kalakrishnan et al., 2011).
We note that in this paper we will use the terms ”trajectory optimization” and ”planning” synonymously referring to this type of approaches.
These works have demonstrated good results in controlling complex simulated characters, such as humanoid robots, contact-heavy tasks, and tasks with complex constraints.
Our work is most similar to that of Schulman et al.
(2014), however, all this prior work assumed availability of a ground truth model of the environment.
Some recent works have attempted using collocation with learned neural network dynamics models (Bansal et al., 2016; Du et al., 2019), but it only considered simple low-dimensional dynamics.
In this work, we address how to scale up collocation methods to high-dimensional image observations, where direct optimization over images is intractable.
We propose to do this by utilizing a learned latent space representation.
B ACKGROUND
Our method combines collocation methods for trajectory optimization with latent variable models, in order to make it possible to optimize paths over compact and Markovian latent states.
We separately review collocation methods and latent state models in this section.
3. T RAJECTORY OPTIMIZATION WITH COLLOCATION
Given a dynamics model s t +1 = f
( s t , a t ) that predicts the next state given the previous state and action, a reward function r ( s t ) , and the current state s 1 , the problem of trajectory optimization is to select actions that maximize the total reward:
[Equation]
Shooting methods optimize this objective directly with respect to the actions.
However, this is known to be poorly conditioned due to recursive application of the dynamics function, which results in vanishing or exploding gradients.
Instead, we can leverage the structure of the problem to construct an objective that only has pairwise dependencies between temporally adjacent states, and no recursive application of the model.
To this end, collocation methods formulate the trajectory optimization problem in Equation 1 as a constrained optimization problem, optimizing over sequences of actions and states, while ensuring that the constraint imposed by the dynamics model f is satisﬁed:
[Equation]
This constrained optimization problem, under some regularity conditions, can be solved with a primal dual approach, which can be formulated as the following saddle point problem:
[Equation]
In practice, we can address this problem with numerical optimization, taking alternating maximization and minimization steps.
This collocation approach is better conditioned, as it is able to exploit
the
Markovian property of the state-space and remove the recursive application of the model.
The dynamics constraint only needs to be evaluated on each pair of temporally adjacent states (see Fig 2, right).
Further, the dynamics constraint can be relaxed in the beginning of the optimization, leading the method to rapidly discover high-reward state space regions (potentially violating the dynamics),
LatCo optimizes a sequence latent states z 2: T , a 1: T to maximize rewards r ( z t as well as satisfy dynamics z t +1 = µ ( z t , a t ) .
This joint optimization allows to relax the dynamics constraint early on, which helps escape local minima.
In contrast, shooting methods require recursive application of the dynamics and backpropagation through time, which is often difﬁcult to optimize and then gradually modifying the trajectory to be more dynamically consistent, as illustrated in
Figure 1.
This is in contrast to shooting-based approaches, which suffer from severe local optima in long horizon tasks, since the algorithm must simultaneously drive the states toward the high-reward regions and discover the actions that will get them there.
The ability to disentangle these two stages by ﬁrst ﬁnding the high-reward region and only then optimizing for the actions that achieve that reward allows collocation methods to solve more complex and temporally extended tasks while suffering less from local optima (Ratliff et al., 2009; Mordatch et al., 2012; Schulman et al., 2014).
3. L ATENT V ARIABLE M ODELS
The design of predictive models for high-dimensional visual observations is challenging.
Recent work has proposed learning latent state-space models that represent the observations in a compact latent space.
Speciﬁcally, this work learns a latent space z t , a latent dynamics model p θ ( z t +1 | z t , a t ) , and decoding models that can be used to decode the observation p θ ( o t | z t ) and the reward r ( z t ) from the latent variable (see Fig. 2, left).
This approach is powerful due to the use of high-capacity neural network latent dynamics models, and is computationally efﬁcient as the latent space is compact.
Importantly, the Markov property of the latent variable can be enforced, allowing a convenient interpretation of the latent state-space as the belief state (Hafner et al., 2019; Buesing et al., 2018).
A probabilistic latent variable model can then be trained, by maximizing the likelihood of the observed rewards r 1: T and images o 1: T .
While maximizing the exact likelihood is often intractable, we can construct and optimize a variational lower bound on it using a variational distribution q θ ( z t +1 |
o t +1 , a t , z t ) (Chung et al., 2015; Fraccaro et al., 2016):
[Equation]
L ATENT C OLLOCATION (L AT C O )
Our aim is to design a collocation method that can be used to produce near-optimal trajectories from raw image observations.
A na¨ıve approach would learn a dynamics model over images, and directly optimize an image sequence using Eq (2).
However, such as method would be impractical for several reasons.
First, the optimization over images would make the problem more difﬁcult due to the high dimensionality of the images and the fact that valid images lie on a thin manifold.
Second, images typically do not constitute a Markovian state space, violating the assumptions of the method.
We propose to instead learn a Markovian and compact state space by means of a latent variable model, and then use this learned state space for collocation.
Latent state models.
To make visual collocation scalable, we leverage the latent state-space dynamics model described in Section 3.2.
Following Hafner et al.
(2019); Denton & Fergus (2018)
, we implement this model with convolutional neural networks for the encoder and decoder, and a recurrent neural network for the transition dynamics.
The latent state of this model includes a stochastic component with a conditional Gaussian transition function, and the hidden state of the recurrent neural network with deterministic transitions.
The model is shown in Fig.
2 (left).
Latent space collocation.
We adapt the collocation procedure described in Section 3.1 into the probabilistic latent state setting.
Instead of optimizing a sequence of observations, we optimize a sequence of latent variables z 2: T and actions a 1: T .
Since the latent state space model predicts the reward directly from the latent state z t using an approximation r ( z t ) , we never need to decode images during the optimization procedure, which makes it memory-efﬁcient.
We adapt the collocation algorithm to use probabilistic dynamics by enforcing that the next latent state is the mean of the distribution predicted by the model: z t +1 =
E p θ ( z t +1 | z t ,a t )
[ z t +1 ] , where the expectation is given simply as the mean of the Gaussian z t +1 = µ ( z t , a t ) .
Other approaches are possible, such as maximizing the likelihood of the latent state, but these require introduction of additional balance hyperparameters, while our constrained optimization approach automatically tunes this balance.
We visualize the collocation procedure in Fig 2 and provide the detailed algorithm as Algorithm 1.
1: Start with any available data D 2: while not converged do 3: for each environment step t = 1 . . .
T tot with step T cache do 4:
Infer latent state:
z t ∼ q ( z t | o t ) 5:
Deﬁne the Lagrangian:
L ( z t +1: t + H , a t : t + H , λ ) = (cid:88) t (cid:104) r
( z t ) − λ dyn t
( || z t +1 − µ ( z t , a t )
|| 2 − (cid:15) )
− λ act t max (0 , | a t | − a m ) 2 (cid:105) 6: for each optimization step k = 1 . . .
K do 7:
Update plan: z t +1: t + H , a t : t + H :=
z t +1: t + H , a t : t + H + ˜ ∇L (cid:46) Eq (5) 8:
Update dual variables: λ t : t + H :
= U PDATE ( L , λ t : t + H ) (cid:46) Eq (6) 9:
Execute a t : t + T cache in environment: o t : t + T cache , r t : t + T cache ∼ p env 10:
Add episode to replay buffer: D :
= D ∪ ( o 1: T tot , a 1: T tot , r 1: T tot ) 11: for training iteration i = 1 . . .
It do 12:
Sample minibatch from replay buffer: ( o 1: T , a 1: T , r 1: T ) 1: b ∼ D 13:
Train dynamics model: θ :=
θ + α ∇L ELBO ( o 1: T , a 1: T , r 1: T ) 1: b (cid:46) Eq (4)
O PTIMIZATION FOR L ATENT C OLLOCATION
The latent collocation framework described in the previous section can be used with any optimization procedure, such as gradient descent or Adam (Kingma & Ba, 2015).
However, using appropriate optimization methods is important when time constraints are a factor.
We found that the choice of the optimizer for both the latent states and the Lagrange multipliers has a large inﬂuence on runtime performance.
We detail our speciﬁc implementation below.
Levenberg-Marquardt optimization.
We use the Levenberg-Marquardt optimizer for the states and actions, which pre-conditions the gradient direction with the matrix ( J T J ) − 1 , where J is the Jacobian of the objective with respect to the states and actions.
This preconditioner approximates the Hessian inverse, signiﬁcantly improving convergence speed:
[Equation]
The Levenberg-Marquardt optimizer has cubic complexity in the number of optimized dimensions.
However, by noting that the Jacobian of the problem has a block-tridiagonal structure, we can implement a more efﬁcient optimizer that scales linearly with the planning horizon (Mordatch et al.,
This efﬁcient version of the optimizer converges 10-100 times faster than na ¨ ıve gradient descent on wall clock time in our experiments.
The Levenberg-Marquardt algorithm optimizes the sum of squares (cid:80) i ρ 2 i , deﬁned in terms of residuals ρ .
Any bounded objective can be expressed in terms of residuals by a combination shifting and square root operations.
For the dynamics objective, we use the z t +1 − µ ( z t , a t ) differences as residuals directly, with one residual per state dimension.
For the action objective, we use max(0 , | a t |− a m ) .
For the reward objective, form residuals by passing the negative reward through a softplus operation: ρ = ln(1 + e − r ) .
Constrained optimization.
The Lagrange multipliers control the balance between the strength of the dynamics constraint and the reward.
For fast optimization, it is crucial that the Lagrange multipliers be updated fast when the dynamics constraint is not yet optimized, but the update magnitude should decrease over time to ensure smooth convergence as the dynamic violation converges to zero.
We therefore design an update rule that scales with the relative difference between the current dynamics constraint ||
z t +1 − µ ( z t , a t ) ||
and the target constraint (cid:15) , such that the update is large when the constraint violation is large and vice versa.
We found the following rule to work well in our experiments:
[Equation]
where η = 0 .
01 is used to ensure numerical stability.
We found that using a small non-zero (cid:15) is beneﬁcial for the optimization and ensures fast convergence, as the exact constraint might be hard to reach.
We additionally constrain the planned actions to be within the environment range using the same constrained optimization procedure.
E XPERIMENTS
Our evaluation aims to test the effectiveness of our method on performing long-horizon MBRL from images by answering the following questions: (1) Does LatCo produce effective and feasible plans from visual inputs?
(2) Can LatCo solve complex simulated robotic tasks with sparse rewards?
How does LatCo compare to trajectory optimization methods used in state-of-the-art visual planning algorithms?
(4) What is the effect of LatCo allowing dynamics violations during optimization?
6. E XPERIMENTAL S ETUP
We evaluate our method on three visual tasks (see Fig.
3): Obstacle , a navigation environment with an obstacle, Sawyer Reach , a robotic reaching task, Sawyer Push , a robotic pushing task.
The ﬁrst of these tasks is a custom environment, while the last two are from the Meta-World benchmark (Yu et al., 2020).
All tasks only provide the agent with image inputs and no access to underlying state of the simulator.
The Obstacle environment consists of an image-based 2D navigation task where the agent must reach a goal on the other side of a wall.
The reward deﬁned is the negative distance to the goal.
The agent plans over a planning horizon H = 30 steps, executes every action
T cache = 30 , T tot = 30 , and results are averaged over 100 runs.
In the Sawyer Reach task, a 7-DoF
Sawyer arm needs to reach the goal.
For this task, H = 30 , T cache = 30 , T tot = 150 .
In the Sawyer
Push task, a 7-DoF Sawyer arm needs to push an object (puck) on the table to the goal.
For this task,
H = 40 , T cache = 20 , T tot = 120 .
In both Sawyer tasks, we use a sparse reward of 1 for reaching the goal and 0 otherwise.
In particular, for the push task, there is no special reward shaping to encourage the arm to go toward the puck.
The arm is initialized to its default position, and results are averaged over 20 runs.
We train all methods online according to Algorithm 1.
The hyperparameters used in the experiments are detailed in Appendix A.
6. D OES L AT C O PRODUCE EFFECTIVE PLANS ON SPARSE - REWARD VISUAL CONTROL TASKS ?
In our ﬁrst set of experiments, we evaluate how well LatCo can solve image-based control tasks from sparse rewards, where effectively reasoning is success
As shown in Figure 3, LatCo is indeed able to perform collocation in a learned latent space in order to successfully produce plans that solve these tasks, with effective longerhorizon reasoning.
In these results, we see LatCo (top) avoiding local minima that would arise from myopic planners, (middle) extending to higherdimensional control tasks while still operating only from image inputs, and (bottom) reasoning into the future and succeeding even when the sparse task reward provides no direct incentive to go toward the object.
H OW DOES
L AT C O COMPARE TO ALTERNATIVE SHOOTING - BASED APPROACHES ?
To speciﬁcally ascertain the beneﬁts of collocation, we must determine whether the beneﬁts of LatCo stem from gradient-based optimization, from optimizing over states, or both.
Therefore, we include a prior method based on zeroth-order CEM optimization, PlaNet (Hafner et al., 2019), which is representative of a broader class of shooting-based methods (Ebert et al., 2018;
Nagabandi et al., 2020), as well as a gradient-based method that optimizes actions directly using the objective in Eq. 1, which we denote GD actions .
To provide a fair comparison that isolates the effects of different planning methods, we use the same dynamics model architecture for all agents.
From Table 1, we observe that LatCo exhibits superior performance to shooting-based methods on all three tasks.
On the Sawyer Reach task, shooting fails to ﬁnd a successful trajectory most of the time due to a lack of local reward signal.
LatCo, on the other hand, solves this task consistently.
The Sawyer Push task is challenging for all of the methods, as the dynamics are more complex and requires accurate long-term predictions to correctly optimize the sparse signal.
Speciﬁcally, there is no partial reward for reaching down to the object, so the planner has to look ahead into the high reward state and reason backwards that it needs to approach the object.
As shown in Fig.
4, shooting-based methods altogether fail to solve this task, not reaching for the object in any run.
LatCo
[Table]
[Table]
outperforms them by a considerable margin, achieving a 29% success rate.
It is worth noting that even in the unsuccessful runs [Table] LatCo plans often display goal-reaching behaviors, as can be seen in
Fig.
However, signiﬁcant room for improvement for MBRL still remains on this task.
In addition, to evaluate the different methods in a more controlled setup [Table] we test them on the same model trained with ofﬂine data in Table 2 and App.
C 6. T HE E FFECT OF A LLOWING D YNAMICS V IOLATIONS
tions of planned over the course of optimization steps on the obstacle task.
Earlier on, the planner explores high-reward regions, converging to the goal state.
Eventually, as the dynamics constraint is enforced, the plan becomes feasible, while maintaining a high predicted reward.
In this section, we analyze the ability of our method to temporarily violate dynamics in order to effectively plan for long-term reward.
We show the dynamics violation costs and the predicted rewards associated with the planned trajectories over the course of optimization quantitatively in Fig.
5 and qualitatively in Figs. 1, 8.
Since the dynamics constraint is only gradually enforced with the increase of the Lagrange multipliers, the ﬁrst few steps of optimization allow for dynamics violations in order to focus on discovering the high-reward region (corresponding to steps 0 to 20 in Fig. 5).
In the later steps of the optimization, the reward is relaxed and the constraints are optimized until the trajectory becomes feasible.
C ONCLUSION
We presented LatCo, an algorithm for latent collocation that improves performance of visual-model based reinforcement learning agents.
In contrast to the commonly used shooting-based methods,
LatCo performs powerful trajectory optimization and is able to plan for tasks where prior work fails, such as long-horizon and sparse reward tasks.
By improving the planning capabilities of visual model-based reinforcement learning agents and removing the need for reward shaping, LatCo enables these agents to scale to complex tasks more easily and with less manual instrumentation.
Future work will examine improvements to the collocation procedure, such as Hamiltonian (Ratliff et al., 2009) or stochastic (Kalakrishnan et al., 2011) optimization.
Further, collocation can be applied with variety of latent variable models, including specialized models with more structure.
Finally, we believe the ability to perform reinforcement learning in state space as opposed to action space opens up many new avenues for algorithmic development, such as in imitation learning or hierarchical reinforcement learning.
A M ODEL A RCHITECTURE AND T RAINING D ETAILS
We use the latent dynamics and reward models from PlaNet (Hafner et al., 2019) with default hyperparameters.
We set the image size to 64x64 and action repeat to 1 for both pointmass and Meta-World models.
For every N =episode collected, we train for It = 15 iterations
The pointmass models are trained with episode length 30 and β KL = 0 .
1 , while the Meta-World models are trained with episode length 150 and β KL = 1 .
All models are trained on a single high-end GPU.
B P LANNING D ETAILS
CEM.
we optimize for 100 iterations.
In each iteration, 10000 action sequences are sampled and the distribution is reﬁt to the 100 best samples
GD.
we optimize for 500 iterations using the
Adam optimizer with learning rate 0.05.
We use dual descent to penalize infeasible action predictions.
The Lagrange multipliers are updated every 5 optimization steps.
LatCo.
we optimize for 200 iterations using the Levenberg-Marquardt optimizer with damping 10 − 3 .
The damping parameter controls the trust region, with smaller or zero damping speeding up convergence, but potentially leading to numerical instability or divergence.
The Lagrange multipliers are updated every step using the rule from Section 5, with (cid:15) = 10 − 5 and η = 0 .
The threshold (cid:15) directly controls the magnitude of the ﬁnal dynamics and action violations.
In general, we found this parameter to be important for good performance, as a large threshold may cause infeasible plans, while low threshold would make the initial relaxation of the dynamics constraint less effective.
However, we observed that a single threshold of 10 − 5 works for all of our environments.
A larger η makes the optimization more aggressive but less stable, and a smaller η diminishes the effect of multiplier updates.
We initilalize λ dyn 0 = 1 , λ act 0 = 1 .
These planning hyperparameters remain ﬁxed across the experiments as we observe that reward optimization converges in all cases.
Planning a 30-step trajectory takes 12, 14, and 14 seconds for
CEM, GD, and LatCo respectively on a single RTX 2080Ti graphics card.
We trained the online models for 24 hours each.
C A DDITIONAL EXPERIMENTAL RESULTS
Ofﬂine training.
In Section 6.3, we have evaluated our algorithm in the online training regime, where each agent needs to collect the entire dataset from scratch by executing the policy in the environment.
To further test whether collocation is beneﬁcial for planning in a controlled setup, we have performed ofﬂine training experiments, where a single model trained with ofﬂine data is tested with different planning algorithms.
This experiment further shows the applicability of our method to ofﬂine setting without additional data collection.
We collect the ofﬂine data by training an oracle agent that observes dense reward, avoiding the exploration issue.
We pre-collect 200K steps of this data for all tasks.
For the Sawyer Push task, we collect an additional 200K environments steps of online interaction data according to Algorithm 1 as none of the methods were able to solve the task with ofﬂine data only.
We use the same hyperparameters as in Section 6.3 otherwise.
Table 2 shows the results of this experiment.
We see that collocation outperforms shooting methods in this controlled setup, showing that it is better able to exploit a dynamics model trained ofﬂine.