C ROSS -D OMAIN I MITATION L EARNING VIA O PTIMAL T RANSPORT
Anonymous authors
Paper under double-blind review
A BSTRACT
Cross-domain imitation learning studies how to leverage expert demonstrations of one agent to train an imitation agent with a different embodiment or morphology.
Comparing trajectories and stationary distributions between the expert and imitation agents is challenging because they live on different systems that may not even have the same dimensionality.
We propose Gromov-Wasserstein Imitation
Learning (GWIL) , a method for cross-domain imitation that uses the GromovWasserstein distance to align and compare states between the different spaces of the agents.
Our theory formally characterizes the scenarios where GWIL preserves optimality, revealing its possibilities and limitations.
We demonstrate the effectiveness of GWIL in non-trivial continuous control domains ranging from simple rigid transformation of the expert domain to arbitrary transformation of the state-action space
I NTRODUCTION
Reinforcement learning (RL) methods have attained impressive results across a number of domains, e.g., Berner et al.
; Kober et al.
; Levine et al.
; Vinyals et al.
However, the effectiveness of current RL method is heavily correlated to the quality of the training reward.
Yet for many real-world tasks, designing dense and informative rewards require signiﬁcant engineering effort.
To alleviate this effort, imitation learning (IL) proposes to learn directly from expert demonstrations.
Most current IL approaches can be applied solely to the simplest setting where the expert and the agent share the same embodiment and transition dynamics that live in the same state and action spaces.
In particular, these approaches require expert demonstrations from the agent domain.
Therefore, we might reconsider the utility of IL as it seems to only move the problem, from designing informative rewards to providing expert demonstrations, rather than solving it.
However, if we relax the constraining setting of current IL methods, then natural imitation scenarios that genuinely alleviate engineering effort appear.
Indeed, not requiring the same dynamics would enable agents to imitate humans and robots with different morphologies, hence widely enlarging the applicability of
IL and alleviating the need for in-domain expert demonstrations.
This relaxed setting where the expert demonstrations comes from another domain has emerged as a budding area with more realistic assumptions (Gupta et al., 2017; Liu et al., 2019; Sermanet et al., 2018;
Kim et al., 2020; Raychaudhuri et al., 2021) that we will refer to as Cross-Domain Imitation
Learning.
A common strategy of these works is to learn a mapping between the expert and agent domains.
To do so, they require access to proxy tasks where both the expert and the agent act optimally in there respective domains.
Under some structural assumptions, the learned map enables to transform a trajectory in the expert domain into the agent domain while preserving the optimality.
Although these methods indeed relax the typical setting of IL, requiring proxy tasks heavily restrict the applicability of Cross-Domain IL.
For example, it rules out imitating an expert never seen before as well as transferring to a new robot.
In this paper, we relax the assumptions of Cross-Domain IL and propose a benchmark and method that do not need access to proxy tasks.
To do so, we depart from the point of view taken by previous work and formalize Cross-Domain IL as an optimal transport problem.
We propose a method, that we call Gromov Wasserstein Imitation Learning (GWIL) , that uses the Gromov-Wasserstein distance to solve the benchmark.
We formally characterize the scenario where GWIL preserves optimality (theorem 1), revealing the possibilities and limitations.
The construction of our proxy rewards to optimize optimal transport quantities using RL generalizes previous work that assumes uniform occupancy measures (Dadashi et al., 2020; Papagiannis & Li, 2020) and is of independent interest.
Our experiments show that GWIL learns optimal behaviors with a single demonstration from another domain without any proxy tasks in non-trivial continuous control settings.
R ELATED W ORK
Imitation learning.
An early approach to IL is Behavioral Cloning (Pomerleau, 1988; 1991) which amounts to training a classiﬁer or regressor via supervised learning to replicate the expert’s demonstration.
Another key approach is Inverse Reinforcement Learning (Ng & Russell, 2000; Abbeel &
Ng, 2004; Abbeel et al., 2010), which aims at learning a reward function under which the observed demonstration is optimal and can then be used to train a agent via RL.
To bypass the need to learn the expert’s reward function, Ho & Ermon (2016) show that IRL is a dual of an occupancy measure matching problem and propose an adversarial objective whose optimization approximately recover the expert’s state-action occupancy measure, and a practical algorithm that uses a generative adversarial network (Goodfellow et al., 2014).
While a number of recent work aims at improving this algorithm relative to the training instability caused by the minimax optimization, Primal Wasserstein
Imitation Learning (PWIL) (Dadashi et al., 2020) and Sinkhorn Imitation Learning (SIL) (Papagiannis & Li, 2020) view IL as an optimal transport problem between occupancy measures to completely eliminate the minimax objective and outperforms adversarial methods in terms of sample efﬁciency.
Heess et al.
; Peng et al.
Zhu et al.
; Aytar et al.
(2018) scale imitation learning to complex human-like locomotion and game behavior in non-trivial settings.
Our work is an extension of Dadashi et al.
; Papagiannis & Li (2020) from the Wasserstein to the GromovWasserstein setting.
This takes us beyond limitation that the expert and imitator are in the same domain and into the cross-domain setting between agents that live in different spaces.
Transfer learning across domains and morphologies.
Work transferring knowledge between different domains in RL typically learns a mapping between the state and action spaces.
Ammar et al.
(2015) use unsupervised manifold alignment to ﬁnd a linear map between states that have similar local geometry but assume access to hand-crafted features.
More recent work in transfer learning across viewpoint and embodiment mismatch learn a state mapping without handcrafted features but assume access to paired and time-aligned demonstration from both domains (Gupta et al., 2017; Liu et al., 2018; Sermanet et al., 2018).
Furthermore, Kim et al.
Raychaudhuri et al.
(2021) propose methods to learn a state mapping from unpaired and unaligned tasks.
All these methods require proxy tasks, i.e . a set of pairs of expert demonstrations from both domains, which limit the applicability of these methods to real-world settings.
Stadie et al.
(2017) have proposed to combine adversarial learning and domain confusion to learn a policy in the agent’s domain without proxy tasks but their method only works in the case of small viewpoint mismatch.
Zakka et al.
(2021) take a goal-driven perspective that seeks to imitate task progress rather than match ﬁne-grained structural details to transfer between physical robots.
In contrast, our method does not rely on learning an explicit cross-domain latent space between the agents, nor does it rely on proxy tasks.
The GromovWasserstein distance enables us to directly compare the different spaces without a shared space.
The existing benchmark tasks we are aware of assume access to a set of demonstrations from both agents whereas the experiments in our paper only assume access to expert demonstrations.
P RELIMINARIES
Metric Markov Decision Process.
An inﬁnite-horizon discounted Markov decision Process (MDP) is a tuple ( S, A, R, P, p 0 , γ ) where S and A are state and action spaces, P : S
×
A → ∆( S ) is the transition function, R : S ×
A → R is the reward function, p 0 ∈ ∆( S ) is the initial state distribution and γ is the discount factor.
We equip MDPs with a distance d : S ×
A → R + and call the tuple ( S, A, R, P, p 0 , γ, d ) a metric MDP .
Gromov-Wasserstein distance.
Let ( X , d X , µ X ) and ( Y , d Y , µ Y ) be two metric measure spaces, where d X and d Y are distances, and µ X and µ Y are measures on their respective spaces 2 .
The
Gromov-Wasserstein distance (Mémoli, 2011) extends the Wasserstein distance from optimal transportation (Villani, 2009) to these spaces and is deﬁned as
[Equation]
[Equation]
where U ( µ X , µ Y ) is the set of couplings between the atoms of the measures deﬁned by
[Equation]
GW compares the structure of two metric measure spaces by comparing the pairwise distances within each space to ﬁnd the best isometry between the spaces.
Figure 1 illustrates this distance in the case of the metric measure spaces ( S E × A E , d E , ρ π E ) and ( S A × A A , d A , ρ π A ) .
C ROSS -D OMAIN I MITATION L EARNING VIA O PTIMAL T RANSPORT 4. C OMPARING POLICIES FROM ARBITRARILY DIFFERENT MDP S
For a stationary policy π acting on a metric MDP ( S, A, R, P, γ, d ) , the occupancy measure is:
[Equation]
We compare policies from arbitrarily different MDPs in terms of their occupancy measures.
Deﬁnition 1 (Gromov-Wasserstein distance between policies) .
Given an expert policy π E and an agent policy π A acting, respectively, on
[Equation]
P
[Equation]
T
[Equation]
We deﬁne the Gromov-Wasserstein distance between π E and π A as the Gromov-Wasserstein distance between the metric measure spaces ( S E × A E , d E , ρ π E ) and ( S
A × A A , d A , ρ π A ) :
[Equation]
We now deﬁne an isometry between policies by comparing the distances between the state-action spaces and show that GW deﬁnes a distance up to an isometry between the policies.
Figureillustrates examples of simple isometric policies.
Deﬁnition 2 (Isometric policies) .
Two policies π E and π A are isometric if there exists a bijection φ : supp[ ρ π E ] → supp[ ρ π A ] that satisﬁes for all ( s E , a E ) , ( s E (cid:48) , a E (cid:48) )
∈ supp[ ρ π E
[Equation]
[Equation]
In other words, φ is an isometry between (supp[ ρ π E ] , d E ) and (supp[ ρ π A ] , d A ) .
Proposition 1.
GW deﬁnes a metric on the collection of all isometry classes of policies.
Proof.
By deﬁnition 1, GW ( π E , π A ) =
if and only if GW (( S E , d E , ρ π E ) , ( S A , d A , ρ π A )) = 0 .
By Mémoli (2011, Theorem 5.1), this is true if and only if there is an isometry that maps supp[ ρ φ E ] to supp[ ρ φ A ] .
By deﬁnition 2, this is true if and only if π A and π E are isometric.
The symmetry and triangle inequality follow from Mémoli (2011, Theorem 5.1).
The next theorem 3 gives a sufﬁcient condition to recover, by minimizing GW , an optimal policy 4 in the agent’s domain up to an isometry.
Theorem 1.
Consider two MDPs
[Equation]
Suppose that there exists four distances d SE , d AE , d SA , d AA deﬁned on S E , A E , S A and A E respectively, and two isometries φ : ( S E , d SE )
→ ( S A , d SA ) and ψ : ( A E , d SE ) → ( A S , d SA ) such that for all ( s E , a E , s (cid:48) E ) ∈ S
E ×
A E × S E the three following conditions hold:
[Equation]
Consider an optimal policy π ∗ E in M E .
Suppose that π GW minimizes GW ( π ∗ E , π GW ) with d
[Equation]
d A
[Equation]
( s A
[Equation]
a A ) (cid:55)→ d SA ( s A ) + d AA ( a A )
[Equation]
Then π GW is isometric to an optimal policy in M A .
Proof.
Consider the occupancy measure ρ ∗ A : S
A × A A → R given by
[Equation]
We ﬁrst show that ρ ∗ A is feasible in M A , i.e .
there exists a policy π ∗ A acting in M A with occupancy measure ρ ∗ A (a).
Then we show that π ∗ A is optimal in M A (b) and is isometric to π ∗ E (c).
Finally we show that π GW is isometric to π ∗ A , which concludes the proof (d).
(a) Consider s A ∈ S A .
By deﬁnition of ρ ∗ A ,
[Equation]
Since ρ π ∗ E is feasible in M , it follows from Puterman (2014, Theorem 6.9.1) that (cid:88)
a E ∈
A E
[Equation]
By conditions 4 and 5 and by deﬁnition of ρ ∗ A ,
[Equation]
It follows that
[Equation]
Therefore, by Puterman (2014, Theorem 6.9.1), ρ ∗ A is feasible in M A , i.e .
there exists a policy π ∗ A acting in M A with occupancy measure ρ ∗ A .
(b) By condition 5 and deﬁnition of ρ ∗ A , the expected return of π ∗ A in M A is then
[Equation]
Consider any policy π A in M (cid:48) .
By condition 5, the expected return of π A is (cid:88)
[Equation]
Using the same arguments that we used to show that ρ ∗ A is feasible in M (cid:48) , we can show that
[Equation]
is feasible in M .
It follows by optimality of π ∗ E in M that
[Equation]
It follows that π ∗ A is optimal in M (cid:48) .
(c) Notice that ξ : ( s E , a E ) (cid:55)→ ( φ ( s E ) , ψ ( a E )) is an isometry between ( S E × A E , d E ) and ( S A × A A , d A ) , where d E and d A and given, resp., by ( s E , a E ) (cid:55)→ d SE ( s E ) + d AE ( a E ) and ( s A , a A ) (cid:55)→ d SA ( s A ) + d AA ( a A ) .
Therefore by deﬁnition of ρ ∗ A , π ∗ A is isometric to π ∗ E .
(d) Recall from the statement of the theorem that π GW is a minimizer of GW ( π ∗ E , π GW ) .
Since π ∗ A is isometric to π ∗ E , it follows from prop.
1 that GW ( π ∗ E , π ∗ A ) = 0 .
Therefore GW ( π ∗ E , π GW ) must be 0.
By prop. 1, it follows that there exists an isometry χ : (supp[ ρ ∗ E ] , d E ) → (supp[ ρ π GW ] , d A ) .
Notice that χ ◦ ξ − 1 | supp[ ρ ∗ A ] is an isometry from (supp[ ρ ∗ A ] , d A ) to (supp[ ρ π GW ] , d A ) .
It follows that π GW is isometric to π ∗ A , an optimal policy in M A , which concludes the proof.
Remark 1.
Theorem 1 shows the possibilities and limitations of our method.
It shows that our method can recover optimal policies even though arbitrary isometries are applied to the state and action spaces of the expert’s domain.
Importantly, we don’t need to know the isometries, hence our method is applicable to a wide range of settings.
We will show empirically that our method produces strong results in other settings where the environment are not isometric and don’t even have the same dimension.
However, a limitation of our method is that it recovers optimal policy only up to isometries.
We will see that in practice, running our method on different seeds enables to ﬁnd an optimal policy in the agent’s domain.
Inputs: expert demonstration τ , metrics on the expert ( d E ) and agent ( d A ) space
Initialize the imitation agent’s policy π θ and value estimates V θ while Unconverged do
Collect an episode τ (cid:48)
Compute GW ( τ, τ (cid:48) )
Set pseudo-rewards r with eq.
Update π θ and V θ to optimize the pseudo-rewards end while
4. G ROMOV -W ASSERSTEIN I MITATION L EARNING
Minimizing GW between an expert and agent requires derivatives through the transition dynamics, which we typically don’t have access to.
We introduce a reward proxy suitable for training an agent’s policy that minimizes GW via RL.
Figure 1 illustrates the method.
For readability, we combine expert state and action variables ( s E , a E ) into single variables z E , and similarly for agent state-action pairs.
Also, we deﬁne Z E =
S E
×
A E and Z A
= S A × A A .
Deﬁnition 3.
Given an expert policy π E and an agent policy π A , the Gromov-Wasserstein reward of the agent is deﬁned as r GW : supp[ ρ π A ] → R given by
[Equation]
where u (cid:63) is the coupling minimizing objective 1.
Proposition 2.
The agent’s policy π A trained with r GW minimizes GW ( π E , π A ) .
Proof.
Suppose that π A maximizes E ( (cid:80) ∞
[Equation] [Equation]
a At )) and denote by ρ π A its occupancy measure.
By Puterman (2014, Theorem 6.9.4), π A maximizes the following objective:
[Equation]
In practice we approximate the occupancy measures of π by ˆ ρ π ( s, a ) = 1 T (cid:80)
Tt =1 1 ( s = s t ∧ a = a t ) where τ = ( s 1 , a 1 , .., s T , a T ) is a ﬁnite trajectory collected with π .
Assuming that all state-action pairs in the trajectory are different 5 , ˆ ρ is a uniform distribution.
Given an expert trajectory τ E and an agent trajectory τ
A 6 , the (squared) Gromov-Wasserstein distance between the empirical occupancy measures is
[Equation] [Equation]
where Θ is the set of is the set of couplings between the atoms of the uniform measures deﬁned by
[Equation]
In this case the reward is given for every state-action pairs in the trajectory by:
[Equation]
where θ (cid:63) is the coupling minimizing objective 6.
In practice we drop the factor T A because it is the same for every state-action pairs in the trajectory.
Remark 2.
The construction of our reward proxy is deﬁned for any occupancy measure and extends to previous work optimizing optimal transport quantities via RL that assumes uniform occupancy measure in the form of a trajectory to bypass the need for derivatives through the transition dynamics (Dadashi et al., 2020; Papagiannis & Li, 2020). Computing the pseudo-rewards.
We compute the Gromov-Wasserstein distance using Peyré et al.
(2016, Proposition 1) and its gradient using Peyré et al.
(2016, Proposition 2).
To compute the coupling minimizing 6, we use the conditional gradient method as discussed in Ferradans et al.
Optimizing the pseudo-rewards.
The pseudo-rewards we obtain from GW for the imitation agent enable us to turn the imitation learning problem into a reinforcement learning problem (Sutton &
Barto, 2018) to ﬁnd the optimal policy for the Markov decision process induced by the pseudorewards.
We consider agents with continuous state-action spaces and thus do policy optimization with the soft actor-critic algorithm (Haarnoja et al., 2018).
Algorithm 1 sums up GWIL in the case where a single expert trajectory is given to approximate the expert occupancy measure.
E XPERIMENTS
We propose a benchmark set for cross-domain IL methods consisting of 3 tasks and aiming at answering the following questions:
Does GWIL recover optimal behaviors when the agent domain is a rigid transformation of the expert domain?
Yes, we demonstrate this with the maze in sect.
Can GWIL recover optimal behaviors when the agent has different state and action spaces than the expert?
Yes, we show in sect.
5.2 for slightly different state-action spaces between the cartpole and pendulum, and in sect.
5.3 for signiﬁcantly different spaces between a walker and cheetah.
To answer these three questions, we use simulated continuous control tasks implemented in Mujoco (Todorov et al., 2012) and the DeepMind control suite (Tassa et al., 2018).
In all settings we use the
Euclidean metric within the expert and agent spaces for d E and d A .
5. A GENT DOMAIN IS A RIGID TRANSFORMATION OF THE EXPERT DOMAIN
We evaluate the capacity of IL methods to transfer to rigid transformation of the expert domain by using the PointMass Maze environment from Hejna et al.
The agent’s domain is obtained by applying a reﬂection to the expert’s maze.
This task satisﬁes the condition of theorem 1 with φ being the reﬂection through the central horizontal plan and ψ being the reﬂection through the x -axis in the action space.
Therefore by theorem 1, the agent’s optimal policy should be isometric to the policy trained using GWIL.
By looking at the geometry of the maze, it is clear that every policy in the isometry class of an optimal policy is optimal.
Therefore we expect GWIL to recover an optimal policy in the agent’s domain.
Figure 3 shows that GWIL indeed recovers an optimal policy. [Figure]
5. A GENT AND THE EXPERT HAVE SLIGHTLY DIFFERENT STATE AND ACTION SPACES
We evaluate here the capacity of IL methods to transfer to transformation that does not have to be rigid but description map should still be apparent by looking at the domains.
A good example of such transformation is the one between the pendulum and cartpole.
The pendulum is our expert’s domain while cartpole constitutes our agent’s domain.
The expert is trained on the swingup task.
Even though the transformation is not rigid, GWIL is able to recover the optimal behavior in the agent’s domain as shown in ﬁg. 4.
Notice that pendulum and cartpole do not have the same state-action space dimension: The pendulum has 3 dimensions while the cartpole has 5 dimensions.
Therefore
GWIL can indeed be applied to transfer between problems with different dimension.
5. A GENT AND THE EXPERT HAVE SIGNIFICANTLY DIFFERENT STATE AND ACTION SPACES
We evaluate here the capacity of IL methods to transfer to non-trivial transformation between domains.
A good example of such transformation is two arbitrarily different morphologies from the
DeepMind Control Suite such as the cheetah and walker.
The cheetah constitutes our expert’s domain while the walker constitutes our agent’s domain.
The expert is trained on the run task.
Although the mapping between these two domains is not trivial, minimizing the GromovWasserstein solely enables the walker to interestingly learn to move backward and forward by imitating a cheetah.
Since the isometry class of the optimal policy – moving forward– of the cheetah and walker contains a suboptimal element –moving backward–, we expect GWIL to recover one of these two trajectories.
Indeed, depending on the seed used, GWIL produces a cheetah-imitating walker moving forward or a cheetah-imitating walker moving backward, as shown in ﬁg. 5.
C ONCLUSION
Our work demonstrates that optimal transport distances are a useful foundational tool for crossdomain imitation across incomparable spaces.
Future directions include exploring:
Scaling to more complex environments and agents towards the goal of transferring the structure of many high-dimensional demonstrations of complex tasks into
an
agent.
The use of GW to help agents explore in extremely sparse-reward environments when we have expert demonstrations available from other agents.
How GW compares to other optimal transport distances that work apply between two metric MDPs, such as Alvarez-Melis et al.
(2019), that have more ﬂexibility over how the spaces are connected and what invariances the coupling has.
Metrics aware of the MDP’s temporal structure such as Zhou & Torre (2009); Cohen et al.
(2021) that build on dynamic time warping (Müller, 2007).
The Gromov-Wasserstein ignores the temporal information and ordering present within the trajectories.
A O PTIMIZATION OF THE PROXY REWARD
In this section we show that the proxy reward introduced in equation 7 constitutes a learning signal that is easy to optimize using standards RL algorithms.
Figure 6 shows proxy reward curves across 5 different seeds for the 3 environments.
We observe that in each environment the SAC learner converges quickly and consistently to the asymptotic episodic return.
Thus there is reason to think that the proxy reward introduced in equation 7 will be similarly easy to optimize in other crossdomain imitation settings.
B T RANSFER TO SPARSE - REWARD ENVIRONMENTS
In this section we show that GWIL can be used to facilitate learning in sparse-reward environments when the learner has only access to one expert demonstration from another domain.
We compare
GWIL to a baseline learner having access to a single demonstration from the same domain and minimizing the Wasserstein distance, as done in Dadashi et al.
In these experiments, both agents are given a sparse reward signal in addition to their respective optimal transport proxy reward.
We perform experiments in two sparse-reward environment.
In the ﬁrst environment, the agent controls a point mass in a maze and obtain a non-zero reward only if it reaches the end of the maze.
In the second environment, which is a sparse version of cartpole, the agent controls a cartpole and obtains a non-zero reward only if he can maintain the cartpole up for 10 consecutive time steps.
Note that a SAC agent fails to learn any meaningful behavior in both environments.
Figure 7 shows that
GWIL is competitive with the baseline learner in the sparse maze environment even though GWIL has only access to a demonstration from another domain, while the baseline learner has access to a demonstration from the same domain.
Thus there is reason to think that GWIL efﬁciently and reliably extracts useful information from the expert domain and hence should work well in other cross-domain imitation settings.
C S CALABILITY OF GWIL
In this section we show that our implementation of GWIL offers good performance in terms of wallclock time.
Note that the bottleneck of our method is in the computation of the optimal coupling which only depends on the number of time steps in the trajectories, and not on the dimension of the expert and the agent.
Hence our method naturally scales with the dimension of the problems.
Furthermore, while we have not used any entropy regularizer in our experiments, entropy regularized methods have been introduced to enable Gromov-Wasserstein to scale to demanding machine learning tasks and can be easily incorporated into our code to further improve the scalability.
Figurecompares the time taken by GWIL in the maze with the time taken by the baseline learner introduced in the previous section.
It shows that imitating with Gromov-Wasserstein requires the same order of time than imitating with Wasserstein.
Figure 9 compares the wall-clock time taken by a walker imitating a cheetah using GWIL to reach a walking speed (i.e., a horizontal velocity of 1) and the wall-clock time taken by a SAC walker trained to run.
It shows that a GWIL walker imitating a cheetah reaches a walking speed faster than a SAC agent trained to run.
Even though the SAC agent is optimizing for standing in addition to running, it was not obvious that GWIL could compete with
SAC in terms of wall-clock time.
These results gives hope that GWIL has the potential to scale to more complex problems (possibly with an additional entropy regularizer) and be a useful way to learn by analogy.