I MITATING H UMAN B EHAVIOUR WITH D IFFUSION M ODELS
Anonymous authors
Paper under double-blind review
A BSTRACT
Diffusion models have emerged as powerful generative models in the text-toimage domain.
This paper studies their application as observation-to-action models for imitating human behaviour in sequential environments.
Human behaviour is stochastic and multimodal, with structured correlations between action dimensions.
Meanwhile, standard modelling choices in behaviour cloning are limited in their expressiveness and may introduce bias into the cloned policy.
We begin by pointing out the limitations of these choices.
We then propose that diffusion models are an excellent fit for imitating human behaviour, since they learn an expressive distribution over the joint action space.
We introduce several innovations to make diffusion models suitable for sequential environments; designing suitable architectures, investigating the role of guidance, and developing reliable sampling strategies.
Experimentally, diffusion models closely match human demonstrations in a simulated robotic control task and a modern 3D gaming environment.
I NTRODUCTION
To enable Human-AI collaboration, agents must learn to best respond to all plausible human behaviors (Dafoe et al., 2020; Mirsky et al., 2022).
In simple environments, it suffices to generate all possible human behaviours (Strouse et al., 2021) but as the complexity of the environment grows this approach will struggle to scale.
If we instead assume access to human behavioural data, collaborative agents can be improved by training with models of human behaviour (Carroll et al., 2019).
In principle, human behavior can be modelled via imitation learning approaches in which an agent is trained to mimic the actions of a demonstrator from an offline dataset of observation and action tuples.
More specifically, Behaviour Cloning (BC), despite being theoretically limited (Ross et al., 2011), has been empirically effective in domains such as autonomous driving (Pomerleau, 1991), robotics (Florence et al., 2022) and game playing (Ye et al., 2020; Pearce and Zhu, 2022).
Popular approaches to BC restrict the types of distributions that can be modelled to make learning simpler.
A common approach for continuous actions is to learn a point estimate, optimised via Mean
Squared Error (MSE), which can be interpereted as an isotropic Gaussian of negligible variance.
Another popular approach is to discretise the action space into a finite number of bins and frame as a classification problem, with the average of each bin output at test time.
These both suffer due to the approximations they make (illustrated in Figure 1), either encouraging the agent to learn an ‘average’ policy or predicting action dimensions independently resulting in ‘uncoordinated’ behaviour (Ke et al., 2020).
[Figure]
Such simplistic modelling choices can be successful when the demonstrating policy is itself of restricted expressiveness (e.g. when using trajectories from a single pre-trained policy represented by a simple model.)
However, for applications requiring cloning of human behaviour, which contains diverse trajectories and multimodality at decision points, simple models may not be expressive enough to capture the full range and fidelity of behaviours (Orsini et al., 2021).
For these reasons, we seek to model the full distribution of actions observed.
In particular, this paper focuses on diffusion models, which currently lead in image, video and audio generation (Saharia et al., 2022; Harvey et al., 2022; Kong et al., 2020), and avoid issues of training instability in generative adversarial networks (Srivastava et al., 2017), or sampling issues with energy based models (Florence et al., 2022).
By using diffusion models for BC we are able to: 1) more accurately model complex action distributions (as illustrated in Figure 1); 2) significantly outperform state-of-the-art methods (Shafiullah et al., 2022) on a simulated robotic benchmark; and 3) scale to modelling human gameplay in Counter-Strike: Global Offensive - a modern, 3D gaming environment recently proposed as a platform for imitation learning research (Pearce and Zhu, 2022).
To achieve this performance, we contribute several innovations to adapt diffusion models to sequential environments.
Section 3.2 shows that good architecture design can significantly improve performance.
Section 3.3 then shows that Classifier-Free Guidance (CFG), which is a core part of text-to-image models, surprisingly harms performance in observation-to-action models.
Finally,
Section 3.4 introduces novel, reliable sampling schemes for diffusion models.
The appendices include related work, experimental details, as well as further results and explanations.
M ODELLING C HOICES FOR B EHAVIOURAL C LONING
In this section we examine common modelling choices for BC.
For illustration purposes, we created a simple environment to highlight their limitations.
We simulated an arcade toy claw machine, as shown in Figures 1, 3 & 4.
An agent observes a top-down image of toys ( o ) and chooses a point in the image, in a 2D continuous action space, a ∈ R 2 .
If the chosen point is inside the boundaries of a valid toy, the agent successfully obtains the toy.
To build a dataset of demonstrations, we synthetically generate images containing one or more toys, and uniformly at random pick a single demonstration action a that successfully grabs a toy (note this toy environment uses synthetic rather than human data).
The resulting dataset is used to learn ˆ p ( a | o ) .
To make training quicker, we restrict the number of unique observations o to seven, though this could be generalised.
MSE.
A popular choice for BC in continuous action spaces approximates p ( a | o ) by a point-estimate that is optimised via MSE.
This makes a surprisingly strong baseline in the literature despite its simplicity.
However, MSE suffers from two limitations that harm its applicability to our goal of modelling the full, complex distributions of human behaviour.
1) MSE outputs a point-estimate.
This precludes it from capturing any variance or multimodality present in p ( a | o ) .
Due to its optimisation objective, MSE learns the ‘average’ of the distribution.
This can bias the estimate towards more frequently occurring actions, or can even lead to out-of-distribution actions (e.g. picking the action between two modes).
The first can be partially mitigated by instead assuming a Gaussian distribution, predicting a variance for each action dimension and sampling from the resulting Gaussian.
However, due to the MSE objective, the learnt mean is still the average of the observed action distribution.
These limitations are visualised in Figure 1.
Discretised.
A second popular choice is to discretise each continuous action dimension into B bins, and frame it as a classification task.
This has two major limitations.
1) Quantisation errors arise since the model can only output a single value for each bin. 2)
Since each action dimension is treated independently, the marginal rather than the joint distribution is learnt.
This can lead to issues during sampling whereby dependencies between dimensions are ignored, leading to ‘uncoordinated’ behaviour.
This can be observed in Figure 1 where points outside of the true distribution have been sampled in the bottom-right corner.
This can be remedied by modelling action dimensions autoregressively, but these models bring their own challenges and drawbacks (Lin et al., 2021).
K-Means.
Another method that accounts for dependencies between action dimensions, first clusters the actions across the dataset into K bins (rather than B | a | ) using K-Means.
This discretises the joint-action distribution, rather than the marginal as in ‘Discretised’.
Each action is then associated with its nearest cluster, and learning can again be framed as a classification task.
This approach avoids enumerating all possible action combinations, by placing bins only where datapoints exist.
However two new limitations are introduced: 1) Quantisation errors can be more severe than for ‘Discretised’ due to only K action options.
The choice of K can be critical to performance (Guss et al., 2021).
If K is small, important actions may be unavailable to an agent; if K is large, learning becomes difficult.
Additionally, since the bins are chosen with respect to the entire dataset they can fall outside of the target distribution for a given observation.
This is observed in Figure 1.
K-Means+Residual.
Shafiullah et al.
(2022) extended K-Means by learning an observationdependent residual that is added to the bin’s center and optimised via MSE.
This increases the fidelity of the learnt distribution.
However, it still carries through some issues of K-Means and
MSE.
The distribution p ( a | o ) is still modelled by a finite number of point estimates (maximum of K ).
The residual learns the ‘average’ of the actions that fall within each bin.
In addition, it still requires a careful choice of the hyperparameter K.
Diffusion models.
The limitations of these existing modelling choices all arise from approximations made in the form of ˆ p ( a | o ) , combined with the optimisation objective.
But it is precisely these approximations that make training models straightforward (optimising a network via MSE or crossentropy is trivial!).
So how can we learn p ( a | o ) while avoiding approximations?
We propose that recent progress in generative modelling with diffusion models provides an answer.
Diffusion models are able to output expressive conditional joint distributions, and are powerful enough to scale to problems as complex as text-to-image or video generation.
Thus, we will show they provide benefits when imitating human demonstrations as they make no coarse approximations about the action distribution, and avoid many of the limitations of the previously discussed choices.
This can be observed in Figure 1, where only diffusion provides an accurate reconstruction of the true action distribution.
O BSERVATION - TO -A CTION D IFFUSION M ODELS
Diffusion models have largely been developed for the image domain.
This section first introduces the underlying principles of diffusion models, then studies several aspects that require consideration to apply them to sequential environments.
3. D IFFUSION M ODEL O VERVIEW
Diffusion models are generative models that map Gaussian noise to some target distribution in an iterative fashion, optionally conditioned on some context (Dhariwal and Nichol, 2021).
Beginning from, a T ∼ N ( 0 , I ) , a sequence a T − 1 , a T − 2 . . .
a 0 is predicted, each a slightly denoised version of the previous, with a 0 a ‘clean’ sample.
Where T is the total number of denoising steps ( not the environment timestep as is common in sequential decision making).
This paper uses denoising diffusion probabilisitic models (Ho et al., 2020).
During training, noisy inputs can be generated as: a τ = √ ¯ α τ a + √ 1 − ¯ α τ z , for some variance schedule ¯ α τ , random noise z ∼ N ( 0 , I ) .
A neural network, ϵ ( · ) , is trained to predict the noise that was added to an input, by minimising:
[Equation]
where the expectation is over all denoising timesteps, τ ∼ U [1 , T ] , and observations and actions are drawn from a demonstration dataset, o , a ∼ D .
At sampling time, with further variance schedule parameters α τ & σ , inputs are iteratively denoised: [Equation]
[Equation]
A RCHITECTURAL D ESIGN
This section explores neural network architectures for observation-to-action diffusion models.
Specifically, the requirements of the network are: Input: Noisy action a τ − 1 ∈ R | a | , denoising timestep τ , observation o (possibly with a history); Output: Predicted noise mask, ˆ z ∈ R | a | .
While U-Nets have become standard components of text-to-image diffusion models, their use only makes sense for large, spatial input and outputs, while we require generation of an action vector of modest dimensionality.
Therefore, we now describe three architectures of varying complexity.
Section 4 empirically assesses these three architectures, finding performance improvements in this order: Basic MLP < MLP Sieve < Transformer.
Basic MLP.
This architecture directly concatenates all relevant inputs together, [ a τ − 1 , o , τ ] .
This input is fed into a multi-layer perceptron (MLP).
This is similar to the network used by Wang et al.
(2022) in concurrent work exploring the use of diffusion models for reinforcement learning.
MLP Sieve.
This uses three embedding networks to produce embeddings of the observation, denoising timestep, and action: o e , t e , a eτ − 1 ∈ R embed dim .
These embeddings are concatenated together as input to a denoising network, [ o e , t e , a eτ − 1 ] .
The denoising network is a fully-connected architecture, with residual skip connections, and with the raw denoising timestep τ and action a τ −repeatedly concatenated after each hidden layer.
To include a longer observation history, previous observations are passed through the same embedding network, and embeddings are concatenated together.
Transformer.
This creates embeddings as for MLP Sieve.
A multi-headed attention architecture (Vaswani et al., 2017) (as found in modern transformer encoder networks) is then used as the denoising network.
At least three tokens are used as input, o e , t e , a eτ − 1 , and this can be extended to incorporate a longer history of observations (only the current t e , a eτ − 1 are needed since the diffusion process is Markovian).
Sampling rate.
The MLP Sieve and Transformer are carefully designed so the observation encoder is separate from the denoising network.
At test time, this means only a single forward pass is required for the observation encoder, with multiple forward passes run through the lighter denoising network.
This results in a manageable sampling time – in the experiment playing a video game from pixels (section 4.2), we were able to roll out our diffusion models at 8Hz on an average gaming GPU (NVIDIA GTX 1060 Mobile).
Note that sampling time is a more severe issue in text-toimage diffusion models, where forward passes of the heavy U-Net architectures are required for all denoising timesteps.
3. W HY C LASSIFIER -F REE G UIDANCE F AILS
Classifier-Free Guidance (CFG) has become a core ingredient for text-to-image models, allowing one to trade-off image typicality with diversity (Ho and Salimans, 2021).
In CFG, a neural network is trained as both a conditional and unconditional generative model.
During sampling, by introducing a ‘guidance weight’ w , one places a higher weight ( w > 0 ) on the prediction conditioned on some context (here, o ), and a negative weight on the unconditional prediction,
[Equation]
One might anticipate that CFG would also be beneficial in the sequential setting, with larger w producing trajectories of higher likelihood, but at the cost of the diversity.
Surprisingly, we find that
CFG can actually encourage less common trajectories, and degrade performance.
[Figure] In Figure 3 we visualise ˆ p ( a | o ) for the claw machine game, under varying guidance strengths, w .
An interpretation of CFG is that it encourages sampling of actions that would maximise an implicit classifier, p ( o | a ) .
Hence, CFG encourages selection of actions that were unique to a particular observation (Ho et al., 2022).
Whilst this is useful for text-to-image models (generate images that are more specific to a prompt), in sequential environments this leads to an agent rejecting higherlikelihood actions in favour of less usual ones that were paired with some observation.
In later experiments (section 4.1) we demonstrate empirically that this can lead to less common trajectories being favoured, while degrading overall performance.
Appendix E provides a didactic example of when CFG fails in this way.
3. R ELIABLE S AMPLING S CHEMES
In text-to-image diffusion, several samples are typically generated in parallel, allowing the user to select their favourite, and ignore any failures.
However, when rolling out an observation-to-action diffusion model, such manual screening is not feasible.
There remains a risk that a bad action could be selected during a roll-out, which may send an agent toward an out-of-distribution state.
Hence, we propose ‘Diffusion-X’ and ‘Diffusion-KDE’ as variants of Diffusion BC, that mirror this screening process by encouraging higher-likelihood actions during sampling.
For both methods, the training procedure is unchanged (only the conditional version of the model is required).
The algorithms for all sampling methods are given in appendix D.
Diffusion-X. The sampling process runs as normal for T denoising timesteps.
The denoising timestep is then fixed, τ = 1 , and extra denoising iterations continue to run for M timesteps.
The intuition behind this is that samples continue to be moved toward higher-likelihood regions for longer.
Diffusion-KDE.
Generate multiple action samples from the diffusion model as usual (these can be done in parallel).
Fit a simple kernel-density estimator (KDE) over all samples, and score the likelihood of each.
Select the action with the highest likelihood.
[Figure]
The effect of these sampling modifcations is demonstrated in Figure 4.
While Diffusion BC generates a small number of actions that fall outside of the true p ( a | o ) region, Diffusion-X and DiffusionKDE avoid these bad actions.
Note that the two distinct modes in the figure are recovered by both sampling methods, suggesting that multimodality is not compromised, though the diversity within each mode is reduced.
Both techniques are simple to implement, and experiments in Section 4 show their benefit.
E XPERIMENTS
This section empirically investigates the efficacy of diffusion models for BC.
We assess our method in two complex sequential environments, which have large human datasets available, with the aim of answering several questions: Q1)
How do diffusion models compare to existing baseline methods for BC, in terms of matching the demonstration distribution?
Section 4.1 compares to four popular modelling choices in BC, as well as recent state-of-the-art models.
Section 4.2 provides further focused comparisons.
Q2)
How is performance affected by the architectures designed in section 3.2, CFG, and the sampling schemes in section 3.4?
We provide full ablations in Section 4.1, and targeted ablations over sampling schemes in Section 4.2. Q3)
Can diffusion models scale to complex environments efficiently?
Section 4.2 tests on an environment where the observation is a high-resolution image, the action space is mixed continuous & discrete, and there are strict time constraints for sampling time.
Evaluation.
To evaluate how closely methods imitate human demonstrations, we compare the behaviours of our models with those of the humans in the dataset.
To do so, we will compare both at a high-level, analysing observable outcomes (e.g. tasks completions or game score), as well as at a low-level comparing the stationary distributions over states or actions.
Both of these are important in evaluating how humanlike our models are, and provide complimentary analyses.
Appendix B provides details on our evaluation metrics, which are introduced less formally here.
Baselines.
Where applicable we include Human to indicate the metrics achieved by samples drawn from the demonstration dataset itself. We then re-implement five baselines.
Three correspond to popular BC modelling choices, namely MSE : a model trained via mean squared error; Discretised : each action dimension is discretised into 20 uniform bins, then trained independently via crossentropy; and K-means : a set of K candidate actions are first produced by running K-means over all actions, actions are discretised into their closest bin, and the model is trained via cross-entropy.
A further two baselines can be considered strong, more complex methods, namely K-means+Residual : as with K-means, but additionally learns a continuous residual on top of each bin prediction, trained via MSE, which was the core innovation of Behaviour Transformers (BeT)
(Shafiullah et al., 2022); and EBM : a generative energy-based model trained with a contrastive loss, proposed in (Florence et al., 2022), with full details about the challenges of this method given in Appendix B.4.
One of our experiments uses the set up from Shafiullah et al.
(2022), allowing us to compare to their reported results, including Behaviour Transformers (BeT) : the K-mean+residual combined with a large 6-layer transformer, and previous 10 observations as history; Implicit BC : the official implementation of energy-based models for BC (Florence et al., 2022); SPiRL : using a VAE, originally from Pertsch et al. (2021); and PARROT : a flow-based model, originally from Singh et al.
Architectures & Hyperparameters.
We trial the three architecture options described in Section 3.2, which are identical across both the five re-implemented baseline methods and our diffusion variants (except where required for output dimensionality).
Basic MLP and MLP Sieve both use networks with GELU activations and 3 hidden-layers of 512 units each.
Transformer uses four standard encoder blocks, each with 16 attention heads.
Embedding dimension is 128 for MLP Sieve and Transformer.
Appendix B gives full hyperparameter details.
4. L EARNING R OBOTIC C ONTROL FROM H UMAN D EMONSTRATION
In this environment, an agent controls a robotic arm inside a simulated kitchen.
It is able to perform seven tasks of interest, such as opening a microwave, or turning on a stove (Appendix B contains full details).
The demonstration dataset contains 566 trajectories.
These were collected using a virtual reality setup, with a human’s movements translated to robot joint actuations (Gupta et al.,
Each demonstration trajectory performed four predetermined tasks.
There are 25 different task sequences present in the dataset, of roughly equal proportion.
This environment has become a popular offline RL benchmark for learning reward-maximising policies (Fu et al., 2020).
However, as our goal is to learn the full distribution of demonstrations, we instead follow the setup introduced by Shafiullah et al.
(2022), which ignores any goal conditioning and aims to train an agent that can recover the full set of demonstrating policies.
The kitchen environment’s observation space is a 30-dimensional continuous vector containing information about the positions of the objects and robot joints.
The action space is a 9-dimensional continuous vector of joint actuations.
All models receive the previous two observations as input, allowing the agent to infer velocities.
For diffusion models, we set T = 50 .
The kitchen environment is challenging for several reasons.
1) Strong (sometimes non-linear) correlations exist between action dimensions.
There is multimodality in p ( a | o ) at the point the agent selects which task to complete next, and also in how it completes it.
We show that our diffusion model learns to represent both these properties in Figure 9, which visualises relationships between all action dimensions during one rollout.
4.1. M AIN R ESULTS
Comparing the behaviour of our agents with that of the humans demonstrations is a challenging research problem in its own right.
Table 1 presents several metrics that provide insight into how closely models match the human demonstrations – from high-level analysis of task sequences selected, to low-level statistics of the observation trajectories generated by models.
We briefly summarise these, more technical descriptions can be found in Appendix B. Training and sampling times of methods are given in Table 6.
Tasks ≥ 4.
We first measure the proportion of rollouts for which models perform four valid tasks, which nearly all human demonstrations achieve.
Tasks Wasserstein.
For each method we record how many times each different task sequence was completed during rollouts.
The Wasserstein distance is then computed between the resulting histogram, compared to the human distribution.
Time Wasserstein.
As well as analysing which tasks were completed, we also analyse when they were completed.
Figure 5 plots the distribution of the time taken to complete different numbers of tasks (normalised to exclude failures), for MSE and Diffusion-X. We then compute the Wasserstein distance between the human and agent distributions (see Appendix C for a full break down.)
State Wasserstein.
If we truly capture the full diversity and fidelity of human behaviour present in the dataset, this will be reflected in the state occupancy distribution.
We compute the Wasserstein between agent and human distributions, with a lower value indicating they are more similar.
Density & Coverage.
We use the ‘Density’ and ‘Coverage’ metrics from Naeem et al.
(2020) that are used to evaluate GANs.
Roughly speaking ‘Density’ corresponds to how many states from human trajectories are close to the agent’s states and ‘Coverage’ corresponds to the proportion of human states that have an agent generated state nearby.
In terms of task-completion rate, our Diffusion BC approaches outperform all baselines, with the ordering; Diffusion BC <
Diffusion X < Diffusion-KDE.
This ordering supports our hypothesis that these sampling schemes more reliably avoid bad actions.
These improvements come at the cost of increased sampling time – for MLP Sieve, sampling rate drops from 16 Hz for Diffusion BC to
Hz for Diffusion-X to 12 Hz for Diffusion-KDE. For all Wasserstein metrics, diffusion models again outperform other baselines, and sampling schemes are usually ordered Diffusion KDE <
Diffusion BC <
Diffusion-X.
This is important; while
Diffusion-KDE completes more tasks, it signals a tendency to overfit to a smaller number of task sequences, generating less of the diversity from the demonstration distribution.
This is quantitatively confirmed by Diffusion-KDE scoring significantly higher Density, but lower Coverage.
Architecture ablation.
In terms of the different architectures designed in Section 3.2, Table 1 shows that metrics usually improve in order: Basic MLP < MLP Sieve <
Transformer.
These improvements [Table] [Figure] et al
[Figure] do come at the cost of increased training and inference time – for Diffusion BC the sampling rate drops from 24 Hz for MLP Basic to 16 Hz for MLP Sieve to 4 Hz for transformer.
4.1. C LASSIFIER F REE G UIDANCE A NALYSIS
Section 3.3 provided intuition for why we expect CFG to fail in observation-to-sequence models.
We now test our hypotheses empirically.
During training the observation embedding is randomly masked with zeros with probability 0.1.
This allows us to learn both a conditional and unconditional generative model.
We then perform rollouts under different guidance weights, w ∈ { 0 , 1 , 4 , 8 } , measuring the rate of completion of 4 tasks and monitoring which task the agent completes first.
Table 2 shows that completion rate drops from 0.63 without guidance ( w = 0 ) to 0.08 with strong guidance ( w = 8 ).
Meanwhile, CFG also creates a strong bias towards selection of Bottom Burner as the first task.
This is significant as the human demonstrators select Bottom Burner just 10% of the time, but this increases from 7% (no guidance, w = 0 ) to 25% (strong guidance, w = 8 ), showing that CFG encourages less usual trajectories.
[Table]
M ODELLING H UMAN G AMEPLAY IN A V IDEO G AME
We further tested our models in the environment ‘Counter-Strike: Global Offensive’ (CSGO) introduced by Pearce and Zhu (2022).
CSGO is one of the world’s most popular video games in player and spectator numbers.
We use the ‘aim train’ environment, where a player is fixed on a platform in the center of a map, and must defend themselves against enemies controlled by built-in AI, who rush towards the player.
Success requires precise and coordinated control over a mixed continuous & discrete action space, as well as dealing with multimodality in target selection and aiming.
The demonstration dataset contains 45,000 observation/action tuples, recorded from a high-skill human player.
Observations are 280 × 150 RGB images, and the action space is three dimensional – mouse x ∈ R , mouse y ∈ R , left click ∈ { 0 , 1 } .
The environment runs asynchronously at a fixed rate, providing a rigorous test of sampling speed of models.
Due to this constraint, we test only the
MLP Sieve architecture, which offers a good trade-off between inference speed and performance.
We also exclude the slightly slower Diffusion-KDE sampling method.
T is set to 20.
For baselines, we compare to MSE, discretised, and K-Means+Residual which were the strongest baselines in the kitchen environment. We also include EBM using derivative-free optimisation.
We consider two options for the observation encoder: 1) a lightweight CNN, and 2) a ResNet18 with ImageNet weights.
Diffusion models use 20 denoising timesteps, and Discrete uses 20 bins per action dimension.
For MSE, we optimise the left click action via binary cross-entropy and mouse x & y via MSE.
Appendix B provides further details on hyperparameters and metrics.
Table 3 reports results.
Diffusion-X performs best across both observation encoders in terms of game score and distance to the human distribution, which was measured as the Wasserstein distance on the actions predicted (grouped into sequences of different lengths to assess the temporal consistency). Training and sampling times of methods are given in Table 6.
Diffusion-X runs at 18 Hz compared to 200 Hz for MSE. Training time is similar.
[Table]
D ISCUSSION & C ONCLUSION
This paper provided the first thorough investigation into using diffusion models for imitating human behaviour.
Existing modelling choices in BC make various approximations that simplify the learning problem.
But these approximations come at a cost: they introduce limitations and biases on the cloned policy, which we systematically identified in section 2.
Recent developments in generative modelling for images have shown that diffusion models are capable of learning arbitrarily complex conditional distributions, and are stable to train.
This paper has combined these two worlds, proposing that diffusion models are also an excellent fit for learning the complex observation-to-action distributions found in datasets of humans behaving in sequential environments.
Our key insight is that, unlike many modelling choices for BC, diffusion models make no coarse approximations on the target distribution, so avoid many of their shortcomings. Diffusion models do come with several limitations.
They increase inference time – MSE model can sample actions at 666 Hz and 200 Hz in the kitchen and CSGO environments, while Diffusion BC samples at 16 Hz and 32 Hz.
They also introduce several new hyperparameters.
Finally, diffusion models address only one challenge in imitation learning – that of learning complex action distributions at a single environment timestep.
There are other open challenges they do not address such as learning correlations across environment timesteps.
This paper contributed several innovations to successfully adapt diffusion models to the observationto-action domain.
Our experiments demonstrated the effectiveness of these with several key takeaways. 1) Diffusion models offer improvements over other methods in matching the demonstrations in terms of reward and distribution. 2) Reliable sampling schemes Diffusion-X and Diffusion-KDE offer benefits over Diffusion BC. Good architecture design is important to the success of Diffusion models, allowing trade-off of performance and sampling speed.
4) CFG should be avoided when using diffusion agents in sequential environments.
Experiments support our hypothesis that, by avoiding coarse approximations about the action distribution, diffusion models improve over existing methods at modelling human demonstrations.
On a complex control task, diffusion models achieved a task completion rate of 89%, exceeding recent state-of-the-art of 44%.
We also demonstrated that our models can scale to learn directly from image observations, on a mix of continuous and discrete actions, sampling actions at 18 Hz.
This demonstrates the possibility of applying our models in complex, real-world settings
R EPRODUCIBILITY S TATEMENT
If accepted for publication, we aim to open source code to reproduce results in all environments by the time of the conference.
A E XTENDED R ELATED W ORK
Implicit BC.
Florence et al.
(2022) formulated BC as a conditional energy-based modeling problem.
They showed that the ability of energy-based policies to represent multimodal distributions and discontinuous functions can provide competitive results with state-of-the-art offline reinforcement learning methods.
Our paper is complimentary to this work, continuing the investigation on expressive models, studying the fit of diffusion models for BC.
As well as showing that they can outperform state-of-the-art baselines in terms of score, we also show they outperform in closeness to the demonstration distribution, which was not explored by Florence et al.
We note that diffusion models avoid some of the challenges of energy-based models – they remove the requirement to generate negative samples during training, and avoid some of the complexities in the sampling process that energy-based models face.
Transformer + BC.
Although there are multiple works using transformers for RL, in this section we only consider approaches that use transformers for BC, where no interaction with the environment is allowed, and only state-action trajectories and no reward signal are available in a dataset, for which the existing literature is scarce.
Reed et al.
(2022) proposed GATO, an agent that could model different input modalities, including text, images and behaviour policies.
However, they focused on demonstrating multitask capabilities, rather than on on how to do BC efficiently.
GATO relies on discretisation, which can lead to inaccurate actions due to quantisation errors (see Sec. 2); and on autoregressive predictions, which can lead to repetitive and out of distribution trajectories (Holtzman et al., 2019).
Shafiullah et al.
(2022) proposed a transformer based BC method that implements the KMeans+Residual approach discussed in Sec. 2.
This is done by using two heads, one with a categorical loss for predicting the centroid of the cluster to which the action belongs; and the other one with an MSE loss to predict the ‘residual’, that is the distance from the centroid to the action.
This resulted in a discrete approximation of the policy.
Although having limitations, it was able to outperform other approximations in a number of environment, using both human and synthetic data.
Here, we focus on generative modelling with diffusion models, evaluating the impact of different neural network architectures and different sampling schemes, and showing they are expressive enough to model the policy without implicit approximations, outperforming previous approaches, including discretisation and K-Means+Residual.
Diffusion models.
One main difference with previous works on diffusion models is that in order to obtain high quality samples, they relied on guiding the sampling process, either by using an expensive classifier (Dhariwal and Nichol, 2021), or by training a conditional and an unconditional model together (Ho and Salimans, 2021).
However, as explained in Sec. 3.2, guidance can bias sampling towards low likelihood trajectories, which is problematic for BC applications, so in order to obtain high quality and high likelihood samples, we introduce two novel guidance-free methods.
RL and Diffusion Models.
Up to our knowledge, the only previous work that used diffusion models for RL is by Janner et al.
(2022) who proposed Diffuser: a model that predicts all states and actions of a complete trajectory; and uses classifier-like guidance for trajectory optimization and
similar
U-Net architectures to those from text-to-image diffusion models (Ramesh et al., 2022; Saharia et al., 2022), replacing the spatial convolutions with temporal convolutions.
The main limitation of Diffuser is that sampling complete trajectories is computationally expensive, especially since the trajectory has to be re-sampled at each timestep (open-loop).
Hence, it was demonstrated for environments with low-dimensional state-action sets.
Our model is able to generate a trajectory by sampling one step at a time (closed loop).
Combined with replacing U-Nets with other architectures like MLPs and transformer, this enables learning from high-dimensional states like images.
Concurrent to our work, Wang et al.
(2022) uses a conditional diffusion model with an MLP to predict a single action at a time conditioned on the current state.
However, their focus is on trajectory optimization, relying on bootstrapping to learn a value function that is used for (classifier-like) guidance, and test their approach in environments with low dimensional state sets.
Here, we focus on BC, for which we observe guidance can bias the sampling towards low-likelihood trajectories, so we introduce two novel guidance-free conditional sampling methods.
In addition, we explore the impact of multiple architectures, including transformers, and demonstrate their performance even under high-dimensional state sets.
Imitation Learning (IL).
This paper lies under the IL paradigm (Hussein et al., 2017), in particular the line of work that frames IL as matching the state-action occupancy distribution in the dataset, which is related to Inverse RL (Ho and Ermon, 2016; Ghasemipour et al., 2020; Ke et al., 2020).
Indeed, we use diffusion models as a practical BC approach that optimise a variational bound of the usual BC objective (which can be interpreted as minimising the forward KL w.r.t.
to the experts distribution Ghasemipour et al.
Ke et al.
, but, as discussed in Sec. 2, diffusion models are able to approximate multimodal distributions, surmounting one major limitation of previous BC methods (Ke et al., 2020), especially when working with real world datasets from multiple demonstrators.
Finally, similarly to Dadashi et al.
Hussenot et al.
(2021), we compute the Wasserstein distance between the occupancy distributions as an evaluation criteria.
B E XPERIMENTAL D ETAILS B. C LAW ENVIRONMENT
The claw environment consists of seven unique pictures, each with different combination of valid toys to pick.
To create the dataset, we pick one of the seven images at random, and then pick a demonstration action from the true p ( a | o ) .
The final dataset consists of 20000 such demonstrations.
Figure 8 shows full comparison of all methods in the seven different images.
Each individual point represents one sample from the trained model when it is given the image observation o .
We train all methods for 100 epochs with a batch size of 32 , using Adam optimizer and a decaying learning rate starting from 0 . 0001 .
We use 50 diffusion steps for the diffusion models.
We set
K = 10 for K-Means clustering.
B. K ITCHEN
The seven tasks of interest are: open the microwave (‘microwave’), move kettle onto a stove (‘kettle’), turn on the bottom stove (‘bottom burner’), turn on the top stove (‘top burner’), turn on a light-switch (‘light-switch’), open a sliding cabinet (‘slide cabinet’), open a swinging door (‘hinge cabinet’).
For each method we train 3 different seeds, and roll out 100 trajectories of length 280 for evaluation.
K-Means Transformer only has a single seed.
Time Wasserstein:
For each method the histogram over the number of timesteps taken to complete
N tasks is computed.
For each tasks, the Wasserstein distance between the the histogram of the model’s timesteps and the humans is computed.
We then average those Wassersteins across alltasks.
In the situation where a method did not ever complete 4 tasks, we leave the entry blank.
State-based Wasserstein: We are approximating the Wasserstein between the stationary distributions over the state space of the human dataset and our models: W ( ρ AGENT ( s ) , ρ HUMAN ( s )) .
To do so we produce a ‘dataset’ for each method by concatenating the states for all 100 trajectories (similarly for the humans).
We then turn these into the empirical distributions by having a uniform mass over each data point.
We then use the POT library’s emd2 function (Flamary et al., 2021) to compute the Wasserstein distance, using the L 2 cost function between the 30 dimensional entries.
To produce the sub-sampled human dataset, we pick 100 trajectories uniformly without replacement from the human dataset.
We do this 5 times.
Density and Coverage:
We use the Density and Coverage metrics proposed in Naeem et al.
(2020), and compute them using the code provided by the authors.
We use the human dataset as the set of real state samples, and our model’s rollouts as the fake state samples.
We use 10 nearest neighbours for the calculation.
Hyperparameters.
Neural network architectures were identical across all methods (except for the final linear layer which allows for differing output dimensionality).
Basic MLP and MLP Sieve used three hidden-layers of 512 nodes and GELU activations.
Embedding dimension of observation, action, and timestep was fixed at 128.
Embedding networks were single hidden-layer MLPs with 128 nodes, using leaky ReLU activations except for the timestep encoder which used Sinusoidal activations.
The Transformer used four encoding blocks, each with 16 self-attention heads and an internal embedding dimension of 64.
All models receive the previous two observations as history.
Other hyperparameters were kept consistent across methods as far as possible.
Initial experimentation showed that methods did not suffer from overfitting, and as default we trained models forepochs with a cosine learning rate decay.
MLP models used a learning rate of 1e-3 and batchsize of 512, while transformer models used a learning rate of 5e-4 and batchsize of 1024.
We set K =for K-means and discretised used 20 bins per action dimension.
We made extensive efforts to bring performance of K-means+residual inline with that reported in
Shafiullah et al.
Our best settings used a fixed learning rate of 1e-4, with K = 64 , though this still gave a task completion rate of 0.34, which falls slightly below 0.44 as originally reported.
The difference might be explained by the larger network used by Shafiullah et al.
(2022) – 6 layers, and an observation history of 10 steps.
Note we also tested hyperparameters as reported in their paper (50 epochs, batchsize of 64), but this provided worse performance for us.
For diffusion models, we set T = 50 and standard β schedules linearly decaying in [1e-4, 0.02].
(Note that the variance schedule parameters α t , ¯ α t and σ t introduced in Section 3 are derived from this β schedule.)
For Diffusion-X, M = 8 .
For Diffusion-KDE, we first sample 100 actions, and fit a Gaussian KDE model (width=0.4) from scikit-learn 1 .
Models were rolled out with 100 random seeds.
Each episode lasted 280 timesteps as in Shafiullah et al.
(2022) – 98% of humans completed their assigned four tasks within this time.
B. CSGO
Game Score: Frags-per-minute, as reported by Pearce and Zhu (2022).
Action-based Wasserstein: Similarly to the Kitchen environment above, we are approximating the stationary distribution over the action space of the human dataset and our models:
W ( ρ AGENT ( a ) , ρ HUMAN ( a )) .
For 1xtimesteps , we compute this in the same way as the state-based Wasserstein above, using
POT’s emd2 and the L 2 cost between the 3 dimensional entries.
For 16xtimesteps and 32xtimesteps , for each timestep we concatenate the 16 (andtimesteps respectively) following it into a single vector.
If there are not enough timesteps left in the trajectory, then we do not use that timestep.
We compute the Wasserstein in the exact same manner as before on these higher dimensional entries.
Hyperparameters.
Neural network architectures were unchanged from the Kitchen experiments, except for the observation encoder, for which we tested two options.
A lightweight 6-layer CNN that operates directly on the frames stacked together.
A ResNet18 with ImageNet weights – the four stacked frames are passed through this independently.
The output is then concatenated together and passed through two vanilla convolutional layers.
Following average pooling, an embedding vector of length 128 is output.
Unlike in the Kitchen environment, we found models were sensitive to but tested models both midway through training (250 epochs) and at the end (500 epochs).
For the
ResNet encoder, we trained with a fixed learning rate of 1e-4 for a maximum of 100 epochs, but tested models every 20 epochs.
All methods were best with either 60 or 80 training epochs.
For diffusion models, we set T = 20 and standard β schedules linearly decaying in [1e-4, 0.02].
For
Diffusion-X, M = 16 .
For K-Means+Residual, we use K = 64 .
Following Pearce and Zhu (2022), episodes were defined as 10 minutes of playing time.
The original data was collected at 16Hz with the game running in real-time.
We altered the game setting so that it runs at half speed, allowing our models to roll out at 8Hz.
It was possible to increase this to 10Hz for diffusion BC.
B. E NERGY -B ASED M ODEL I MPLEMENTATION
We re-implemented two versions of the Energy-Based Model’s (EBM’s) described in Implicit BC (Florence et al., 2022): 1) Derivative-free optimisation (‘Deriv-free’) and 2) Langevin MCMC (‘Langevin’).
Whilst we made efforts to run both of these in all three of our environments (Claw,
Kitchen, and CSGO), we were unable to produce rudimentary results in many combinations but document our experiences here.
Ultimately we reported EBM Deriv-free in Claw (Figure 8), Kitchen (Table 1 & 4) and CSGO (Table 3), and EBM Langevin on the Claw only (Figure 8).
Other combinations failed to produce any reward. Derivative-Free Optimisation. This follows Algorithm 1 of (Florence et al., 2022). At training time, negative examples are sampled uniformly from the action space, and a contrastive loss is optimised.
At sampling time, a derivative-free optimisation scheme is used (reminiscent of particleswarm optimisation).
We used the following hyperparameters by default: number counter examples=256, number inference samples=16000, number optimising iterations=3, optimising noise=0.33, noise decay=0.5.
In our experience this method performed reasonably in lower dimensional environments.
In the
Claw (Figure 8), we could recover a fair approximation of the true p ( a | o ) distributions, although there is a segmentation effect.
To understand why this occurs, we plotted the energy mesh over the whole action space in Figure 6, where we can observe halo-like effects at the edges of objects, explaining this.
Derivative-free worked poorly in the kitchen environment which has a 9 dimensional action space, only occasionally completing two tasks and never more.
This was also observed in Florence et al.
(2022), which showed that Derivative-free failed when action dimensionality exceeded six.
Since CSGO’s action space is of dimension three, we thought Derivative-free may perform reasonably, though we were only able to recover a rudimentary performance level as in Table 3.
Sampling times of Derivative-free were reasonable (Table 6), generally falling between diffusion models and MSE, though it slowed down training significantly since it requires drawing many neg- ative samples for each datapoint in a batch – this also sometimes reduced the maximum batchsize that could be used (since it effectively gets multiplied).
Langevin MCMC.
This follows the description in Appendix B.3 of Florence et al.
(2022), along with the gradient penalty in B.3.1.
Negative samples are partially optimised at training time, by backpropagating gradients to the action samples.
At sampling time, the same gradient-based optimisation procedure is run for longer.
Florence et al.
(2022) state that this method should handle higher-dimensional action spaces well.
We used the following hyperparameters by default: number counter examples=32, noise scale = 0.5, learning coefficient start = 0.05, learning coefficient end = 0.005, number mcmc iterations during training=100, extra mcmc iterations during sampling=100, M=1.
We were unable to get this method working well in any of our environments.
Figure 7 shows the energy landscapes learnt in the Claw. We found it produced energy functions that were overly smooth. Also, at sampling time, many samples would get stuck in local maxima at the edges of the action space. A fundamental issue with the approach is that the negative samples become less ‘negative’ over the course training as the model learns the energy function.
This creates distribution drift in the training data and a less stable optimisation objective. In initial experiments, Langevin failed to solve any tasks in the Kitchen or CSGO.
Both training and sampling from Langevin are far slower than any other method (Table 6) – training requires running an MCMC chain for many iterations for negative samples (set as default to 100).
Sampling requires double this number of steps, and additionally cannot be performed within torch.nograd() , since the gradients are required for optimisation. C F URTHER R ESULTS
Observation o
[Figure]
o ) MSE
Gaussian
Discretised
K-Means K-Means+Res.
EBM Deriv.-Free EBM Langevin
Diﬀusion
[Figure]
[Table] [Table]
[Table]
t = 0 .
Initialised state.
Two modes can be made out in some action dimensions (e.g. dim 6), representing the choice between reaching for the kettle and microwave.
[Figure]
t = 11 .
The gripper begins moving towards the kettle and distributions become unimodal.
[Figure]
t = 27 .
The gripper initiates fine grasping of the kettle handle, which requires careful coordination between the grippers, which manifests as strong correlation between action dim 8 & 9.
[Figure]
t = 63 .
Strong linear and non-linear correlations between certain dimensions can be observed as the gripper pulls away from the kettle.
[Figure]
t = is distributions can be seen in action dimension 1 & representing the decision point for the selection of the next
[Figure]
t = 96 .
The decision to move towards the bottom burner has been made, so action distributions become unimodal again.
[Figure]
D S AMPLING A LGORITHMS
1: a T ∼ N ( 0 , I ) 2: for τ = T, . . .
, 1 do 3: z ∼ N ( 0 , I )
if τ > 1 , else z =4: a τ − 1 = 1 √ α τ (cid:16) a τ − 1 − α τ √ 1 − ¯ α τ ϵ θ
( a τ , τ, o ) (cid:17) + σ τ z 5: end for 6: return a
1: a T ∼ N ( 0 , I ) 2: for τ = T, . . . , 1 − M do 3: z ∼ N ( 0 , I ) if τ > 1 , else z =4: a τ − 1 = 1 √ α τ (cid:16) a τ − 1 − α τ √ 1 − ¯ α τ ϵ θ ( a τ , max( τ, 1) , o ) (cid:17) + σ τ z [Table]
: end for
[Table]
: return a − M
[Table]
E C LASSIFIER -F REE G UIDANCE A NALYSIS
CFG can be interpreted as guiding the denoising sampling procedure towards higher values of p ( o | a ) (Ho et al., 2022).
Given this interpretation, we now provide a grid-world to show concretely why this can lead to sampling of less common trajectories in a sequential environment.
Figure 10 shows an environment with four discrete states and a discrete action.
The action space allows three ego-centric options; turn left, turn right or continue straight forward. Agents are always initialised at state 0, giving observation o 0 , and rolled out for exactly two timesteps, visiting state 1 and ending in state 2 or 3. The figure shows the empirical action distributions in a demonstration dataset.
In states 0, 2 & 3, the agent always selects straight.
But in state 1, the agent makes a right turn with 0.1 probability.
Let o 1 , o 2 and o 3 denote the observations given by states 1, 2 and 3, respectively.
We can apply Bayes rule to find p ( o | a ) , which will provide an understanding of what behaviour CFG induces. We are interested in the learnt behaviour at the decision point o 1 , [Equation]
Given the agent starts in state 0 and is rolled out for two timesteps (sees three states), and p ( a = Turn right | o 1 ) = 0 .
1 , p ( a = straight | o 1 )
= 0 .
9 , we find the marginal probability of each observation,
[Equation]
Hence, the marginal action distribution is,
[Equation]
+ 1 / 3 · 0 .
9 + 1 / 3 . We can now compute the quantities p ( o 1 | a ) , p ( o 1 | a = Turn right ) = p ( a = Turn right | o 1 ) p ( o 1 ) p
[Equation]
Turn right )
[Equation]
(12) p ( o 1 | a = Straight ) = p
[Equation]
= Straight | o
[Equation]
p
[Equation]
o
[Equation]
p
[Equation]
As such, since CFG favours actions that maximise p ( o | a ) , the CFG agent will select the less frequently visited right-hand path more often.