D IFFUSION P OLICIES AS AN
E
XPRESSIVE
P OLICY
C LASS FOR O FFLINE R EINFORCEMENT L EARNING
Anonymous authors
Paper under double-blind review
A BSTRACT
Ofﬂine reinforcement learning (RL), which aims to learn an optimal policy using a previously collected static dataset, is an important paradigm of RL.
Standard RL methods often perform poorly in this regime due to the function approximation errors on out-of-distribution actions.
While a variety of regularization methods have been proposed to mitigate this issue, they are often constrained by policy classes with limited expressiveness that can lead to highly suboptimal solutions.
In this paper, we propose representing the policy as a diffusion model, a recent class of highly-expressive deep generative models.
We introduce Diffusion Qlearning (Diffusion-QL) that utilizes a conditional diffusion model to represent the policy.
In our approach, we learn an action-value function and we add a term maximizing action-values into the training loss of the conditional diffusion model, which results in a loss that seeks optimal actions that are near the behavior policy.
We show the expressiveness of the diffusion model-based policy, and the coupling of the behavior cloning and policy improvement under the diffusion model both contribute to the outstanding performance of Diffusion-QL.
We illustrate the superiority of our method compared to prior works in a simple 2D bandit example with a multimodal behavior policy.
We then show that our method can achieve state-of-the-art performance on the majority of the D4RL benchmark tasks.
I NTRODUCTION
Ofﬂine reinforcement learning (RL), also known as batch RL, aims at learning effective policies entirely from previously collected data without interacting with the environment (Lange et al., 2012;
Fujimoto et al., 2019).
Eliminating the need for online interaction with the environment makes ofﬂine RL attractive for a wide array of real-world applications, such as autonomous driving and patient treatment planning, where real-world exploration with an untrained policy is risky, expensive, or time-consuming.
Instead of relying on real-world exploration, ofﬂine RL emphasizes the use of prior data, such as human demonstration, that is often available at a much lower cost than online interactions.
However, relying only on previously collected data makes ofﬂine RL a challenging task.
Applying standard policy improvement approaches to an ofﬂine dataset typically leads to relying on evaluating actions that have not been seen in the dataset, and therefore their values are unlikely to be estimated accurately.
For this reason, naive approaches to ofﬂine RL typically learn poor policies that prefer out-of-distribution actions whose values have been overestimated, resulting in unsatisfactory performance (Fujimoto et al., 2019).
Previous work on ofﬂine RL generally addressed this problem in one of four ways: 1) regularizing how far the policy can deviate from the behavior policy (Fujimoto et al., 2019; Fujimoto & Gu, 2021;
Kumar et al., 2019; Wu et al., 2019; Nair et al., 2020; Lyu et al., 2022); 2) constraining the learned value function to assign low values to out-of-distribution actions (Kostrikov et al., 2021a; Kumar et al., 2020); 3) introducing model-based methods, which learn a model of the environment dynamics and perform pessimistic planning in the learned Markov decision process (MDP) (Kidambi et al., 2020; Yu et al., 2021); 4) treating ofﬂine RL as a problem of sequence prediction with return guidance (Chen et al., 2021; Janner et al., 2021; 2022).
Our approach falls into the ﬁrst category.
Empirically, the performance of policy-regularized ofﬂine RL methods is typically slightly worse than that of other approaches, and here we show that this is largely because the policy regularization methods perform poorly due to their limited ability to accurately represent the behavior policy.
This results in the regularization adversely affecting the policy improvement.
For example, the policy regularization may limit the exploration space of the agent to a small region with only suboptimal actions and then the Q-learning will be induced to converge towards a suboptimal policy.
The inaccurate policy regularization occurs for two main reasons: 1) policy classes are not expressive enough; 2) the regularization methods are improper.
In most prior work, the policy is a
Gaussian distribution with mean and diagonal covariance speciﬁed by the output of a neural network.
However, as ofﬂine datasets are often collected by a mixture of policies, the true behavior policy may exhibit strong multi-modalities, skewness, or dependencies between different action dimensions, which cannot be well modeled by diagonal Gaussian policies (Shaﬁullah et al., 2022).
In a particularly extreme, but not uncommon example, a Gaussian policy is used to ﬁt bimodal training data by minimizing the Kullback–Leibler (KL) divergence from the data distribution to the policy distribution.
This will result in the policy exhibiting mode-covering behavior and placing high density in the middle area of the two modes, which is actually the low-density region of the training data.
In such cases, regularizing a new policy towards the behavior-cloned policy is likely to make the policy learning substantially worse.
Second, the regularization, such as the KL divergence and maximum mean discrepancy (MMD) (Kumar et al., 2019), is often not well suited for ofﬂine RL.
The KL divergence needs access to explicit density values and MMD needs multiple action samples at each state for optimization.
These methods require an extra step by ﬁrst learning a behavior cloned policy to provide density values for KL optimization or random action samples for MMD optimization.
Regularizing the current policy towards the behavior cloned policy can further induce approximation errors, since the cloned behavior policy may not model the true behavior policy well, due to limitations in the expressiveness of the policy class.
We conduct a simple bandit experiment in Section 5 which illustrates demonstrates these issues can occur even on a simple bandit task.
In this work, we propose a method to perform policy regularization using diffusion (or score-based) models (Sohl-Dickstein et al., 2015; Song & Ermon, 2019; Ho et al., 2020).
Speciﬁcally, we use a multilayer perceptron (MLP) based denoising diffusion probabilistic model (DDPM)
(Ho et al., 2020) as our policy.
We construct an objective for the diffusion loss which contains two terms: 1) a behavior-cloning term that encourages the diffusion model to sample actions in the same distribution as the training set, and 2) a policy improvement term that attempts to sample high-value actions (according to a learned Q-value).
Our diffusion model is a conditional model with states as the condition and actions as the outputs.
Applying a diffusion model here has several appealing properties.
First, diffusion models are very expressive and can well capture multi-modal distributions.
Second, the diffusion model loss constitutes a strong distribution matching technique and hence it could be seen as a powerful sample-based policy regularization method without the need for extra behavior cloning.
Third, diffusion models perform generation via iterative reﬁnement, and the guidance from maximizing the Q-value function can be added at each reverse diffusion step.
In summary, our contribution is Diffusion-QL, a new ofﬂine RL algorithm that leverages diffusion models to do precise policy regularization and successfully injects the Q-learning guidance into the reverse diffusion chain to seek optimal actions We test Diffusion-QL on the D4RL benchmark tasks for ofﬂine RL and show this method outperforms prior methods on the majority of tasks.
We also visualize the method on a simple bandit task to illustrate why it can outperform prior methods.
R ELATED W ORK
Policy Regularization.
Most prior methods for ofﬂine RL in the class of regularized policies rely on behavior cloning for policy regularization: BCQ (Fujimoto et al., 2019) constructs the policy as a learnable and maximum-value-constrained deviation from a separately learned Conditional-VAE (CVAE, Sohn et al.
(2015)) behavior-cloning model; BEAR (Kumar et al., 2019) adds a weighted behavior-cloning loss via minimizing MMD into the policy improvement step; TD3+BC (Fujimoto & Gu, 2021) applies the same trick as BEAR via maximum likelihood estimation (MLE); BRAC (Wu et al., 2019) evaluates multiple methods for behavior-cloning regularization, such as the KL divergence, MMD, and Wasserstein dual form; IQL (Kostrikov et al., 2021b) is an advantage weighted behavior-cloning method with “in-sample” learned Q-value functions.
Diffusion models in RL.
Diffuser (Janner et al., 2022) applies a diffusion model as a trajectory generator.
The full trajectory of state-action pairs are grouped together to form a single sample for the diffusion model.
A separate return model is learned to predict the cumulative rewards of each trajectory sample.
The guidance of the return model is then injected into the reverse sampling stage.
This approach is similar to Decision Transformer (Chen et al., 2021), which also learns a trajectory generator through GPT2 (Radford et al., 2019) with the help of the true trajectory returns.
When used online, sequence models can no longer predict actions from states autoregressively (since the states are an outcome of the environment).
Thus, in the evaluation stage, a whole trajectory is predicted for each state while only the ﬁrst action is applied, which incurs a large computational cost.
Our approach employs diffusion models for RL in a distinct manner.
We apply the diffusion model to the action space and we form it as a conditional diffusion model with states as the condition.
This approach is model-free and the diffusion model is sampling a single action at a time.
Further, our Q-value function guidance is injected during training, which provides good empirical performance in our case.
While both Diffuser (Janner et al., 2022) and our work apply diffusion models in Ofﬂine RL, Diffuser is from the model-based trajectory-planning perspective while our method is from the ofﬂine model-free policy-optimization perspective.
P RELIMINARIES
Ofﬂine Reinforcement Learning.
The environment in RL is in typically deﬁned by a Markov decision process (MDP): M = { S, A , P, R, γ, d 0 } , with state space S , action space A , environment dynamics P ( s (cid:48) | s , a ) : S × S ×A → [0 , 1] , reward function R : S ×A → R , discount factor γ ∈ [0 , 1) , and initial state distribution d 0 (Sutton & Barto, 2018).
The goal is to learn policy π θ ( a | s ) , parameterized by θ , that maximizes the cumulative discounted reward E [ (cid:80) ∞ t =
γ t r ( s t , a t )] .
The actionvalue or Q-value of a policy π is deﬁned as Q π ( s t , a t ) =
E a t +1 , a t +2 ,... ∼ π
[ (cid:80) ∞ t =
γ t r ( s t , a t )] .
In the ofﬂine setting (Fu et al., 2020), instead of the environment, a static dataset D (cid:44) { ( s , a , r, s (cid:48) ) } , collected by a behavior policy π b , is provided.
Ofﬂine RL algorithms learn a policy entirely from this static ofﬂine dataset D , without online interactions with the environment.
Diffusion Model.
Diffusion-based generative models (Ho et al., 2020; Sohl-Dickstein et al., 2015;
Song & Ermon, 2019) assume p θ ( x 0 ) :
= (cid:82) p θ ( x 0: T ) d x 1: T , where x 1 , . .
, x T are latent variables of the same dimensionality as the data x 0 ∼ p ( x 0 ) .
A forward diffusion chain gradually adds noise to the data x 0 ∼ q ( x 0 ) in T steps with a pre-deﬁned variance schedule β i , expressed as
[Equation]
A reverse diffusion chain, constructed as p θ ( x 0: T ) :
= N ( x T
[Equation]
0 , I ) (cid:81)
Tt =1 p θ ( x t − 1 | x t ) , is then optimized by maximizing the evidence lower bound deﬁned as E q [ln p θ ( x 0: T ) q ( x 1: T | x 0 ) ]
(Jordan et al., 1999; Blei et al., 2017).
After training, sampling from the diffusion model consists of sampling x ∼ p ( x T ) and running the reverse diffusion chain to go from t =
T to t = 0 .
Diffusion models can be straightforwardly extended to conditional models by conditioning p θ ( x t − 1 | x t , c ) .
D IFFUSION Q- LEARNING
Below we explain how we apply a conditional diffusion model as an expressive policy for behavior cloning.
Then, we introduce how we add Q-learning guidance into the learning of our diffusion model in the training stage with the behavior cloning term acting as a form of policy regularization.
4. D IFFUSION POLICY
Notation: Since there are two different types of timesteps in this work, one for the diffusion process and one for reinforcement learning we use superscripts i ∈ { 1 , . .
. , N } to denote diffusion timestep and subscripts t ∈ { 1 , . .
. , T } to denote trajectory timestep.
We represent our RL policy via the reverse process of a conditional diffusion model as
[Equation]
where the end sample of the reverse chain, a 0 , is the action used for RL evaluation.
Generally, p θ ( a i − 1 | a i , s ) could be modeled as a Gaussian distribution N ( a i − 1 ; µ θ ( a i , s , i ) , Σ θ ( a i , s , i )) .
We follow Ho et al.
(2020) to parameterize p θ ( a i − 1 | a i , s ) as a noise prediction model with the covariance matrix ﬁxed as Σ θ ( a i , s , i ) =
β i
I and mean constructed as
[Equation]
We ﬁrst sample a N ∼ N ( 0 , I ) and then from the reverse diffusion chain parameterized by θ as
[Equation]
Following DDPM (Ho et al., 2020), when i = 1 , (cid:15) is set as 0 to improve the sampling quality.
We mimic the simpliﬁed objective proposed by Ho et al.
(2020) to train our conditional (cid:15) -model via
[Equation]
where U is a uniform distribution over the discrete set as { 1 , . .
. , N } and D denotes the ofﬂine dataset, collected by behavior policy π b .
This diffusion model loss L d ( θ ) is a behavior-cloning loss, which aims to learn the behavior policy π b ( a | s ) (i.e. it seeks to sample actions from the same distribution as the training data).
Note the marginal of the reverse diffusion chain provides an implicit, expressive distribution that can capture complex distribution properties, such as skewness and multi-modality, exhibited by the ofﬂine datasets.
In addition, the regularization is sampling-based that only requires taking random samples from both D and the current policy (i.e. this method does not require us to know the behavior policy, which may be infeasible when the dataset is collected by human demonstrations).
Different from the usual two-step strategy, our strategy provides a clean and effective way of applying regularization on a ﬂexible policy.
L d ( θ ) can efﬁciently be optimized by sampling a single diffusion step i for each data point, but the reverse sampling in Equation (1), which requires iteratively computing (cid:15) θ networks N times, can become a bottleneck for the running time.
Thus we may want to limit N to a relatively small value.
To work with small N , with β min = 0 .
1 and β max = 10 . 0 , we follow Xiao et al.
(2021) to deﬁne
[Equation]
which is a noise schedule obtained under the variance preserving SDE of Song et al.
4. Q- LEARNING
The policy-regularization loss L d ( θ ) is a behavior-cloning term, but would not result in learning a policy that can outperform the behavior policy that generated the training data.
To improve the policy, we inject Q-value function guidance into the reverse diffusion chain in the training stage in order to learn to preferentially sample actions with high values.
The ﬁnal policy-learning objective is a linear combination of policy regularization and policy improvement:
[Equation]
Note that a 0 is reparameterized by Equation (1) and hence the gradient of the Q-value function with respect to the action is backpropagated through the whole diffusion chain.
As the scale of the Q-value function varies in different ofﬂine datasets, to normalize it, we follow
Fujimoto & Gu (2021) to set α as α =
[Equation]
E
[Equation]
s
[Equation]
a
[Equation]
∼D [ | Q φ ( s , a ) | ] , where η is a hyperparameter that balances the two loss terms and the Q in the denominator is for normalization only and not differentiated over.
The Q-value function itself is learned in a conventional way, minimizing the Bellman operator (Lillicrap et al., 2015; Fujimoto et al., 2019) with the double Q-learning trick (Hasselt, 2010).
We built two Q-networks, Q φ 1 , Q φ 2 , and target networks Q φ (cid:48) 1 , Q φ (cid:48) 2 and π θ (cid:48) .
We then optimize φ i for i = { 1 , 2 } by minimizing the objective,
[Equation]
We conduct extensive experiments in Sections 5 and 6 and show that L d and L q work together to achieve the best performance.
We summarize our implementation in Algorithm 1.
Algorithm
Initialize policy network π θ , critic networks Q φ 1 and Q φ 2 , and target networks π θ (cid:48) , Q φ (cid:48) 1 and Q φ (cid:48) 2 for each iteration do
Sample transition mini-batch B = { ( s t , a t , r t , s t +1 ) } ∼ D .
# Q-value function learning
Sample a 0 t +1 ∼ π θ (cid:48)
( a t +1 | s t +1 ) by Equation (1).
Update Q φ 1 and Q φ 2 by Equation (4).
(max Q backup by Kumar et al.
(2020) could be added)
# Policy learning
Sample a 0 t ∼ π θ ( a t | s t ) by Equation (1).
Update policy by minimizing Equation (3).
# Update target networks θ (cid:48)
=
ρθ (cid:48)
+ (1 − ρ ) θ , φ (cid:48)
i = ρφ (cid:48)
i + (1 − ρ ) φ i for i = { 1 , 2 } .
end for
P OLICY R EGULARIZATION
In this section, we illustrate how the previous policy regularization methods work compared to our conditional diffusion-based approach on a simple bandit task with a 2D continuous action space.
Below we ﬁrst provide a brief review of prior methods.
BC-MLE.
The policy π θ ( a | s ) is modeled by a Gaussian distribution N ( a ; µ θ ( s t ) , Σ θ ( s )) , where usually µ θ and Σ θ are parameterized by multi-layer perceptrons (MLPs) and for simplicity
Σ θ is assumed to be a diagonal matrix.
The policy is optimized by maximizing E ( s , a ) ∼D [log π θ ( a | s )] .
TD3+BC (Fujimoto & Gu, 2021) directly add the behavior-cloning (BC) loss as an additional term in policy learning, while IQL (Kostrikov et al., 2021b) proposes using “in-sample” learned advantage functions to reweigh the log term inside the expectation.
BC-CVAE.
The policy π θ ( a | s ) is modeled by a CVAE model with an encoder network q θ ( z | s , a ) and a decoder network p θ ( a | s , z ) .
The two networks are optimized by maximizing the evidence lower bound E ( s , a )
∼D
[ E z ∼ q ( · | s , a ) [log p ( a | s , z )] − KL ( q ( z | s , a ) || p ( z ))] , where p ( z ) is a prior distribution that is usually set as standard Gaussian.
BCQ (Fujimoto et al., 2019) trains a CVAE model as an approximation of the behavior policy and trains another deviation model to guide the actions drawn from the CVAE approximation towards the regions with high learned Q-values.
BC-MMD.
BEAR (Kumar et al., 2019) also mimics the behavior policy via a CVAE model and proposes to limit the current policy π θ ( a | s ) to be close to the cloned behavior policy via MMD minimization.
A Tanh-Gaussian policy is used, which is a Gaussian network with a Tanh activation function at the output layer.
BCQ and BEAR can be seen as a two-step regularization: First, an approximation of the behavior policy is learned (behavior cloning), and then the policy learned by policy improvement is regularized towards the cloned behavior policy.
However, such a two-step approach means that the efﬁcacy of the second-step policy regularization heavily depends on the cloning quality, and an inaccurate regularization could misguide the subsequent policy improvement step.
We illustrate this weakness in a 2D continuous action space bandit example.
Example.
We consider a simple bandit task with real valued actions in a 2D space, a ∈ [ − 1 , 1] 2 .
We construct an ofﬂine dataset D = { ( a j ) } Mj =1 with M = 10000 action examples, where the actions are collected from an equal mixture of four Gaussian distributions with centers µ ∈ { (0 . 0 , 0 .
8) , (0 . 8 , 0 . 0) , (0 . 0 , − 0 .
8) , ( − 0 .
8 , 0 . 0) } and standard deviations σ d = (0 .
05 , 0 . 05) , as depicted in the ﬁrst panel of Figure 1.
Note that this example exhibits strong multi-modality in the behavior policy distribution, which is often the case when the dataset is collected by different policies.
For example, if multiple humans are involved, some may be experts and choose actions from a different mode from amateur demonstrators.
To evaluate the strength of prior regularization methods, we ﬁrst compare them to our diffusionbased approach on a behavior-cloning task, where the goal is to just clone the behavior policy that generated the data, not improve on it.
As shown in the ﬁrst row of Figure 1, we observe that the diffusion model captures all the four density modes of the behavior policy.
The policy of BC-MLE is limited to a single mode and hence exhibits a strong mode-covering behavior.
It ﬁts the four density
[Table]
[Figure] [Figure]
modes by one Gaussian distribution with a large standard deviation, whose high-density regions are actually the low-density regions of the true behavior policy.
The CVAE model is shown to exhibit mode-covering behavior even though itself is an implicit model with enough expressiveness:
We see that CVAE captures the four modes but high densities are assigned between them to cover all the modes.
Note we also observe the CVAE model sometimes fails to capture all four modes with different random seeds.
The Tanh-Gaussian policy optimized under MMD learns to align the densities near the boundary lines and, due to its limited policy expressiveness, fails to capture the true distribution.
These observed failures on behavior cloning in this simple example illustrate the limitations of prior regularization methods in the common case of multi-modal behavior policies.
Next, we investigate how the policy improvement will be impacted by the corresponding policy regularization.
We assign each data point a reward sampled from a Gaussian distribution, whose mean is determined by the data center and standard deviation is ﬁxed as 0.5, as shown in the second row of Figure 1.
Note here we mimic the ofﬂine RL setting, under which the underlying reward function is unknown and needs to be learned.
We compare Diffusion Q-learning (QL) with prior methods, including TD3+BC, BCQ, and BEAR-MMD.
We train all methods with 1000 epochs to ensure convergence.
Due to the strong policy constraint applied by each method, we observe that the policy improvement of prior methods is constrained to suboptimal or even wrong exploration regions, induced by the corresponding behavior-cloning regularization.
TD3+BC cannot converge to the optimal mode since the behavior policy places most density in the region where no ofﬂine data exists.
BCQ learns to place major actions on the four diagonal corners discovered by its CVAE-based behavior cloning.
The policy of BEAR-MMD learns to place actions randomly since the exploration region is constrained by inaccurate policy regularization.
We observe that the prior regularizations typically push the policy to converge to sub-optimal solutions, such as BCQ, or prevent the policy from being concentrated on the optimal corner, such as TD3+BC and BEAR-MMD.
By contrast, the policy of Diffusion-QL successfully converges to the optimal bottom corner.
This is because 1) diffusion policy is expressive enough to recover the behavior policy, which covers all modes for further exploration; 2) the Q-learning guidance, directly through linearly combined loss functions in Equation (3), helps diffusion policy seek optimal actions in the region.
The two components are working together to produce good performance.
Diffusions steps.
We further investigated how the diffusion policy performs as the number of diffusion timesteps N is varied.
As expected, the ﬁrst row of Figure 2 shows that as N increases, the diffusion model becomes more expressive and learns more details about the underlying data distribution.
When N is increased to 50 , the true data distribution is accurately recovered.
The second row shows that with Q-learning applied, a moderately small N is able to deliver good performance due to our loss coupling deﬁned in Equation (3).
However, we can see with a larger N the policy regularization imposed by the diffusion model-based cloning becomes stronger.
For example, when
N = 2 , there are still a few action points sampled near regions with no training data, whereas when
N = 50 , the policy is constrained in the correct data region for further exploration.
The number of timesteps N serves as a trade-off between policy expressiveness and computational cost for
Diffusion-QL.
We found N = 5 performs well on D4RL (Fu et al., 2020) datasets, which is also a small enough value for cost-effective training and deployment.
E XPERIMENTS
We evaluate our method on the popular D4RL (Fu et al., 2020) benchmark.
Further, we conduct empirical studies on the number of timesteps required for our diffusion model and also perform an ablation study for analyzing the contribution of the two main components of Diffusion-QL.
Datasets.
We consider four different domains of tasks in D4RL benchmark: Gym, AntMaze, Adroit, and Kitchen.
The Gym-MuJoCo locomotion tasks are the most commonly used standard tasks for evaluation and are relatively easy, since they usually include a signiﬁcant fraction of near-optimal trajectories in the dataset and the reward function is quite smooth.
AntMaze consists of more challenging tasks, which have sparse rewards and explicitly need the agent to stitch various sub-optimal trajectories to ﬁnd a path towards the goal of the maze (Fu et al., 2020).
Adroit datasets are mostly collected by human behavior and the state-action region reﬂected by the ofﬂine data is often very narrow, so strong policy regularization is needed to ensure that the agent stays in the expected region.
The Kitchen environment requires the agent to complete 4 target subtasks in order to reach a desired state conﬁguration, and hence long-term value optimization is important for it.
Baselines.
We consider different classes of baselines that perform well in each domain of tasks.
For policy regularization-based methods, we include the classic BC, BEAR (Kumar et al., 2019), BRAC (Wu et al., 2019), BCQ (Fujimoto et al., 2019), TD3+BC (Fujimoto & Gu, 2021), AWR (Peng et al., 2019), AWAC (Nair et al., 2020), and IQL (Kostrikov et al., 2021b), along with the Onestep RL (Brandfonbrener et al., 2021), which is based on single-step improvement.
For Q-value constraint methods, we include REM (Agarwal et al., 2020) and CQL (Kumar et al., 2020).
For model-based ofﬂine RL, we consider MoRel (Kidambi et al., 2020).
For sequence modelling approaches, we compare with Decision Transformer (DT) (Chen et al., 2021) and Diffuser (Janner et al., 2022).
We report the performance of baseline methods either using the best results reported from their own paper, Fu et al.
(2020) or Kostrikov et al.
(2021b).
Experimental details.
We train for 1000 epochs (2000 for Gym tasks).
Each epoch consists of 1000 gradient steps with batch size 256.
The training is usually quite stable as shown in Figureexcept that we observe the training for AntMaze tasks has variations due to its sparse reward setting and lack of optimal trajectories in the ofﬂine datasets.
Hence, we save multiple model checkpoints during training and use a completely ofﬂine method to select the best checkpoint for performance evaluation.
We found that L d loss is a lagging indicator of online performance, so we select the checkpoint with the second or third lowest L d value.
The results in our main paper are all based on the ofﬂine model selection.
Where a small amount of online interaction can be used for model selection we can achieve even better results (Appendix Table 4).
Effect of hyperparameter N .
We conduct an empirical study on the effect of the number of timesteps N of our diffusion model on real tasks.
As shown in Figure 3, empirically we ﬁnd as
[Figure] [Figure]
[Table]
[Figure]
[Table]
the N increases, the model converges faster and the performance becomes more stable.
In the following D4RL tasks
[Table]
we set a moderate value
[Table]
N =
[Table]
to balance the performance and computational cost.
With N = 5 , the training time of our method is similar to that of CQL (Kumar et al., 2020)
[Table]
The other hyperparameters, such as the learning rate and η , are provided in Appendix D
[Table]
6. C OMPARISON TO OTHER METHODS
We compare our Diffusion-QL with the baselines on four domains of tasks and report the results in
Table 1.
We give the analysis based on each speciﬁc domain.
Results for Gym Domain.
We can see while most baselines already work well on the Gym tasks,
Diffusion-QL can often further improve their performance by a clear margin, especially in ‘medium’
[Table]
and ‘medium-replay’ tasks.
Note the ‘medium’ datasets include the trajectories collected by an online SAC (Haarnoja et al., 2018) agent trained to approximately 1/3 the performance of the expert.
Hence, the Tanh-Gaussian policy at that time is usually exploratory and not concentrated, which makes the collected data distribution hard to learn.
As shown in Section 5, the diffusion model has the expressivity to mimic the behavior policy even in complicated cases and then the policy improvement term will guide the policy to converge to the optimal actions in the subset of explored action space.
These two components are key to the good empirical performance of Diffusion-QL.
Results for AntMaze Domain.
The sparse reward and large amount of sub-optimal trajectories make the AntMaze tasks especially difﬁcult.
Strong and stable Q-learning is required to achieve good performance.
For example, BC-based methods could easily fail on ‘medium’ and ‘large’ tasks.
We show that the proposed Q-learning guidance added during the training of a conditional diffusion model is stable and effective.
Empirically, with a proper η , we ﬁnd Diffusion-QL outperforms the prior methods by a clear margin, especially in harder tasks, such as ‘large-diverse’.
Results for Adroit and Kitchen Domain.
We ﬁnd the Adroit domain needs strong policy regularization to overcome the extrapolation error (Fujimoto et al., 2019) in ofﬂine RL, due to the narrowness of the human demonstrations.
With a smaller η , Diffusion-QL easily beats the other baselines by its reverse diffusion-based policy, which has high expressiveness and better policy regularization.
Moreover, long-term value optimization is required for the Kitchen tasks, and we ﬁnd
Diffusion-QL also performs very well in this domain.
6. A BLATION S TUDY
In this section, we analyze why Diffusion-QL outperforms the other policy-constraint based methods quantitatively on D4RL tasks.
We conduct an ablation study on the two main components of
Diffusion-QL: use of a diffusion model as an expressive policy and Q-learning guidance.
For the policy part, we compare our diffusion model with the popular CVAE model for behavior cloning.
For the Q-learning component, we compare with the BCQ approach on policy improvement.
As shown in Table 2, BC-Diffusion model outperforms BC-CVAE, validating that our diffusionbased policy is more expressive and better at capturing the data distributions (as we would expect from the results in ﬁgure 1).
Under the same BCQ framework, which explicitly limits how far the action samples from polices could deviate from the cloned action samples, BCQ-Diffusion still works better than BCQ-CVAE.
The hard and physical value constraints on the deviation by BCQ actually limits the policy improvement, as we can see that, Diffusion-QL further boosts the performance.
Note Diffusion-QL applies the diffusion model learning itself as a soft policy regularization and guides the policy optimization via additive Q-learning.
The weak expressiveness and poor cloning behavior of CVAE makes it fail when coupling with a free Q-learning guidance, as shown by the results of CVAE-QL.
In a nutshell, the ablation study shows that the two components of Diffusion-QL are working together to produce good performance.
C ONCLUSION
In this work, we present Diffusion-QL, which is a conditional diffusion-based ofﬂine RL algorithm.
First, its policy is built by the reverse chain of a conditional diffusion model, which allows for a highly expressive policy class and whose learning itself acts as a strong policy regularization method.
Second, Q-learning guidance through a jointly learned Q-value function is injected in the learning of the diffusion policy, which guides the denoising sampling towards the optimal region in its exploration area.
The two key components contribute to its state-of-the-art performance across all tasks in the D4RL benchmark.
Appendix A M ORE TOY EXPERIMENTS
Here we describe an additional toy experiment on a bandit task.
Actions are again in a real-valued 2D space, a ∈ [ − 1 , 1] 2 .
The ofﬂine data D = { ( a i ) } 10000 i = are collected by sampling actions equally from four Gaussian distributions with centers µ ∈ { ( − 0 .
8) , (0 . 8 , − 0 .
8) , ( − 0 .
8 , − 0 .
8) } and standard deviations σ d = (0 . 05 , 0 . 05) , as depicted in the ﬁrst panel of Figure 4.
We conduct the same experiments as the ones in our main paper (see ﬁgure 1) and show the performance in Figure 4.
The only difference in this experiment is that the samples are now in the corners of the ation space.
For behavior-cloning experiments, we observe that only our diffusion model could recover the original data distribution while the prior regularization methods fail in some way.
For example, CVAE could only capture the two diagonal modes and place density between them, while MMD tends to align density around the boundaries because of its Tanh-Gaussian policy.
For Q-learning experiments, we observe that the prior regularization methods typically push the policy to converge to sub-optimal solutions in BCQ and BEAR while preventing the policy of TD3+BC from being concentrated on the right corner.
However, the policy of Diffusion-QL successfully converges to the optimal bottom corner.
The ablation study experiments are consistent with our conclusion in the main paper.
[Figure]
[Table]
[Figure]
B I MPLEMENTATION D ETAILS
Diffusion policy.
We build our policy as an MLP-based conditional diffusion model.
Following the parameterization of Ho et al.
, the model itself is a residual model, (cid:15) θ
( a i , s , i ) , where the i is the last timestep and s is the state condition.
We model (cid:15) θ as a 3-layer MLPs with Mish activations and we use 256 hidden units for all networks.
The input of (cid:15) θ is the concatenation of the last step action vector, the current state vector, and the sinusoidal positional embedding of timestep i .
The output of (cid:15) θ is the predicted residual at diffusion timestep i .
Q networks.
We build two Q networks with the same MLP setting as our diffusion policy, which has 3-layer MLPs with Mish activations and 256 hidden units for all networks.
We use the Adam (Kingma & Ba, 2014) optimizer for the training of both Diffusion policy and Q networks.
C E XPERIMENTAL D ETAILS
We train our algorithm with 2000 epochs for Gym tasks and 1000 epochs for the other tasks, where each epoch consists of 1000 gradient steps.
For the Gym locomotion tasks, we average mean returns over 6 independently trained models and 10 trajectories per mode.
For the other tasks, we average over 6 independently trained models and 100 evaluation trajectories.
Following the convention of supervised learning, the best-performed model is saved during training and used for ﬁnal evaluation.
We use the original task rewards from MuJoCo Gym and Kitchen tasks.
We standardize Adroit task rewards for training stability.
We modify the rewards according to the suggestion of CQL (Kumar et al., 2020) for the AntMaze datasets.
D H YPERPARAMETERS
For Diffusion-QL, we consider three hyperparameters in total: learning rate, Q-learning weight η , and whether to use max Q backup from CQL (Kumar et al., 2020).
For the learning rate of Adam, we consider values in the grid { 1 × 10 − 3 , 3 × 10 − 4 , 3 × 10 − 5 } for the policy, while we use a ﬁxed learning rate, 3 × 10 − 4 , for Q-networks.
For η , we consider values according to the characteristics of different domains, as we mentioned in the description of datasets that the Adroit and Kitchen tasks require more policy regularization and the AntMaze tasks require more Q-learning.
For max Q backup, we only apply it on the AntMaze tasks.
Based on these considerations, we provide our hyperparameter setting in Table 3.
E O PTIMAL R ESULTS
If a small amount of online experience is provided during the evaluation stage for model selection, we can pick the best models during training via online evaluations (similar to early stopping in supervised learning).
This regime provides a further boost in the performance of Diffusion-QL as shown in Table 4.
F L IMITATIONS AND F UTURE W ORK
Diffusion policies are highly expressive and hence they can capture multi-modal distributions well.
We have shown this results in learning better policies in ofﬂineRL.
However, at the inference time, the reverse sampling deﬁned in Equation (1) requires iteratively computing (cid:15) θ networks N times, and this can become a bottleneck for the running time.
In our case, we couple the learning of diffusion policies with Q-learning, and achieve good performance with small N = 5 .
Diffusion policies with N = 5 could be four to ﬁve times slower in action inference compared to previous one-step feedforward policies, and hence the inference cost could prevent the approach from deployment in some real-world scenarios, where fast response is necessary. This motivates potential future works. There have been many recent works focusing on improving the sampling speed of diffusion models (Lu et al., 2022; Wang et al., 2022; Xiao et al., 2021; Sal- [Table]
imans & Ho, 2022; Song et al., 2020; Zheng et al., 2022), which could be applied to improve the sampling efﬁciency of Diffusion-QL.
For example, the diffusion policy may be able to be distilled into a simpler feedforward policy after training.
G G AUSSIAN M IXTURE P OLICY
We test a Gaussian Mixture policy as a classic policy class that can capture multi-modal distributions as an additional baseline.
We modify TD3+BC (Fujimoto & Gu, 2021) by replacing the original deterministic actor with a mixture density network (Bishop, 1994), where each mixture component is a Gaussian.
Since a Gaussian mixture policy is applied, we replaced minimizing the L2 loss (from
TD3+BC) between predicted actions and real actions, with maximizing the likelihood estimate of
Gaussian mixtures on real state-action pairs.
We keep all the other parts the same as TD3+BC.
We evaluated the model (we call it TD3+BC-GM) on both our bandit toy experiment and selected
D4RL tasks.
As shown in Figure 5, with a properly selected number of mixtures, the Gaussian mixture could capture the multi-modal distribution in our behavior cloning experiment.
However, in the Q-learning experiment, it fails to converge to the optimal target location, and always places some density on the suboptimal modes, resulting in a suboptimal policy with multi-modes.
For
D4RL experiments, we set the number of mixtures to be 3, and seen in Table 5, we observed that
TD3+BC-GM does not perform well on the three D4RL tasks, which is consistent with our previous observation that TD3+BC-GM is prone to have suboptimal actions.
One reason for the poor performance could be that Gaussian mixture models are challenging to ﬁt well, particularly in higher dimensional spaces.
We are also forced to choose the number of mixture components, which for the D4RL experiments we don’t know a priori how many components there
[Table] [Figure] [Table] [Figure]
are.
Moreover, each mixture component is often parameterized with a diagonal Gaussian that has limited ability in capturing the dependence between different dimensions
[Figure]
[Table]