E FFICIENT E XPLORATION FOR M ODEL - BASED R EINFORCEMENT L EARNING WITH C ONTINUOUS S TATES AND A CTIONS
Anonymous authors
Paper under double-blind review
A BSTRACT
Balancing exploration and exploitation is crucial in reinforcement learning (RL).
In this paper we study the model-based posterior sampling algorithm in continuous state-action spaces theoretically and empirically.
First, we improve the regret bound: with the assumption that reward and transition functions can be modeled as Gaussian Processes with linear kernels, we develop a Bayesian regret bound of ˜ O
( H 3 / 2 d √ T ) , where H is the episode length, d is the dimension of the state-action space, and T is the time elapsed.
Our bound can be extended to nonlinear cases as well: using linear kernels on the feature representation φ , the
Bayesian regret bound becomes ˜ O
( H 3 / 2 d φ √ T ) , where d φ is the dimension of the representation space.
Moreover, we present MPC-PSRL, a model-based posterior sampling algorithm with model predictive control for action selection.
To capture the uncertainty in models and realize posterior sampling, we use Bayesian linear regression on the penultimate layer (the feature representation layer φ ) of neural networks.
Empirical results show that our algorithm achieves the best sample efﬁciency in benchmark control tasks compared to prior model-based algorithms, and matches the asymptotic performance of model-free algorithms
I NTRODUCTION
In reinforcement learning (RL), an agent interacts with an unknown environment which is typically modeled as a Markov Decision Process (MDP).
Efﬁcient exploration has been one of the main challenges in RL: the agent is expected to balance between exploring unseen state-action pairs to gain more knowledge about the environment, and exploiting existing knowledge to optimize rewards in the presence of known data.
To achieve efﬁcient exploration, Bayesian reinforcement learning is proposed, where the MDP itself is treated as a random variable with a prior distribution.
This prior distribution of the MDP provides an initial uncertainty estimate of the environment, which generally contains distributions of transition dynamics and reward functions.
The epistemic uncertainty (subjective uncertainty due to limited data) in reinforcement learning can be captured by posterior distributions given the data collected by the agent.
Posterior sampling reinforcement learning (PSRL), motivated by Thompson sampling in bandit problems (Thompson, 1933), serves as a provably efﬁcient algorithm under Bayesian settings.
In
PSRL, the agent maintains a posterior distribution for the MDP and follows an optimal policy with respect to a single MDP sampled from the posterior distribution for interaction in each episode.
Appealing results of PSRL in tabular RL were presented by both model-based (Osband et al., 2013;
Osband & Van Roy, 2017) and model free approaches (Osband et al., 2019) in terms of the Bayesian regret.
For H -horizon episodic RL, PSRL was proved to achieve a regret bound of ˜ O
( H √ SAT ) , where S and A denote the number of states and actions, respectively.
But when transferring these results to continous state-action spaces, there could be an exponential growth in dimensionality.
Although PSRL in continuous spaces has also been studied in episodic RL, existing results either provide no guarantee or suffer from an exponential order in term of H .
In model-based settings, a bound of ˜ O ( √ d K d E T ) was proved by Osband & Van Roy (2014), where d K is the Kolmogorov dimension and d E is the eluder dimension of the function class.
H is not explictly included in the bound, and under their assumptions it can be exponential in H .
Moreover, the eluder dimension in general function approximators, such as neural networks, can be presumably huge.
Chowdhury & Gopalan (2019) considered kernalized MDPs to further improve the bound with respect to the dimension of d K and d E , but H is still unbounded as in Osband & Van Roy (2014).
In model-free settings, Azizzadenesheli et al.
(2018) developed a regret bound of ˜ O
( d φ √ T ) using a linear function approximator in the Q-network, where d φ is the dimension of the feature representation vector of the state-action space, but their bound can still be exponential in H .
To further imporve the regret bound for PSRL in continuous spaces, especially with explicit dependency on H , we study the model-based posterior sampling algorithm in episodic RL.
We assume that rewards and transitions can be modeled as Gaussian Processes with linear kernels, and extend the assumption to non-linear settings that utilize features extracted by neural networks.
For the linear case, we develop a Bayesian regret bound of ˜ O
( H 3 / 2 d √ T ) .
Using feature embedding as mentioned in Yang & Wang (2019), we derive a bound of ˜ O
( H 3 / 2 d φ √ T ) .
Explicitly dependent on d, H, T , our result achieves a signiﬁcant improvement in terms of the Bayesian regret of PSRL algorithms compared to previous works.
Moreover, we implement PSRL using Bayesian linear regression (BLR) on the penultimate layer (for feature representation) of neural networks when ﬁtting transition and reward models.
We use model predictive control to optimize the policy under the sampled models in each episode as an approximate solution of the sampled MDP.
Experiments show that our algorithm achieves more efﬁcient exploration compare with previous model-based algorithms in control benchmark tasks.
R ELATED W ORK
Besides the aforementioned works on Bayesian regret bounds, the majority of papers in efﬁcient RL choose the non-Bayesian perspective and develop frequentist regret bounds where the regret for any
MDP M ∗ ∈ M is bounded and M ∗ ∈ M holds with high probability.
frequentist regret bounds can be expressed in the Bayesian view: for a given conﬁdence set M , the frequentist regret bound implies an identical Bayes regret bound for any prior distribution with support on M .
Note that frequentist regret is extensively studied in tabular RL (see Jaksch et al.
(2010), Azar et al.
(2017), and Jin et al.
(2018) as examples), among which the best bound for episodic settings is ˜ O
( H √ SAT ) .
There is also a line of work that develops frequentist bounds with feature representation.
Most recently, MatrixRL proposed by (Yang & Wang, 2019) uses low dimensional representation and achieves a regret bound of
˜ O
( H 2 d φ √ T ) , which is the best-known frequentist bound in model based settings.
While our method is also model-based, we achieve a tighter regret bound when compared in the Bayesian view.
In model-free settings, Jin et al.
(2020) developed a bound of
˜ O
( H 3 / 2 d 3 / 2 φ √ T ) .
Zanette et al.
(2020) further improved the regret to ˜ O
( H 3 / 2 d φ √ T ) by the proposed an algorithm called ELEANOR, which achieves the best-known frequentist bound in model-free settings.
They showed that it is unimprovable with the help of a lower bound established in the bandit literature.
Despite that our regret is developed in model-based settings, it matches their bound with the same order of H , d φ and T in the Bayesian view.
Moreover, their algorithm involves optimization over all MDPs in the conﬁdence set, and thus can be computationally prohibitive.
Our method is computationally tractable as it can be easily implemented by only optimizing a single sampled MDP, while matching their regret bound in the Bayesian view.
P RELIMINARIES 3. P ROBLEM F ORMULATION
We model an episodic ﬁnite-horizon
Markov
Decision
Process (MDP)
M as {S , A , R M , P M , H, σ R , σ P , R max , ρ } , where S ⊂ R d s and A ⊂ R d a denote state and action spaces, respectively.
Each episode with length H has an initial state distribution ρ .
At time step i ∈ [1 , H ] within an episode, the agent observes s i ∈ S , selects a i ∈ A , receives a noised reward r i ∼ R M ( s i , a i ) and transitions to a noised new state s i +1 ∼ P M ( s i , a i ) .
More speciﬁcally, r ( s i , a i ) =
¯ r M ( s i , a i ) + (cid:15) r
and s i +
= f M
( s i , a i ) + (cid:15) f , where (cid:15) r ∼ N (0 , σ 2 r ) , (cid:15)
f ∼ N (0 , σ 2 f I d s ) .
Variances σ 2 r and σ 2 f are ﬁxed to control the noise level.
Without loss of generality, we assume the expected reward an agent receives at a single step is bounded | ¯ r M ( s, a ) | ≤ R max , ∀ s ∈ S , a ∈ A ,
Let µ : S → A be a deterministic policy.
Here we deﬁne the value function for state s at time step i with policy µ as V Mµ,i ( s ) =
E [Σ Hj =
i [¯ r M ( s j , a j ) | s i = s ] , where s j +1 ∼ P M ( s j , a j ) and a j = µ ( s j ) .
With the bound expected reward, we have that | V ( s ) | ≤ HR max , ∀ s .
We use M ∗ to indicate the real unknown MDP which includes R ∗ and P ∗ , and M ∗ itself is treated as a random variable.
Thus, we can treat the real noiseless reward function ¯ r ∗ and transition function f ∗ as random processes as well.
In the posterior sampling algorithm π PS , M k is a random sample from the posterior distribution of the real unknown MDP M ∗ in the k th episode, which includes the posterior samples of R k and P k , given history prior to the k th episode: H k := { s 1 , 1 , a 1 , 1 , r 1 , 1 , · · · , s k − 1 ,H , a k − 1 ,H , r k − 1 ,H } , where s k,i , a k,i and r k,i indicate the state, action, and reward at time step i in episode k .
We deﬁne the the optimistic policy under M as µ M ( s i ) ∈ argmax V Mµ,i
( s i ) .
In particular, µ ∗ indicates the optimal policy under M ∗ and µ k represents the optimal policy under M k .
Let ∆ k denote the regret over the k th episode:
[Equation]
Then we can express the regret of π ps up to time step T as:
[Equation]
Let BayesRegret ( T, π ps , φ ) denote the Beyesian regret of π ps as deﬁned in Osband & Van Roy (2017), where φ is the prior distribution of M ∗ :
[Equation]
3. A SSUMPTIONS
Generally, we consider modeling an unknown target function g : R d → R .
We are given a set of noisy samples y
=
[ y 1 ...., y T ] T at points X =
[ x 1 , ..., x T ] T , X ⊂ D , where D is compact and convex, y i =
g ( x i ) + (cid:15) i with (cid:15) i ∼ N (0 , σ 2 ) i.i.d.
Gaussian noise ∀ i ∈ { 1 , · · · , T } .
We model g as a sample from a Gaussian Process GP ( µ ( x ) , K ( x, x (cid:48) )) , speciﬁed by the mean function µ ( x ) =
E [ g ( x )] and the covariance (kernel) function K ( x, x (cid:48) )
=
E [( g ( x ) − µ ( x )( g ( x (cid:48) ) − µ ( x (cid:48) )] .
Let the prior distribution without any data as GP (0 , K ( x, x (cid:48) )) .
Then the posterior distribution over g given X and y is also a GP with mean µ T ( x ) , covariance K T ( x, x (cid:48) ) , and variance σ 2 T ( x ) :
µ T
[Equation]
= K ( x
[Equation]
X )
( K ( X, X ) + σ 2 I ) − 1 y
K
[Equation]
=
[Equation] [Equation]
where K ( X, x ) =
[ K ( x 1 , x ) , ..., K ( x T , x )] T , K ( X, X ) =
[ K ( x i , x j )] 1 ≤ i ≤ T, 1 ≤ j ≤ T .
We model our reward function ¯ r M as a Gaussian Process with noise σ 2 R .
For transition models, we treat each dimension independently: each f i ( s, a ) , i = 1 , .., d S is modeled independently as above, and with the same noise level σ 2 f in each dimension.
Thus it corresponds to our formulation in the
RL setting.
Since the posterior covariance matrix is only dependent on the input rather than the target value, the distribution of each f i ( s, a ) shares the same covariance matrice and only differs in the mean function.
B AYESIAN R EGRET A NALYSIS 4. L INEAR CASE
Theorem 1 In the RL problem formulated in Section 3.1, under the assumption of Section 3.2 with linear kernels, we have BayesRegret ( T, π ps , M ∗ ) =
˜ O ( H 3 / 2 d φ √ T ) , where d is the dimension of the state-action space, H is the episode length, and T is the time elapsed.
Proof
The regret in episode k can be rearranged as:
[Equation]
Note that conditioned upon history H k for any k , M k and M ∗ are identically distributed.
Osband &
Van Roy (2014) showed that V M ∗ µ ∗ , − V M k µ k , 1 is zero in expectation
[Equation]
and that only the second part of the regret decomposition need to be bounded when deriving the Bayesian regret of PSRL.
Thus we can focus on the policy µ k , the sampled M k and real environment data generated by M ∗ .
For clarity, the value function V M k µ k , 1 is simpliﬁed to V kk, 1 and V M ∗ µ k , 1 to V ∗ k, 1 .
It sufﬁces to derive bounds for any initial state s 1 as the regret bound will still hold through integration of the initial distribution ρ ( s 1 )
[Equation]
We can rewrite the regret from concentration via the Bellman operator (see Section 5.1 in Osband et al.
[Equation]
where a i = µ k ( s i ) , s i +1 ∼ P ∗ ( s i +
| s i , a i ) .
Thus, here ( s i , a i ) is the state-action pair that the agent encounters in the k th episode while using µ k for interaction in the real MDP M ∗ .
We can deﬁne
V k,H +
= 0 to keep consistency.
Note that we cannot treat s i and a i as deterministic and only take the expectation directly on random reward and transition functions.
Instead, we need to bound the difference using concentration properties of reward and transition functions modeled as Gaussian
Processes (which also applies to any state-action pair), and then derive bounds of this expectation.
For all i , we have (cid:82)
[Equation]
P
[Equation]
−
[Equation]
Lemma 1 For two multivariate Gaussian distribution N ( µ , σ 2 I ) , N ( µ (cid:48) , σ 2 I ) with probability density function p 1 ( x ) and p 2 ( x ) respectively, x ∈ R d ,
[Equation]
The proof is in Appendix A.1.
Clearly, this result can also be extended to sub-Gaussian noises.
Using this lemma, we can derive a regret bound with explicit dependency on the episode length H .
Recall that P k ( s (cid:48) | s i , a i ) =
N ( f k ( s i , a i ) , σ 2 f I ) and P ∗ ( s (cid:48) | s i , a i ) =
N ( f ∗ ( s i , a i ) , σ 2 f I ) .
By Lemma 1 we have
[Equation]
Lemma 2 (Rigollet & Hütter, 2015) Let X 1 , ..., X N be N sub-Gaussian random variables with variance σ 2 (not required to be independent).
Then for any t > 0 , P (max 1 ≤ i ≤ N | X i | > t ) ≤ 2 Ne − t 2 2 σ 2 .
Given history H k , let ¯ f k ( s, a ) indicate the posterior mean of f k ( s, a ) in episode k , and σ 2 k ( s, a ) denotes the posterior variance of f k in each dimension.
Note that f ∗ and f k share the same variance in each dimension given history H k , as described in Section 3.
Consider all dimensions of the state space, by Lemma 2, we have that with probability at least 1 − δ , max 1 ≤ i ≤
d s | f ki ( s, a ) − ¯ f ki
( s, a )
| ≤ (cid:113) 2 σ 2 k ( s, a ) log 2 d s δ .
Also, we can derive an upper bound for the norm of the state difference
||
f k
( s, a
[Equation]
−
[Equation]
s, a
[Equation]
s, a
[Equation]
i ( s, a ) | , and so does || f ∗ ( s, a ) −
¯ f k
[Equation]
s, a ) || 2 since f ∗ and f k share the same posterior distribution.
By the union bound, we have that with probability at least 1 −
[Equation]
Then we look at the sum of the differences over horizon H , without requiring each variable in the sum to be independent:
[Equation]
Thus, with probability at least 1 − 2 Hδ , we have Σ
Hi =
|| f k
( s i , a i ) − f ∗ ( s i , a i ) ||≤ Σ
Hi =1 2 (cid:113) 2 d s σ 2 k
( s i , a i ) log 2 d s δ .
Let δ
[Equation]
= 2 Hδ , we have that with probability 1 − δ , Σ
Hi =
|| f k
[Equation]
s i , a i ) −
[Equation]
, where the index k max = arg max i σ k ( s i , a i ) , i = 1 , ..., H in episode k .
Here, since the posterior distribution is only updated every H steps, we have to use data points with the max variance in each episode to bound the result.
Similarly, using the union bound for [ TH ] episodes, and let C = (cid:113) 2 πσ 2 f , we have that with probability at least 1 − δ
[Equation]
In each episode k , let σ (cid:48) 2 k
( s, a ) denote the posterior variance given only a subset of data points { ( s 1 max , a 1 max ) , ..., ( s k − 1 max , a k − 1 max ) } , where each element has the max variance in the corresponding episode.
By Eq.(6) in Williams & Vivarelli (2000), we know that the posterior variance reduces as the number of data points grows.
Hence ∀ ( s, a ) , σ 2 k ( s, a ) ≤ σ (cid:48)
2 k ( s, a ) .
By Theorem 5 in Srinivas et al.
(2012) which provides a bound on the information gain, and Lemma 2 in
Russo & Van Roy (2014) that bounds the sum of variances by the information gain, we have that Σ [ TH ] k =1 σ (cid:48) 2 k
( s k max , a k max )
=
O (( d s + d a ) log
[ TH ]) for linear kernels with bounded variances.
Note that the bounded variance property for linear kernels only requires the range of all state-action pairs actually encountered in M ∗ not to expand to inﬁnity as T grows, which holds in general episodic
MDPs.
Thus with probability 1 − δ , and let δ = 1 T , Σ
[Equation]
where ˜ O ignores logarithmic factors.
Therefore, E [Σ [ TH ] k =1 ˜∆ k ( f ) |H k ] ≤ (1 − 1 T )
˜ O
(( d s + s a ) H 32 T )
+ 1 T 2 HR max ∗ [ T H ] =
˜ O ( H 32 d √ T ) , where 2 HR max is the upper bound on the difference of value functions, and d = d s + d a .
By similar derivation, E [Σ [ TH ] k =1 ˜∆ k ( r ) |H
k ] =
˜ O ( √ dHT ) .
Finally, through the tower property we have
BayesRegret ( T, π ps , M ∗ ) =
˜ O ( H 32 d √ T ) .
(cid:3) do
Obtain
∈ arg max i
i
E [
D
D updated representa tions
4. N ONLINEAR CASE VIA FEATURE REPRESENTATION
We can slightly modify the previous proof to derive the bound in settings that use feature representations.
We can transform the state-action pair ( s, a ) to φ f ( s, a ) ∈ R d φ as the input of the transition model , and transform the newly transitioned state s (cid:48) to ψ f ( s (cid:48) )
∈
R d ψ as the target, then the transition model can be established with respect to this feature embedding.
We further assume d ψ = O ( d φ ) as in Yang & Wang (2019).
Besides, we assume d φ (cid:48)
=
O ( d φ ) in the feature representation φ r ( s, a
) ∈ R d φ (cid:48) , then the reward model can also be established with respect to the feature embedding.
Following similar steps, we can derive a Bayesian regret of ˜ O
( H 3 / 2 d φ √ T ) .
A LGORITHM D ESCRIPTION
In this section, we elaborate our proposed algorithm, MPC-PSRL, as shown in Algorithm 1.
5. P REDICTIVE MODEL
When model the rewards and transitions, we use features extracted from the penultimate layer of ﬁtted neural networks, and perform Bayesian linear regression on the feature vectors to update posterior distributions.
Feature representation: we ﬁrst ﬁt neural networks for transitions and rewards, using the same network architecture as Chua et al.
Let x i denote the state-action pair ( s i , a i ) and
y i denote the target value.
Speciﬁcally, we use reward r i as y i to ﬁt rewards, and we take the difference between two consecutive states s i +
− s i as y i to ﬁt transitions.
The penultimate layer of ﬁtted neural networks is extracted as the feature representation, denoted as φ f and φ r for transitions and rewards, respectively.
Note that in the transition feature embedding, we only use one neural network to extract features of state-action pairs from the penultimate layer to serve as φ , and leave the target states without further feature representation (the general setting is discussed in Section 4.2 where feature representations are used for both inputs and outputs), so the dimension of the target in the transition model d ( ψ ) equals to d s .
Thus we have a modiﬁed regret bound of ˜ O
( H 3 / 2 (cid:112) dd φ T ) .
We do not ﬁnd the necessity to further extract feature representations in the target space, as it might introduce additional computational overhead.
Although higher dimensionality of the hidden layers might imply better representation, we ﬁnd that only modifying the width of the penultimate layer to d φ =
d s + s a sufﬁces in our experiments for both reward and transition models.
Note that how to optimize the dimension of the penultimate layer for more efﬁcient feature representation deserves further exploration.
Bayesian update and posterior sampling: here we describe the Bayesian update of transition and reward models using extracted features.
Recall that Gaussian process with linear kernels is equivalent to Bayesian linear regression.
By extracting the penultimate layer as feature representation φ , the target value y and the representation φ ( x ) could be seen as linearly related: y = w (cid:62) φ ( x ) + (cid:15) , where (cid:15) is a zero-mean Gaussian noise with variance σ 2 (which is σ 2 f for the transition model and σ 2 r for the reward model as deﬁned in Section 3.1)
Gaussian with covariance matrix Σ p , then the posterior distribution of w is also multivariate Gaussian (Rasmussen (2003)):
[Equation]
where A = σ − 2 ΦΦ (cid:62) + Σ − 1 p , Φ ∈ R d × N is the concatenation of feature representations { φ ( x i ) } Ni =1 , and Y ∈ R N is the concatenation of target values.
At the beginning of each episode, we sample w from the posterior distribution to build the model, collect new data during the whole episode, and update the posterior distribution of w at the end of the episode using all the data collected.
Besides the posterior distribution of w , the feature representation φ is also updated in each episode with new data collected.
We adopt a similar dual-update procedure as Riquelme et al.
(2018): after representations for rewards and transitions are updated, feature vectors of all state-action pairs collected are re-computed.
Then we apply Bayesian update on these feature vectors.
See the description of Algorithm 1 for details.
5. PLANNING
During interaction with the environment, we use a MPC controller (Camacho & Alba (2013)) for planning.
At each time step i , the controller takes state s i and an action sequence a i : i + τ = { a i , a i +1 , · · · , a i + τ } as the input, where τ is the planning horizon.
We use transition and reward models to produce the ﬁrst action a i of the sequence of optimized actions arg max a i : i + τ (cid:80) i + τ t
= i E [ r ( s t , a t )] , where the expected return of a series of actions can be approximated using the mean return of several particles propagated with noises of our sampled reward and transition models.
To compute the optimal action sequence, we use CEM (Botev et al.
(2013)), which samples actions from a distribution closer to previous action samples with high rewards.
E XPERIMENTS
We compare our method with the following state-of-the art model-based and model-free algorithms on benchmark control tasks.
Model-free: Soft Actor Critic (SAC) from Haarnoja et al.
(2018) is an off-policy deep actor-critic algorithm that utilizes entropy maximization to guide exploration.
Deep Deterministic Policy Gradient (DDPG) from Barth-Maron et al.
(2018) is an off-policy algorithm that concurrently learns a Qfunction and a policy, with a discount factor to guide exploration.
Model-based: Probabilistic Ensembles with Trajectory Sampling (PETS) from Chua et al.
(2018) models the dynamics via an ensemble of probabilistic neural networks to capture epistemic uncertainty for exploration, and uses MPC for action selection, with a requirement to have access to oracle rewards for planning.
Model-Based Poilcy Optimization (MBPO) from Janner et al.
(2019) uses the same bootstrap ensemble techniques as PETS in modeling, but differs from PETS in policy optimization with a large amount of short model-generated rollouts, and can cope with environments with no oracle rewards provided.
We do not compare with Gal et al.
(2016), which adopts a single Bayesian neural network (BNN) with moment matching, as it is outperformed by PETS that uses an ensemble of BNNs with trajectory sampling.
And we don’t compare with GP-based trajectory optimization methods with real rewards provided (Deisenroth & Rasmussen, 2011; Kamthe & Deisenroth, 2018), which are not only outperformed by PETS, but also computationally expensive and thus are limited to very small state-action spaces.
We use environments with various complexity and dimensionality for evaluation.
Low-dimensional environments: continuous Cartpole ( d s = 4 , d a = 1 , H = 200 , with a continuous action space compared to the classic Cartpole, which makes it harder to learn) and Pendulum Swing Up ( d s = 3 , d a = 1 , H = 200 , a modiﬁed version of Pendulum where we limit the start state to make it harder for exploration).
Trajectory optimization with oracle rewards in these two environments is easy and there is almost no difference in the performances for all model-based algorithms we compare, so we omit showing these learning curves.
Higher dimensional environments: 7-DOF Reacher ( d s = 17 , d a = 7 , H = 150 ) and 7-DOF pusher ( d s = 20 , d a = 7 , H = 150 ) are two more challenging tasks as provided in Chua et al.
(2018), where we conduct experiments both with and without true rewards, to compare with all baseline algorithms mentioned.
The learning curves of these algorithms are showed in Figure 1.
When the oracle rewards are provided in Pusher and Reacher, our method outperforms PETS and MBPO:
it converges more quickly with similar performance at convergence in Pusher, while in Reacher, not only does it learn faster but also performs better at convergence.
As we use the same planning method (MPC) as PETS, results indicate that our model better captures uncertainty, which is beneﬁcial to improving sample efﬁciency.
When exploring in environments where both rewards and transition are unknown, our method learns signiﬁcantly faster than previous model-based and model-free methods which do no require oracle rewards.
Meanwhile, it matches the performance of SAC at convergence.
Moreover, the performances of our algorithm in environments with and without oracle rewards can be similar, or even faster convergence (see Pusher with and without rewards), indicating that our algorithm excels at exploring both rewards and transitions.
From experimental results, it can be veriﬁed that our algorithm better captures the model uncertainty, and makes better use of uncertainty using posterior sampling.
In our methods, by sampling from a
Bayesian linear regression on a ﬁtted feature space, and optimizing under the same sampled MDP in the whole episode instead of re-sampling at every step, the performance of our algorithm is guaranteed from a Bayesian view as analysed in Section 4.
While PETS and MBPO use bootstrap ensembles of models with a limited ensemble size to "simulate" a Bayesian model, in which the convergence of the uncertainty is not guaranteed and is highly dependent on the training of the neural network.
However, in our method there is a limitation of using MPC, which might fail in even higher-dimensional tasks shown in Janner et al.
Incorporating policy gradient techniques for action-selection might further improve the performance and we leave it for future work.
C ONCLUSION
In our paper, we derive a novel Bayesian regret for PSRL algorithm in continuous spaces with the assumption that true rewards and transitions (with or without feature embedding) can be modeled by
GP with linear kernels.
While matching the best-known bounds in previous works from a Bayesian view, PSRL also enjoys computational tractability.
Moreover, we propose MPC-PSRL in continuous environments, and experiments show that our algorithm exceeds existing model-based and model-free methods with more efﬁcient
A A PPENDIX A. P ROOF OF L EMMA
Here we provide a proof of Lemma 1.
We ﬁrst prove the results in R d with d = 1 : p 1 ( x ) ∼ N ( µ, σ 2 ) , p 2 ( x ) ∼ N ( µ (cid:48) , σ 2 ) , without loss of generality, assume µ (cid:48) ≥ µ .
The probabilistic distribution is symmetric with regard to µ + µ (cid:48) 2 .
Note that p 1 ( x ) =
p 2 ( x ) at x = µ + µ (cid:48) 2 .
Thus the integration of absolute difference between pdf of p 1 and pcan be simpliﬁed as twice the integration of one side:
[Equation]
let z 1 = x − µ
[Equation]
z 2 = x − µ (cid:48)
[Equation]
we have:
[Equation]
Now we extend the result to R d ( d ≥ 2) : p 1 ( x ) ∼ N ( µ, σ 2 I ) , p 2 ( x ) ∼ N ( µ (cid:48) , σ 2 I ) .
We can rotate the coordinate system recursively to align the last axis with vector µ − µ (cid:48) , such that the coordinates of µ and µ (cid:48) can be written as (0 , 0 , · · · , 0 , ˆ µ ) , and (0 , 0 , · · · , 0 , ˆ µ (cid:48) ) respectively, with | ˆ µ (cid:48)
− ˆ µ | = (cid:107) µ − µ (cid:48)
(cid:107) 2 .
Without loss of generality, let ˆ µ ≥ ˆ µ (cid:48) .
Clearly, all points with equal distance to ˆ µ (cid:48) and ˆ µ deﬁne a hyperplane P : x d = ˆ µ +ˆ µ (cid:48)where p 1 ( x ) =
p 2 ( x ) , ∀ x ∈ P .
More speciﬁcally, the probabilistic distribution is symmetric with regard to
P .
Similar to the analysis in R 1 :
[Equation]
let z
= x d − ˆ µ , z 2 = x d − ˆ µ (cid:48) , we have:
[Equation]
A. E XPERIMENTAL DETAILS
Here we provide hyperparameters for MBPO: env cartpole pendulum pusher reacher env steps per episode    model rollouts per env step ensemble size networkarchitecture
MLP with 2 hidden layers of size MLP with 2 hidden layers of size
MLP with 4 hidden layers of size
MLP with 4 hidden layers of sizepolicy updates per env step model horizon 1->15 from episode 1-> 1->15 from episode 1->  1->15 from episode 1->
And we provide hyperparamters for MPC and Neural Networks in PETS: env pusher reacher env steps per episode  popsize  number of elites  network architecture
MLP with
[Table]
layers of sizeplanning horizon  max iter ensemble size
Here are hyperparameters of our algorithm, which is similar with PETS, except for ensemble size(since we do not use ensembled models):
[Table]
pendulum pusher reacher
[Table]
[Table]
numberofelites    networkarchitecture
MLP with 2 hidden layers of size MLP with 2 hidden layers of size
MLP with 4 hidden layers of size
MLP with 4 hidden layers of sizeplanninghorizon    max iter
For SAC and DDPG, we use the open source code ( https://github.com/dongminlee94/ deep_rl ) for implementation without changing their hyperparameters.
Here we thank the author for sharing the code!