W OULDA , COULDA , SHOULDA : C OUNTERFACTUALLY - GUIDED POLICY SEARCH
A BSTRACT
Learning policies on data synthesized by models can in principle quench the thirst of reinforcement learning algorithms for large amounts of real experience, which is often costly to acquire.
However, simulating plausible experience de novo is a hard problem for many complex environments, often resulting in biases for modelbased policy evaluation and search.
Instead of de novo synthesis of data, here we assume logged, real experience and model alternative outcomes of this experience under counterfactual actions, i.e. actions that were not actually taken.
Based on this, we propose the Counterfactually-Guided Policy Search (CF-GPS) algorithm for learning policies in POMDPs from off-policy experience.
It leverages structural causal models for counterfactual evaluation of arbitrary policies on individual off-policy episodes.
CF-GPS can improve on vanilla model-based RL algorithms by making use of available logged data to de-bias model predictions.
In contrast to off-policy algorithms based on Importance Sampling which re-weight data, CF-GPS leverages a model to explicitly consider alternative outcomes, allowing the algorithm to make better use of experience data.
We ﬁnd empirically that these advantages translate into improved policy evaluation and search results on a non-trivial grid-world task.
Finally, we show that CF-GPS generalizes the previously proposed Guided Policy Search and that reparameterization-based algorithms such Stochastic Value
Gradient can be interpreted as counterfactual methods.
I NTRODUCTION
Imagine that a month ago Alice had two job offers from companies a 1 and a 2 .
She decided to join a 1 because of the larger salary, in spite of an awkward feeling during the job interview.
Since then she learned a lot about a 1 and recently received information about a 2 from a friend, prodding her now to imagine what would have happened had she joined a 2 .
Re-evaluating her decision in hindsight in this way, she concludes that she made a regrettable decision.
She could and should have known that a 2 was a better choice, had she only interpreted the cues during the interview correctly...
This example tries to illustrate the everyday human capacity to reason about alternate, counterfactual outcomes of past experience with the goal of “mining worlds that could have been” (Pearl &
Mackenzie, 2018).
Social psychologists theorize that such cognitive processes are beneﬁcial for improving future decision making (Roese, 1997).
In this paper we aim to leverage possible advantages of counterfactual reasoning for learning decision making in the reinforcement learning (RL) framework.
In spite of recent success, learning policies with standard, model-free RL algorithms can be notoriously data inefﬁcient.
This issue can in principle be addressed by learning policies on data synthesized from a model.
However, a mismatch between the model and the true environment, often unavoidable in practice, can cause this approach to fail (Talvitie, 2014), resulting in policies that do not generalize to the real environment (Jiang et al., 2015).
Motivated by the introductory example, we propose the Counterfactually-Guided Policy Search (CF-GPS) algorithm:
Instead of relying on data synthesized from scratch by a model, we train policies on model predictions of alternate outcomes of past experience from the true environment under counterfactual actions, i.e. actions that had not actually been taken, while everything else remaining the same (Pearl, 2009).
At the heart of CF-GPS are structural causal models (SCMs) which model the environment with two ingredients (Wright, 1920): 1) Independent random variables, called scenarios here, summarize all aspects of the environment that cannot be inﬂuenced by the agent, e.g. the properties of the companies in Alice’s job search example.
Deterministic transition functions (also called causal mechanisms ) take these scenarios, together with the agent’s actions, as input and produce the predicted outcome.
The central idea of CF-GPS is that, instead of running an agent on scenarios sampled de novo from a model, we infer scenarios in hindsight from given off-policy data, and then evaluate and improve the agent on these speciﬁc scenarios using given or learned causal mechanisms (Balke & Pearl, 1994).
We show that CF-GPS generalizes and empirically improves on a vanilla model-base RL algorithm, by mitigating model mismatch via “grounding” or “anchoring” model-based predictions in inferred scenarios.
As a result, this approach explicitly allows to trade-off historical data for model bias.
CFGPS differs substantially from standard off-policy RL algorithms based on Importance Sampling (IS), where historical data is re-weighted with respect to the importance weights to evaluate or learn new policies (Precup, 2000).
In contrast, CF-GPS explicitly reasons counterfactually about given off-policy data.
Our main contributions are:
We formulate model-based RL in POMDPs in terms of structural causal models, thereby connecting concepts from reinforcement learning and causal inference.
We provide the ﬁrst results, to the best of our knowledge, showing that counterfactual reasoning in structural causal models on off-policy data can facilitate solving non-trivial RL tasks.
We show that two previously proposed classes of RL algorithms, namely Guided Policy Search (Levine & Koltun, 2013) and Stochastic Value Gradient methods (Heess et al. , can be interpreted as counterfactual methods, opening up possible generalizations.
The paper is structured as follows.
We ﬁrst give a self-contained, high-level recapitulation of structural causal models and counterfactual inference, as these are less widely known in the RL and generative model communities.
In particular we show how to model POMDPs with SCMs.
Based on this exposition, we ﬁrst consider the task of policy evaluation and discuss how we can leverage counterfactual inference in SCMs to improve over naive model-based methods.
We then generalize this approach to the policy search setting resulting in the CF-GPS algorithm.
We close by highlighting connections to previously proposed algorithms and by discussing assumptions and limitations of the proposed method.
P RELIMINARIES
We denote random variables (RVs) with capital letters, e.g. X , and particular values with lower caps, e.g. x .
For a distribution P over a vector-valued random variable X , we denote the marginal over Y ⊂
X by P Y (and density p Y ); however we often omit the subscript if it is clear from the context, e.g. as in Y ∼ P .
We assume the episodic, Partially Observable Markov Decision
Process (POMDP) setting with states S t , actions A t and observations
O t , for t = 1 , . .
, T .
For ease of notation, we assume that O t includes the reward R t .
The undiscounted return is denoted by
G = (cid:80) Tt =1 R t .
We consider stochastic policies π ( a t | h t ) over actions conditioned on observation histories H t
= ( O 1 , A 1 , . . .
, A t − 1 , O t ) .
We denote the resulting distribution over trajectories T =
( S 1 , O 1 , A 1 , . . .
, A T − 1 , S T , O T ) induced by running π in the environment with T ∼ P π and the corresponding density by p π
( τ ) .
2. S TRUCTURAL C AUSAL M ODELS
Deﬁnition 1 (Structural causal model) .
A structural causal model (SCM) M over X =
( X 1 , . . .
, X N ) is given by a DAG G over nodes X , independent noise RVs U =
( U 1 , . . .
, U N ) with distributions P U i and functions f 1 , . . .
, f N such that X i
=
f i (pa i , U i ) , where pa i ⊂
X are the parents of X i in G .
An SCM entails a distribution P with density p over ( X, U ) .
We also refer to U as scenarios and to f i as causal mechanisms.
We give a (broad) deﬁnition of an intervention in an SCM.
This also includes what is known as stochastic interventions or mechanism changes (Korb et al., 2004) which generalize atomic interventions (Pearl, 2009).
U c
A U a
U o
O
U s
O 1 U o
H
A 1 U a
S
U s
O 2 U o
H
A 2 U a
S
U s
Deﬁnition 2 (Intervention in SCM) .
An intervention I in an SCM M consists of replacing some of the original f i (pa i , U i ) with other functions
f I i (pa I
i , U i ) where pa I i are the parents in a new DAG
G I . We denote the resulting SCM with M do( I ) with distribution P do( I ) and density p do( I ) . SCM representation of POMDPs We can represent any given POMDP (under a policy π ) by an
SCM M over trajectories T in the following way.
We express all conditional distributions, e.g. the transition kernel P S t +1 | S t ,A t , as deterministic functions with independent noise variables U , such as
S t +1 =
f st ( S t , A t , U st ) .
This is always possible using auto-regressive uniformization, see Lemma 2 in the appendix.
The DAG G of the resulting SCM is shown in ﬁg. 1.
This procedure is closely related to the ‘reparameterization trick’ for models with location-scale distributions (Kingma & Welling, 2013; Rezende et al., 2014).
We denote the distribution over T entailed by the SCM with P π and its density by p π to highlight the role of π ; note the difference to the true environment distribution P π with density p π .
Running a different policy µ instead of π in the environment can be expressed as an intervention I ( π → µ ) consisting of replacing A t =
f π
( H t , U at ) by A t = f µ ( H t , U at ) .
We denote the resulting model distribution over trajectories with P do( I ( π → µ ))
=
P µ (analogously p µ ).
Intuition Here, we illustrate the main advantage of SCMs using the example of Alice’s job choice from the introduction.
We model it as contextual bandit with feedback shown in ﬁg. 1.
Alice has some initial knowledge given by the context U c
that is available to her before taking action A of joining company A = a 1 or A = a 2 .
We model Alice’s decision as A =
f π
( U c , U a ) , where U a captures potential indeterminacy in Alice’s decision making.
The outcome O = f
o ( A, U c , U o ) also depends on the scenario
U o , capturing all relevant, unobserved and highly complex properties of the two companies such as working conditions etc.
Given this model, we can reason about alternate outcomes
f o ( a 1 , u c , u o ) and f o ( a 2 , u c , u o ) for same the scenario u o .
This is not possible if we only model the outcome on the level of the conditional distribution P O | A,U c .
2. C OUNTERFACTUAL INFERENCE IN SCM S
For an SCM over X , we deﬁne a counterfactual query as a triple (ˆ x o , I, X q ) of observations ˆ x o of some variables X o ⊂ X , an intervention I and query variables X q ⊂ X .
The semantics of the query are that, having observed ˆ x o , we want to infer what X q would have been had we done intervention
I , while ‘ keeping everything else the same ’.
Counterfactual inference (CFI) in SCMs answers the query in the following way (Balke & Pearl, 1994):
Infer the unobserved noise source U conditioned on the observations ˆ x o , i.e. compute p ( U | ˆ x o ) and replace the prior p ( U ) with p ( U | ˆ x o ) .
Denote the resulting SCM by M ˆ x o . 2.
Perform intervention I on M ˆ x o .
This yields M do( I )
ˆ x o , which entails the counterfactual distribution p do( I )
| ˆ x o ( x ) .
Return the marginal p do( I ) | ˆ x o ( x q ) .
Note that our deﬁnition explicitly allows for partial observations X o ⊂ X in accordance with Pearl (2009).
A sampled-based version, denoted as CFI, is presented in Algorithm 1.
An interesting property of the counterfactual distribution p do( I )
| ˆ x o is that marginalizing it over observations
ˆ x o yields an unbiased estimator of the density of X q under intervention I .
Lemma 1 (CFI for simulation) .
Let observations ˆ x o ∼ p come from a SCM M with density p .
Then the counterfactual density p do( I )
| ˆ x o is an unbiased estimator of p do( I ) , i.e.
[Equation]
The proof is straightforward and outlined in the Appendix A.
This lemma and the marginal independence of the U i leads to the following corollary; the proof is given in the appendix.
Corollary 1 (Mixed counterfactual and prior simulation from an SCM) .
Assume we have observations ˆ x o ∼ p .
We can simulate from M , under any intervention I , i.e. obtain unbiased samples from M do( I ) , by ﬁrst sampling values u CF for an arbitrary subset U CF ⊂
U from the posterior p ( u CF
| ˆ x o ) and the remaining U Prior :=
U \ U CF from the prior p ( u Prior ) , and then computing X with noise u = u CF ∪ u Prior .
The corollary essentially states that we can sample from the model M I , by sampling some of the U i from the prior, and inferring the rest from data ˆ x o (as long as the latter was also sampled from M ).
We will make use of this later for running a POMDP model on scenarios U st inferred from data while randomizing the action noise U at .
We note that the noise variables U CF from the posterior P U CF | ˆ x o are not independent anymore.
Nevertheless, SCMs with non-independent noise distributions arising from counterfactual inference, denoted here by M ˆ x o , are commonly considered in the literature (Peters et al., 2017).
Intuition Returning to Alice’s job example from the introduction, we give some intuition for counterfactual inference in SCMs.
Given the concrete outcome ˆ o , under observed context ˆ u c and having joined company ˆ a = a 1 , Alice can try to infer the underlying scenario u o ∼ p ( u o | a 1 , ˆ u c , ˆ o ) that she experiences; this includes factors such as work conditions etc.
She can then reason counterfactually about the outcome had she joined the other company, which is given by f o ( a 2 , ˆ u c , u o ) .
This can in principle enable her to make better decisions in the future in similar scenarios by changing her policy f π
( A, U c , U a ) such that the action with the preferred outcome becomes more likely under ˆ u c , u o .
In particular she can do so without having to use her (likely imperfect) prior model over possible companies p ( U o ) .
She can use the counterfactual predictions discussed above instead to learn from her experience.
We use this insight for counterfactual policy evaluation and search below.
O FF - POLICY EVALUATION : M ODEL - FREE , MODEL - BASED AND COUNTERFACTUAL
To explain how counterfactual reasoning in SCMs can be used for policy search, we ﬁrst consider the simpler problem of policy evaluation (PE) on off-policy data.
The goal of off-policy
PE is to determine the value of a policy π , i.e. its expected return E p
π
[ G ] , without running the policy itself.
We assume that we have data D
= { ˆ h iT } i =1 ,...,N consisting of logged episodes ˆ h iT =
(ˆ o i 1 , ˆ a i 1 , . . .
ˆ a iT − 1 , ˆ o iT ) from running a behavior policy µ .
A standard, model-free approach to PE is to use Importance sampling (IS): We can estimate the policy’s value as (cid:80) i
w i
ˆ G i , where ˆ G i is the empirical return of ˆ h iT and w i ∝ p π
(ˆ h iT ) p µ (ˆ h iT ) are importance weights.
However, if the trajectory densities p π and p µ are very different, then this estimator has large variance.
In the extreme case, IS can be useless if the support of p µ does not contain that of p π , irrespective of how much data from p µ is available.
If we have access to a model M , then we can evaluate the policy on synthetic data, i.e. we can estimate E p π [ G ] .
This is called model-based policy evaluation (MB-PE).
However, any bias in M propagates from p π to the estimate E p π [ G ] .
In the following, we assume that M is a SCM and we show that we can use counterfactual reasoning for off-policy evaluation (CF-PE).
As the main result for this section, we argue that we expect CF-PE to be less biased than MB-PE, and we illustrate this point with experiments.
// Counterfactual inference (CFI) 1: procedure CFI(data ˆ x o , SCM M , intervention I , query X q ) 2: ˆ u ∼ p ( u | ˆ x o ) (cid:46) posterior 3: p ( u ) ← δ ( u − ˆ u ) (cid:46)
4: f i ← f Ii (cid:46) Perform intervention I 5: return x q ∼ p do( I ) ( x q | ˆ u ) (cid:46) Simulate from the resulting model
M I ˆ x o 6: end procedure // Counterfactual Policy Evaluation (CF-PE) 7: procedure CF-PE(SCM M , policy π , replay buffer D , number of samples N ) 8: for i ∈ { 1 , . . .
N } do 9:
ˆ h iT ∼ D (cid:46) the replay buffer 10: g i =
CFI(ˆ h
iT , M , I ( µ → π ) , G ) (cid:46) return 11: end for 12: return 1 N (cid:80) Ni
=1 g i 13: end procedure //
Counterfactually-Guided Policy Search (CF-GPS) 14: procedure CF-GPS(SCM M , initial policy π 0 , number of trajectory samples N ) 15: for k = 1 , . . .
do 16: if sometimes then 17: µ ← π k (cid:46) Update behavior policy 18: end if 19: for i = 1 , . .
. , N do 20:
ˆ h iT ∼ p µ (cid:46) Get off-policy data from the true environment 21: τ i = CFI(ˆ h iT , M , I ( µ → π λ ) , T ) (cid:46) Counterfactual rollouts under planner 22: end for 23: π k ← policy improvement on trajectories τ i =1 ,...,N using eqn.24: end for 25: end procedure
Naive MB-PE with a SCM M simply consist of sampling the scenarios U ∼ P U from the prior, and then simulating a trajectory τ from the functions f i and computing its return. However, given data
D from p µ , our discussion of counterfactual inference in SCMs suggests the following alternative strategy:
Assuming no model mismatch, i.e. p µ = p µ , we can regard the task of off-policy evaluation of π as a counterfactual query with data ˆ h iT , intervention I ( µ → π ) and query variable G .
In other words, instead of sampling from the prior as in MB-PE, we are free to the scenarios from the posterior u i ∼ p µ ( ·| ˆ h iT ) .
The algorithm is given in Algorithm 1.
Lemma 1 guarantees that this results in an unbiased estimate:
Corollary 2 (CF-PE is unbiased) .
Assuming no model mismatch, CF-PE is unbiased.
Furthermore, Corollary 1 allows us to also sample some of the noise variables from the prior instead of the posterior, we can e.g. randomize the counterfactual actions by re-sampling the action noise
U a .
Motivation When should one prefer CF-PE over the more straightforward MB-PE?
Assuming a perfect model, Corollary 2 states that both yield the same answer in expectation for perfect models.
For imperfect models however, these algorithms can differ substantially.
MB-PE relies on purely synthetic data, sampled from the noise distribution p ( U ) .
In practice, this is usually approximated by a parametric density model, which can lead to under-ﬁtting in case of complex distributions.
This is a well-known effect in generative models with latent variables:
In spite of recent research progress, e.g. models of natural images are still unable to accurately model the variability of the true data (Gregor et al., 2016).
In contrast, CF-PE samples from the posterior N − 1 (cid:80) Ni =1 p µ ( U | ˆ h iT ) , which has access to strictly more information than the prior p ( U ) by taking into account additional data ˆ h i T .
This semi-nonparametric distribution can help to de-bias the model by effectively winnowing out parts of the domain of U which do not correspond to any real data.
We substantiate this intuition with experiments below; a concrete illustration for the difference between the prior and posterior / counterfactual distribution is given in ﬁg. 4 in the appendix and discussed in appendix D. Therefore, we conclude that we expect CF-PE to outperform MB-PE, if the transition and reward kernels f st are accurate models of the environment dynamics, but if the marginal distribution over the noise sources P U is difﬁcult to model.
3. E XPERIMENTS
Environment As an example, we use a partially-observed variant of the SOKOBAN environment, which we call PO-SOKOBAN.
The original SOKOBAN puzzle environment was described in detail by Racani`ere et al.
(2017); we give a brief summary here.
The agent is situated in a 10 ×grid world and its ﬁve actions are to move to one of four adjacent tiles and a NOOP.
In our variant, the goal is to push all three boxes onto the three targets.
As boxes cannot be pulled, many actions result irreversibly in unsolvable states.
Episodes are of length T = 50 , and pushing a box onto a target yields a reward of 1 , removing a box from a target yields − 1 , and solving a level results in an additional reward of 10 .
The state of the environment consists in a 10 × 10 matrix of categorical variables taking values in { 0 , . .
, 6 } indicating if the corresponding tile is empty, a wall, box, target, agent, or a valid combinations thereof (box+target and agent+target).
In order to introduce partial observability, we deﬁne the observations as the state corrupted by i.i.d.
(for each tile and time step) ﬂipping each categorical variable to the “empty” state with probability 0 .
Therefore, the state of the game is largely unobserved at any given time, and a successful agent has to integrate observations over tens of time steps.
Initial states U s 1 , also called levels , which are the scenarios in this environment, are generated randomly by a generator algorithm which guarantees solvability (i.e. all boxes can be pushed onto targets).
The environment is visualized in ﬁg. 3 in the appendix.
Given the full state of PO-SOKOBAN, the transition kernel is deterministic and quite simple as only the agent and potentially an adjacent box moves.
Inferring the belief state, i.e. the distribution over states given the history of observations and actions, can however range from trivial to very challenging, depending on the amount of available history.
In the limit of a long observed history, every tile is eventually observed and the belief state concentrates on a single state (the true state) that can be easily inferred.
With limited observed history however, inferring the posterior distribution over states (belief state) is very complex.
Consider e.g. the situation in the beginning of an episode (before pushing the ﬁrst box).
Only the ﬁrst observation is available, however we know that all POSOKOBAN levels are initially guaranteed to be solvable and therefore satisfy many combinatorial constraints reﬂecting that the agent is still able to push all boxes onto targets.
Learning a compact parametric model of the initial state distribution from empirical data is therefore difﬁcult and likely results in large mismatch between the learned model and the true environment.
Results To illustrate the potential advantages of CF-PE over MB-PE we perform policy evaluation in the PO-SOKOBAN environment.
We ﬁrst generate a policy π that we wish to evaluate, by training it using a previously-proposed distributed RL algorithm (Espeholt et al., 2018).
The policy is parameterized as a deep, recurrent neural network consisting of a 3-layer deep convolutional
LSTM (Xingjian et al., 2015) with 32 channels per layer and kernel size of 3.
To further increase computational power, the LSTM ticks twice for each environment step.
The output of the agent is a value function and a softmax yielding the probabilities of taking the 5 actions.
In order to obtain an SCM of the environment, for the sake of simplicity, we assume that the ground-truth transition, observation and reward kernels are given.
Therefore the only part of the model that we need to learn is the distribution p ( U s 1 ) of initial states S
=
U s 1 (for regular MB-PE), and the density p ( U s 1 | ˆ h it ) for inferring levels in hindsight for CF-PE.
We vary the amount of true data t that we condition this inference on, ranging from t =
(no real data, equivalent to MB-PE) to t =
T =(a full episode of real data is used to infer the initial state U s 1 ).
We train a separate model for each t ∈ { 0 , 5 , 10 , 20 , 30 , 40 , 50 } .
To simplify model learning, both models were given access to the unobserved state during training, but not at test time.
The models are chosen to be powerful, multilayer, generative DRAW models (Gregor et al., 2015) trained by approximate maximum likelihood learning (Kingma & Welling, 2013; Rezende et al., 2014).
The models take as input the (potentially empty) data ˆ h it summarized by a backward RNN (a standard convolutional LSTM model withunits).
The model is shown in ﬁg. 3 in the appendix and additional details are given in appendix
C. The data ˆ h i T was collected under a uniform random policy µ .
For all policy evaluations, we use ≈ > 10 5 levels u i from the inferred model.
In order to evaluate policies of different proﬁciency, we derive from the original (trained)
π three policies π 0 , π 1 , π 2 ranging from almost perfect to almost random performance by introducing additional stochasticity during action selection.
The policy evaluation results are shown in ﬁg. 2.
We found that for t = 0 , in spite of extensive hyper-parameter search, the model p ( U s 1 ) was unable to accurately capture the marginal distribution of initial levels in PO-SOKOBAN.
As argued above, a solvable level satisﬁes a large number of complex constraints that span the entire grid world, which are hard for a parametric model to capture.
Empirically, we found that the model mismatch manifested itself in samples from p ( U s 1 ) not being well-formed, e.g. not solvable, and hence the performance of the policies
π i are very different on these synthetic levels compared to levels sampled form p .
However, inferring levels from full observed episodes i.e. p ( U s 1 |
ˆ h i 50 ) was reliable, and running π on these resulted in accurate policy evaluation.
The ﬁgure also shows the trade-off between policy evaluation accuracy and the amount of off-policy data for intermediate amounts of the data
ˆ h it .
We also want to emphasize that in this setting, model-free policy evaluation by IS fails.
The uniform behavior policy µ was too different from π i , resulting in a relative error > 0 .
8 for all i = 1 , 2 , 3 .
O FF -P OLICY IMPROVEMENT : C OUNTERFACTUALLY - GUIDED POLICY SEARCH
In the following we show how we can leverage the insights from counterfactual policy evaluation for policy search.
We commence by considering a model-based RL algorithm and discuss how we can generalize it into a counterfactual algorithm to increase its robustness to model mismatch.
We chose a particular algorithm to start from to make a connection to the previously proposed Guided
Policy Search algorithm (Levine & Koltun, 2013; Levine & Abbeel, 2014), but we think a larger class of MBRL algorithms can be generalized in an analogous manner.
4. S TARTING POINT : V ANILLA MODEL - BASED RL WITH RETURN WEIGHTED REGRESSION
We start from the following algorithm.
We assume we have a model M of the environment with trajectory distribution p π .
Our current policy estimate π k is improved at iteration k using returnweighted regression:
[Equation]
where G ( τ ) is the return of trajectory τ .
This policy improvement step can be motivated by the framework of RL as variational inference (Toussaint, 2009) and is equivalent to minimizing the KL divergence to a trajectory distribution ∝ exp( G ) p π k which puts additional mass on high-return trajectories.
Although not strictly necessary for our exposition, we also allow for a dedicated proposal distribution over trajectories p λ ( τ ) , under a policy λ .
We refer to λ as a planner to highlight that it could consist of a procedure that solves episodes starting from arbitrary, full states s 1 sampled form the model, by repeatedly calling the model transition kernel, e.g. a search procedure such as
MCTS (Browne et al., 2012) or an expert policy.
Concretely, we optimize the following ﬁnite sample objective:
[Equation]
We refer to this algorithm as model-based policy search (MB-PS).
It is based on model rollouts τ i spanning entire episodes.
An alternative would be to consider model rollouts starting from states visited in the real environment (if available).
Both versions can be augmented by counterfactual methods, but for the sake of simplicity we focus on the simpler MB-PS version detailed above (also we did not ﬁnd signiﬁcant performance differences experimentally between both versions).
4. I NCORPORATING OFF - POLICY DATA : C OUNTERFACTUALLY - GUIDED POLICY SEARCH
Now, we assume that the model M is an SCM.
Based on our discussion of counterfactual policy evaluation, it is straightforward to generalize the MB-PS described above by anchoring the rollouts τ i under the model p λ in off-policy data D : Instead of sampling τ
i directly from the prior p λ , we draw them from counterfactual distribution p λ | ˆ h iT with data
ˆ h iT ∼ D from the replay buffer, i.e. instead of sampling the scenarios U from the prior we infer them from the given data.
Again invoking Lemma 1, this procedure is unbiased under no model mismatch.
We term the resulting algorithm Counterfactually-Guided Policy Search (CF-GPS), and it is summarized in Algorithm 1.
The motivation for using CF-GPS over MB-PS is analogous to the advantage of CF-PE over MB-PE discussed in sec.
The policy π in CF-GPS is optimized on rollouts τ i that are grounded in data ˆ h iT by sampling them from the counterfactual distribution p λ | ˆ h iT instead of the prior p λ .
If this prior is difﬁcult to model, we expect the counterfactual distribution to be more concentrated in regions where there is actual mass under the true environment p λ .
4. E XPERIMENTS
We evaluate CF-GPS on the PO-SOKOBAN environment, using a modiﬁed distributed actor-learner architecture based on Espeholt et al.
(2018): Multiple actors (here 64) collect real data ˆ h T by running the behavior policy µ in the true environment p .
As in many distributed RL settings, µ is chosen to be a copy of the policy π , often slightly outdated, so the data must be considered to be offpolicy.
The distribution p ( U s 1 | ˆ h T ) over levels U s 1 is inferred from the data ˆ h T using from the model
M .
We sample a scenario U s 1 for each logged episode, and simulate 10 counterfactual trajectories τ 1 ,..., 10 under the planner λ for each such scenario.
Here, for the sake of simplicity, instead of using search, the planner was assumed to be a mixture between π and a pre-trained expert policy
λ e , i.e. λ = βλ e
+ (1 − β ) π .
The schedule β was set to an exponentially decaying parameter with time constant 10 5 episodes.
The learner performs policy improvement on π using τ 1 ,..., 10 according to eqn.
M was trained online, in the same way as in sec. 3.2.
λ and π were parameterized by deep, recurrent neural networks with the same architecture described in sec.
We compare CF-GPS with the vanilla MB-PS baseline described in sec.
4.1 (based on the same number of policy updates).
MB-PS differs from CF-GPS by just having access to an unconditional model p ( U s 1 |∅ ) over initial states.
We also consider a method which conditions the scenario model p ( U s 1 | o 1 ) on the very ﬁrst observation o 1 , which is available when taking the ﬁrst action and therefore does not involve hindsight reasoning.
This is more informed compared to MB-PS; however due to the noise on the observations, the state is still mostly unobserved rendering it very challenging to learn a good parametric model of the belief state p ( U s 1 | o 1 ) .
We refer to this algorithm as Guided
Policy Search-like (GPS-like), as it roughly corresponds to the algorithm presented by Levine &
Abbeel (2014), as discussed in greater detail in sec.
Fig.
2 shows that CF-GPS outperforms these two baselines.
As expected from the policy evaluation experiments, initial states sampled from the models for GPS and MB-PS are often not solvable, yielding inferior training data for the policy π .
In CF-GPS, the levels are inferred from hindsight inference p ( U 1 | ˆ h T ) , yielding high quality training data.
For reference, we also show a policy trained by the model-free method of Espeholt et al.
(2018) using the same amount of environment data.
Not surprisingly, CF-GPS is able to make better use of the data compared to the model-free baseline as it has access to the true transition and reward kernels (which were not given to the model-free method).
R ELATED W ORK
Bottou et al.
(2013) provide an in-depth discussion of applying models to off-policy evaluation.
However, their and related approaches, e.g. (Li et al., 2015; Jiang & Li, 2015; Swaminathan &
Joachims, 2015; Nedelec et al., 2017; Atan et al., 2016), rely on off-policy evaluation based on
Importance Sampling (IS), also called Propensity Score method.
Although these algorithms are also termed counterfactual policy evaluation, they are not counterfactual in the sense used in this paper, where noise variables are inferred from logged data and reused to evaluate counterfactual actions.
Hence, they are dogged by high variance in the estimators common to IS, in spite of recent improvements (Munos et al., 2016).
Recently (Andrychowicz et al., 2017) proposed the Hindsight
Experience Replay (HER) algorithm for learning a family of goal directed policies.
In HER one observes an outcome in the true environment, which is kept ﬁxed, and searches for the goal-directed policy that should have achieved this goal in order to positively reinforce it.
Therefore, this algorithm is complementary to CF-GPS where we search over alternative outcomes for a given policy.
Our CFGPS algorithm is inspired by and extends work presented by Abbeel et al.
(2006) on a method for debiasing weak models by estimating additive terms in the transition kernel to better match individual, real trajectories.
The resulting model, which is a counterfactual distribution in the terminology used in our paper, is then used for model-based policy improvement.
Our work generalizes this approach and highlights conceptual connections to causal reasoning.
Furthermore, we discuss the connection of CF-GPS to two classes of RL algorithms in greater detail below.
Guided Policy Search (GPS) CF-GPS is closely related to GPS, in particular we focus on GPS as presented by Levine & Abbeel (2014).
Consider CF-GPS in the fully-observed MDP setting where O t =
S t .
Furthermore, assume that the SCM M is structured as follows: Let S t +
= f s ( S t , A t , U st ) be a linear function in ( S t , A t ) with coefﬁcients given by U st .
Further, assume an i.i.d.
Gaussian mixture model on U st for all t .
As the states are fully observed, the inference step in the CFI procedure simpliﬁes: we can infer the noise sources ˆ u st (samples or MAP estimates), i.e. the unknown linear dynamics, from pairs of observed, true states ˆ s t , ˆ s t +1 .
Furthermore assume that the reward is a quadratic function of the state.
Then, the counterfactual distribution p λ ( τ | ˆ u ) is a linear quadratic regulator (LQR) with time-varying coefﬁcients ˆ u .
An appropriate choice for the planner λ is the optimal linear feedback policy for the given LQR, which can be computed exactly by dynamic programming.
Observation 1.
In the MDP setting, CF-GPS with a linear SCM and a dynamic programming planner for LQRs λ is equivalent to GPS.
Another perspective is that GPS is the counterfactual version of the MB-PS procedure from sec. 4.1:
Observation 2.
In the MDP setting with a linear SCM and a dynamic programming planner for
LQRs λ , GPS is the counterfactual variant of the MB-PS procedure outlined above.
The fact that GPS is a successful algorithm in practice shows that the ‘grounding’ of model-based search / rollouts in real, off-policy data afforded by counterfactual reasoning massively improves the naive, ‘prior sample’-based MB-PS algorithm.
These considerations also suggest when we expect
CF-GPS to be superior compared to regular GPS: If the uncertainty in the environment transition
U st cannot be reliably identiﬁed from subsequent pairs of observations
ˆ o t , ˆ o t +1 alone, we expect beneﬁts of inferring U st from a larger context of observations, in the extreme case from the entire history ˆ h T as described above.
Stochastic Value Gradient methods There are multiple interesting connections of CF-GPS to
Stochastic Value Gradient (SVG) methods (Heess et al., 2015).
In SVG, a policy π for a MDP is learned by gradient ascent on the expected return under a model p .
Instead of using the scorefunction estimator, SVG relies on a reparameterization of the stochastic model and policy (Kingma & Welling, 2013; Rezende et al., 2014).
We note that this reparameterization casts p into an SCM.
As in GPS, the noise sources U st are inferred from two subsequent observed states ˆ s t , ˆ s t +1 from the true environment, and the action noise U at is kept frozen.
As pointed out in the GPS discussion, this procedure corresponds to the inference step in a counterfactual query.
Given inferred values u for U , gradients ∂ θ G of the return under the model are taken with respect to the policy parameters θ .
We can loosely interpret these gradients as 2 dim( θ ) counterfactual policy evaluations of policies π ( θ ± ∆ θ i ) where a single dimension i of the parameter vector θ is perturbed.
D ISCUSSION
Simulating plausible synthetic experience de novo is a hard problem for many environments, often resulting in biases for model-based RL algorithms.
The main takeaway from this work is that we can improve policy learning by evaluating counterfactual actions in concrete, past scenarios.
Compared to only considering synthetic scenarios, this procedure mitigates model bias.
However, it relies on some crucial assumptions that we want to brieﬂy discuss here.
The ﬁrst assumption is that off-policy experience is available at all.
In cases where this is e.g. too costly to acquire, we cannot use any of the proposed methods and have to exclusively rely on the simulator / model.
We also assumed that there are no additional hidden confounders in the environment and that the main challenge in modelling the environment is capturing the distribution of the noise sources p ( U ) , whereas we assumed that the transition and reward kernels given the noise is easy to model.
This seems a reasonable assumption in some environments, such as the partially observed grid-world considered here, but not all.
Probably the most restrictive assumption is that we require the inference over the noise U given data ˆ h T to be sufﬁciently accurate.
We showed in our example, that we could learn a parametric model of this distribution from privileged information, i.e. from joint samples u, h T from the true environment.
However, imperfect inference over the scenario U could result e.g. in wrongly attributing a negative outcome to the agent’s actions, instead environment factors.
This could in turn result in too optimistic predictions for counterfactual actions.
Future research is needed to investigate if learning a sufﬁciently strong SCM is possible without privileged information for interesting RL domains.
If, however, we can trust the transition and reward kernels of the model, we can substantially improve model-based RL methods by counterfactual reasoning on off-policy data, as demonstrated in our experiments and by the success of Guided Policy Search and Stochastic
Value Gradient methods.
A P ROOFS A. P ROOF OF L EMMA
Proof.
We start from the fact that the density over noise sources U remains the same for every intervention I as U are root nodes in G :
[Equation]
This leads to:
[Equation]
A. P ROOF OF C OROLLARY
Proof.
Given two sets CF ⊂ { 1 , . . . , N } and Prior ⊂ { 1 , . . . , N } with CF ∩ Prior = ∅ and
CF ∪ Prior = { 1 , . . .
, N } , we deﬁne u CF =
( u n ) n ∈ CF and u Prior = ( u n ) n ∈ Prior .
By construction, the scenarios U are independent under the prior, i.e. p ( u ) =
(cid:81)
Nn =1 p ( u n ) .
Therefore u CF and u Prior are independent.
We can write:
[Equation]
Following the arguments from Lemma 1, the averaged inference distribution is equal to the prior p ( u ) =
E ˆ x o ∼ p
[ p ( u | ˆ x o )] .
This also holds for any subset of the variables u , in particular for for p ( u CF ) .
Hence:
[Equation] B D ETAILS ON CASTING A POMDP INTO SCM FORM Lemma 2 (Auto-regressive uniformization aka Reparametrization) . Consider random variables
X 1 , . . .
, X N with joint distribution P .
There exist functions f n for n ∈ { 1 , . . .
, N } such that with independent random variables U n ∼ Uniform[0 , 1] the random variables X (cid:48) equal X in distribution, i.e. X (cid:48)
d = X , where X (cid:48) =
[Equation]
, X (cid:48) n ) are deﬁned as:
[Equation]
Proof.
We construct the functions f n by induction on n .
Consider the conditional distribution P X n | X <n .
For ﬁxed X <n , denote its CDF with F n,X <n .
We construct a random variable
X (cid:48) :
= F − 1 n,X <n ( U n ) with U n ∼ Uniform[0 , 1] independent from X <n and U <n .
By virtue of the inverse-CDF method, we have X (cid:48) | X <n d = X | X <n .
Therefore, f n ( U n , X <n ) := F − 1 n,X <n ( U n ) satisﬁes the above lemma.
C M ODEL ARCHITECTURE
We assume that we are given the true transition and reward kernels.
As the transitions are deterministic in PO-SOKOBAN, the only part of the model that remains to be identiﬁed is the initial state distribution p ( U s 1 ) .
We learned this model from data using a the DRAW model (Gregor et al., 2015), which is a parametric, multi-layer, latent variable, neural network model for distributions.
For our purposes we chose the convolutional DRAW architecture proposed by (Gregor et al., 2016).
First, the observation data is summarized by a convolutional LSTM with 32 hidden units and kernel size of 3.
The resulting ﬁnal LSTM state is fed into a conditional Gaussian prior over the latent variables Z k =1 ,..., 8 of the 8-layer conv-DRAW model.
Each layer has 32 hidden layers and the canvas had 7 layers, corresponding to the 7 channels of the categorical U s 1 ∈ { 0 , 1 } 10 × 10 × 7 that we wish to model.
The model (together with the backward RNN) was trained with the ADAM optimizer (Kingma & Ba, 2014) on the ELBO loss using the reparametrization trick (Kingma & Welling, 2013;
Rezende et al., 2014).
The mini-batch size was set to 4 and the learning rate to 3 e − 4 .
We want to emphasize that the DRAW latent variables Z are not directly the noise variables U of the SCM, but integrating out these variables yields this distribution p
( U s 1 | ˆ h T ) =
(cid:82) p ( U s 1 | z, ˆ h T ) p ( z | ˆ h T )
d ˆ h T .
D M ODEL MISMATCH ANALYSIS
Here we provide some analysis of the DRAW model over the initial state
U s 1 , which is the learned part of the SCM M used for the policy evaluation experiments presented in 3.2.
As detailed above, we trained a separate model p
( U s 1 | ˆ h t ) for each t = 1 , . .
, 50 parameterizing the cardinality of the data the model is conditioned on.
We analyze three particular models for t = 0 , 1 andwhich we term the unconditional / ﬁltering / smoothing model, as they are conditioned on no data / on data that is available at test time / all data that is available in hindsight.
Directly visualizing the distributions p ( U s 1 | ˆ h t ) for an analysis is difﬁcult as the domain { 0 , . .
, 6 } 10 × 10 is high-dimensional and discrete.
Instead we focus on the latent variables Z which are learned by DRAW to represent this distribution; by construction, these are jointly Normal, facilitating the analysis.
In particular, we compare p ( Z | ˆ h t ) with the inference distribution q
( Z | ˆ u s 1 ) conditioned on the true state
ˆ U s 1 .
We loosely interpret q ( Z | ˆ u s 1 ) as the ”true” embedding of the datum ˆ u s 1 , whereas p ( Z | ˆ h t ) is the learned [Figure] embedding.
In a perfect model the prior matches the inference distribution on average:
[Equation]
i.e. every sample from the prior p ( Z | ˆ h t ) corresponds to real data and vice versa.
We visualize the averaged prior E ˆ h t ∼ p µ [ p ( Z | ˆ h t )] and the averaged posterior E ˆ u s 1 ∼ p µ [ q ( Z | ˆ u s 1 )] in ﬁg. 4.
We show the two dimensions of Z where these distributions have the largest KL divergence.
Also, the plots were whitened w.r.t.
the averaged prior, i.e. the latter is a spherical Gaussian in the plots, represented by an iso-probability contour corresponding to one standard deviation.
The inference distribution for each datum ˆ u s 1 is visualized by its mean (cross) and a level set corresponding the one standard deviation or less.
For the unconditional model t = 0 , we ﬁnd that the distributions are not matched well.
In particular, there is a lot of prior mass that sits in regions where there is no or little true data.
In the RL setting this results in synthetic data from the model that is unrealistic and training a policy on this data leads to reduced test performance.
Also, as apparent from the ﬁgure, there is structure in the embedding of the true data, that is not captured at all by the prior.
This effect is markedly reduced in the ﬁltering posterior, indicating that the conditional distribution p ( Z | ˆ h 1 ) already captures the data distribution better.
The smoothing model is a very good match to the data.
With high probability, all tiles of the game are observed in ˆ h 50 , enabling the model to perfectly learn the belief state, which collapses in this setting to a single state.