Skills Regularized Task Decomposition for Multi-task Offline Reinforcement Learning
Abstract
Reinforcement learning (RL) with diverse offline datasets can have the advantage of leveraging the relation of multiple tasks and the common skills learned across those tasks, hence allowing us to deal with real-world complex problems efficiently in a data-driven way.
In offline RL where only offline data is used and online interaction with the environment is restricted, it is yet difficult to achieve the optimal policy for multiple tasks, especially when the data quality varies for the tasks.
In this paper, we present a skill-based multi-task RL technique on heterogeneous datasets that are generated by behavior policies of different quality.
To learn the shareable knowledge across those datasets effectively, we employ a task decomposition method for which common skills are jointly learned and used as guidance to reformulate a task in shared and achievable subtasks.
In this joint learning, we use
Wasserstein auto-encoder (WAE) to represent both skills and tasks on the same latent space and use the quality-weighted loss as a regularization term to induce tasks to be decomposed into subtasks that are more consistent with high-quality skills than others.
To improve the performance of offline RL agents learned on the latent space, we also augment datasets with imaginary trajectories relevant to high-quality skills for each task.
Through experiments, we show that our multitask offline RL approach is robust to the mixed configurations of different-quality datasets and it outperforms other state-of-the-art algorithms for several robotic manipulation tasks and drone navigation tasks.
Introduction
In the reinforcement learning (RL) field, the offline RL research has recently gained much attention, as numerous works showed that it is effective for various problems of sequential decision making to adopt a data-driven learning mechanism using previously collected data of experiences and trajectories [1, 2, 3].
In the meanwhile, multi-task RL is considered promising to enhance the generality of RL policies and improve the learning efficiency [4, 5, 6, 7, 8, 9, 10].
Recently, a data sharing method for multi-task learning was introduced to address the issue of limited data for real-world control applications [11].
Yet, multi-task RL has not been fully investigated in offline settings.
In the offline RL context, we present a novel multi-task model by which a single policy for multiple tasks can be data-efficiently achieved and its learning procedure is robust to heterogeneous datasets of different quality.
In offline RL where interaction with the environment is not allowed and arbitrary or low-performance behavior
policies
might be involved in data collection, it is important to maintain the robustness in learning on different-quality data.
To this end, we devise a joint learning mechanism of skill (short-term action sequences from the datasets) and task representation, which enables the task decomposition into achievable subtasks via quality-aware skill regularization.
We also employ data augmentation based on high-quality skills, thus creating plausible trajectories and alleviating the limited quality and scale issues of offline datasets.
Through experiments, we demonstrate that our model achieves robust performance for multi-task robotic manipulation and drone navigation, without requiring additional interaction with the environment.
The main contributions of this paper are summarized as follows
• We present a novel multi-task offline RL model that enables the task decomposition into achievable subtasks through the quality-aware joint learning on skills and tasks.
The model ensures the robustness of learned policies upon the mixed configurations of different-quality datasets.
• We devise the data augmentation scheme specific to multi-task RL on limited offline datasets, aiming at creating imaginary trajectories that are likely to be generated by expert policies.
• We evaluate our model under multi-task robot and drone scenarios and demonstrate its benefit particularly upon heterogeneous data conditions.
Overall Approach
In this section, we describe the problem of making optimal decisions upon a multi-task Markov decision process (MDP) and briefly present our data-driven approach to the problem.
2.1 Preliminary
Reinforcement learning (RL) offers an active learning framework based on MDPs for tackling sequential decision problems.
In conventional RL formulation, a learning environment is represented as an MDP M with ( S , A , P , R, γ ) where S is a state space, A is an action space, P ( s t +1 | s t , a t ) is a transition probability for states s t , s t +1 ∈ S and an action a t ∈ A , R ( s t , a t ) is a reward function, and γ ∈ [0 , 1] is a discount factor.
The objective of an RL agent is to find an optimal policy π ∗ ( a | s ) by which the cumulative discounted reward J ( π ) =
E π [ (cid:80) ∞ t =
γ t r t ] [12] is maximized.
In general, the policy π is learned via continual interaction with a learning environment defined in an MDP.
Offline RL Offline RL aims at maximizing the cumulative discounted reward J ( π ) as explained above within the same MDP formulation; however, unlike conventional RL, it is assumed to use only static datasets of previously collected trajectories D
= { ( s t , a t , r t , s t +1 ) } t for training.
Likewise, it rarely considers direct interaction with the environment.
Offline RL algorithms can increase the usability of previously collected data in the domain of making sequential decisions where temporal credit assignment with long time horizons is important.
Multi-task RL Multi-task RL considers more than a single task when achieving the optimal policy π ∗ .
It is normally formulated as a family of MDPs {T i =
( S , A , P i , R i , γ ) } i where each individual task T i is associated with its respective MDP and it is sampled according to a task distribution p ( T ) .
Hidden Parameter MDP To represent the implicit temporal dynamics properties in a multi-task environment, which are relevant to the Markovian properties of each task, we introduce a hidden latent variable v t [13].
That is, we have R ( s t , v t , a t ) :
= R v t ( s t , a t ) and P ( s t +1 , v t +1 | a t , s t , v k ) :=
P v t ( s t +1 | a t , s t ) for s t , s t +1 ∈ S and a t ∈ A , where the actual state space is extended to S × V and V is the collection of latent variables v t .
Then, we obtain the respective partially observable
MDP (POMDP) that is formulated as a tuple ( S × V , A , Ω , P V , R V , O , γ ) where Ω = S and
O ( s t , v t ) (cid:55)→ s t denote the observation space and the observation function, respectively.
2.2 Overall Approach For Multi-task Offline RL
In principle, offline RL algorithms train a policy π by optimizing the objective argmax π J D ( π ) − α · c ( π, π D ) which tends to mitigate the extrapolation problem [1].
J D is the average return of the learned policy π in the empirical MDP ˜ M derived from static datasets D , which are generated by a behavior policy π D .
Some cost function c ( · ) is used to regulate the distance of the policies π and π D and α is a hyperparameter.
With this regularization by the behavior policy, offline RL algorithms are often vulnerable to low-quality datasets.
Overfitting problems can occur such that the maximum average return max π J D ( π ) of ˜ M is much lower than that of its respective true MDP M , when a low-performance or arbitrary policy is used for data generation.
ii
[Figure]
regularized
[Figure]
Imaginary demonstrations
[Figure]
augmentation
[Figure]
imaginary demonstrations
[Figure]
augmentation.
In (a), sub-trajectories from static datasets are converted into skill embeddings and task on space, which together enable the decomposition of tasks into achievable
In (b), for training offline RL agents, imaginary trajectories similar to expert demonstrations are sampled from the latent space and added to the datasets.
In multi-task offline RL, we reformulate a family of MDPs {T i } i as a hidden parameter MDP in that multiple MDPs are combined into a single POMDP based on hidden parameters that specify temporal Markovian properties of the environment.
While the overfitting issue of offline RL can be alleviated by exploring the relation of multiple tasks and inducing the shareable knowledge from their datasets in a multi-task setting, it is not guaranteed that inferring the hidden parameters fully enables the well-structured representation of related tasks.
It is because the behavior policy heterogeneity and state-action pair disparity of tasks can prevent the sub-trajectories of common-knowledge tasks from being closely mapped on the latent space [14, 15].
To address the issue of different-quality and heterogeneous datasets in the context of multi-task offline
RL, we take a novel task embedding approach that combines (a) skill-regularized task decomposition and (b) data augmentation by imaginary demonstrations, as illustrated in Figure 1.
(a) The former enables the decomposition and reformulation of an individual task in the latent space of achievable subtasks by jointly learning the common skills and adapting the subtasks in more achievable representation via quality-aware skill regularization (in Section 3).
This task decomposition establishes subtask embeddings on the same latent space in which agents can be efficiently trained.
(b) The latter improves the performance of offline RL agents trained on the latent space by augmenting datasets with imaginary demonstrations (in Section 4).
For each task, its well-matched skills are consequently used to generate additional trajectories similar to expert data without online interaction.
This can improve the adaptability of offline RL algorithms for such tasks that have only low-quality data or do not exist in the static datasets.
Then, using the subtask decomposition and augmented datasets with imaginary demonstrations, a multi-task policy is learned via offline RL algorithms.
Task Decomposition with Quality-aware Skill Regularization
In this section, we describe the task decomposition model with quality-aware skill regularization on multi-task offline datasets.
The model includes skill embedding and task embedding networks that are jointly learned with a regularization term based on the behavior quality, as shown in Figure 2.
Specifically, we define short-term action sequences as skills and embed them in a latent space.
By jointly learning skill embeddings and task embeddings, we induce tasks to be transformed into subtasks that are achievable by and aligned with skills.
In doing so, we incorporate the behavior quality of each sub-trajectory into the joint learning procedure as part of skill regularization, thus mitigating the adverse effect by low-quality data.
iii
[Figure]
3.1 Learning Skill Embeddings
To represent the agent’s behavior to a latent space Z , we use an auto-encoder mechanism.
An encoder q ϕ takes as input a sequence of state-action pairs d t =
( s, a ) t − n : t + n − 1 for time interval [ t − n, t + n
−
] , mapping it to a latent vector b t ∈ Z , while a decoder p ϕ reconstructs the input action sequence a t − n : t + n − 1 from the pair of b t and s t − n : t + n − 1 .
We term the latent vector b t skill embeddings , considering that action sequences on short-term horizons capture agent’s behaviors for a specific task.
For maintaining the learning stability on skill embeddings b t ∈ Z , we use Wasserstein auto-encoder (WAE) [16] with the maximum mean discrepancy (MMD)-based penalty and a prior distribution on b t .
Then, the loss function is defined as
[Equation]
where { ˜ b i } mi =1 ∼ P B is sampled by a prior of skill embeddings, λ > 0 is a prior distribution-based regulation hyperparameter, and { s t i , a t i , d t i } mi =1 ∼ D .
Here, L PR is used to restrict skill embeddings,
L PR
[Equation]
{ b } , { ˜
[Equation]
=
[Equation] [Equation]
where m is the size of { b } , { ˜ b } and k :
Z × Z → R is the positive-definite reproducing kernel.
3.2 Skill-regularized Task Decomposition
To decompose an individual task into a set of shared and achievable subtasks, we use skill embeddings as guidance for the analysis of relation between tasks.
We first view each task as a composition of subtasks which can be modeled as a hidden parameter MDP.
For task embeddings, we then use the WAE-based model architecture similar to skill embeddings previously described.
For subtrajectories τ t =
( s t − n : t , a t − n − 1: t − 1 , r t − n − 1: t − 1 ) of n -length transitions each, we have an encoder q θ : τ t (cid:55)−→ z t ∈ Z to yield task embeddings and a decoder p θ : ( s t , a t , z t ) (cid:55)−→ ( s t +1 , r t ) to express the transition probability P and reward function R .
Then, for { s t i , a t i , τ t i } mi =1 ∼ D , the loss function for task embeddings is defined as
[Equation]
We also add a skill regularization term.
Since in offline RL datasets, trajectories are not necessarily generated by experts or optimal policies for all tasks, we incorporate the quality of trajectories in iv
Offline dataset D , subtask embedding parameter θ , skill embedding parameter ϕ
Regulation hyperparameter λ , batch size m , learning rate η loop
Sample { d t i ,τ t i ,s t i − n : t i + n ,a t i − n : t i + n ,r t i − n : t i } mi =1 ∼ D { b t 1 ,b t 2 ,...,b t m } =
q ϕ ( { d t 1 ,d t 2 ,...,d t m } ) , { z t 1 ,z t 2 ,...,z t m } =
q θ ( { τ t 1 ,τ t 2 ,...,τ t m } ) { ˜ b 0 , ˜ b
1 ,..., ˜ b n } ∼ P B = N (0 , 1) , { ˜ z 0 , ˜ z 1 ,..., ˜ z n } ∼ P Z = N (0 , 1)
L SE ( ϕ ) = 1 m (cid:80) mi =1 (cid:80) n − 1 j = − n ∥ a t i + j − p ϕ
( s t i + j ,b t i )
∥ 2 + L PR ( { b t i } mi =1 , { ˜ b i } mi =1 ) using (1)
L TE ( θ ) = 1 m (cid:80) mi =1 (cid:80)
j = − n ∥ ( s t i + j +1 ,r t
i + j ) − p θ ( s t
i + j ,a t i + j ,z t i )
∥ 2 using (3)
L SR ( θ ) = 1 m (cid:80) mi =1 ˜ R ( s t
i ,a t i ) ·
∥ q θ ( τ t i ) − q ϕ ( d t i ) ∥ 2 using (4)
L SRTD ( θ ) =
L TE ( θ ) + L PR ( { z t i } mi =1 , { ˜ z i } mi =1 ))
+ L SR ( θ ) using (5) ϕ ← ϕ + η · ∇ L SE , θ ← θ + η · ∇ L SRTD end loop return θ,ϕ the regularization term.
Once sub-trajectories are transformed in skill embeddings, their quality is estimated by the episodic returns ˜ R ( s, a ) .
The quality-aware skill regularization loss is defined as
[Equation]
The overall loss is defined as
[Equation]
where P Z is a prior of task embeddings.
This allows the encoder q θ to generate the embeddings at subtask-level (or subtask embeddings) upon a sequence of sub-trajectories which are agnostic to tasks in multi-task settings.
In particular, each task is represented within close proximity to some high-quality skills learned from the trajectories with large episodic returns.
By increasing the use of high-quality skills task-agnostically, this task decomposition reduces the adverse effect of low-quality data and induces the task decomposition into more achievable subtasks.
When training offline RL agents, we use the output of q θ as part of the state input to RL algorithms.
Algorithm 1 implements the learning procedure explained in (1)-(5).
Here we provide the analysis of skill regularization effects in (4).
Let q and p be a skill encoder and decoder obtained by minimizing the loss in (1), and consider p as part of the environment similarly in [17, 18].
Then, the decoder p follows the MDP M p =
( S , A
= Z , P p , R p , γ ) in which a high-level (skill) action z t ∈ Z is converted to such a low-level (primitive) action a t ∼ p ( ·| s t , z t ) that directly interacts with the environment.
Furthermore, assume that sub-trajectories τ in (3) and a sequence of state-action pairs d in (1) are restricted to the current state.
Then, we obtain such high-level policies q θ and q which are trained for the MDP M p .
As the output of q θ is contained in the input states of M p , our objective is to maximize the performance gap between q θ and q ; i.e., maximize η ( θ ) :
=
J p ( q θ ) − J p ( q ) where J p is the average return in M p .
Following [19], we obtain that η ( θ ) =
E s ∼ d qθ ,z ∼ q θ
[ R qs,z − V q ( s )] where d q θ is a state visit distribution induced by q θ , R qs,z is an episodic return induced by q , and V q is a value function of q .
However, in offline
RL, it is difficult to approximate q θ precisely, so we rather want to use the distribution of q for the state visitation distribution of q θ without much propagation error.
To do this, we optimize ˜ η
( θ ) =
E s ∼ q,z ∼ q θ
[ R qs,z − V q ( s )] under the restriction that q and q θ remain in close proximity [20], maximize θ ˜ η ( θ ) :
=
E s ∼ d q ,z ∼ q θ
[ R qs,z − V q ( s )] subject to KL ( q θ ( ·| s ) || q ( ·| s )) ≤ ϵ.
Under the KL-divergence constraint in (6), we obtain that the state distribution of d q corresponds to that of the dataset D , implying s ∼ d q ∼ = D .
Using the classical Lagrangian argument, we can simplify the optimization problem in (6) into a nonconstraint optimization problem,
[Equation]
(7) v
[Figure]
Imaginary demo
[Figure]
where β is a Lagrangian multiplier.
By differentiating the right-hand side of (7) with respect to q θ and following the optimal policy derivation procedure in [21, 22], we obtain the closed form solution that satisfies the return-weighted condition below.
[Equation]
When omitting the baseline term V q ( s ) and up to the constant, we also obtain that the weighted skill regularized loss in (4) renders subtask embeddings to be matched with high-quality skills for a given task, thereby facilitating the task decomposition into shareable and achievable subtasks.
Data Augmentation by Imaginary Demonstrations
In offline RL, since a given static dataset might not fully represent its respective true MDP and further exploration is not allowed, it is common for RL agents to experience sub-optimal performance.
Generative models and noise are used to generate additional trajectories and enable local exploration for offline RL algorithms without interaction.
In this section, we introduce a data augmentation method specific to the aforementioned task decomposition with quality-aware skill regularization, so that we can tackle the overfitting and limited performance issue.
While existing works aim at reducing the adverse effect of unseen states by exploiting state augmentation methods [23, 24, 25], we focus on augmenting such trajectories (imaginary demonstrations) that are likely to be generated by a high-quality skill-based learned policy.
Specifically, we integrate the task decoder p θ and skill decoder p ϕ into a generative model, as illustrated in Figure 3.
Note that both p θ and p ϕ are established through the skill-regularized task decomposition.
Then, we obtain
[Equation]
where q θ is the task embedding model and τ t ∼ D .
Note that in this generative model, p θ performs the same role of the world model in conventional model-based RL approaches.
The skill-regularized task decomposition enables q θ to be an optimal policy in the MDP M p ϕ as explained in (8).
Accordingly, it turns out that the augmentation procedure in (9) yields a plausible trajectory similar to expert demonstrations, given that the high-quality skill corresponding to the trajectory is incorporated into p ϕ .
In consequence, the procedure in (9) can alleviate the negative effect of low-quality datasets.
Figure 4 depicts the effect of our data augmentation by imaginary demonstrations, where (a) and (b) show the difference of low-quality and high-quality datasets in terms of the state-action pair distribution.
Our imaginary demonstrations in (c) generated from (a) the source dataset share similarity with (b) the expert dataset, while (d) the dataset generated by some conventional augmentation using Gaussian noise does not.
The table shows the average reward of datasets calculated by reward relabeling, indicating that our skill-based augmentation by imaginary demonstrations produces higher quality data compared to the Gaussian noise-based augmentation.
vi
[Figure]
Experiments
In this section, we evaluate the performance of our model under various configurations of multi-task offline datasets.
Experiment settings For evaluation, we use several robotic manipulation tasks and drone navigation tasks using the Meta-world environment [26] and the Airsim drone simulator [27].
The detailed settings including hyperparameters and environment conditions can be found in Appendix.
Comparison methods We implement several multi-task RL methods for comparison including:
• TD3+BC [2] is a state-of-the-art offline RL algorithm, which incorporates a behavior cloning regularization term into the update steps of TD3, inducing the learned policy towards the actions found
in the dataset.
For multi -task
learning,
TD3+
BC
is
extended
to include one-hot encoded task representation as part of the state
We use this baseline to compare our approach
with conventional multi-task RL algorithms without considering subtask decomposition.
• PCGrad
[7] is a gradient surgery-based multi-task RL algorithm, which uses a projection function to remove the directional conflicts between gradients.
This is implemented based on the hypothesis such that performance degradation can be exacerbated by gradient conflicts when training uncorrelated tasks.
• Soft modularization (SoftMod) [8] is a modular deep neural network architecture tailored for multi-task RL.
To mitigate the negative impact of learning different tasks on a single
policy, it leverages the softly weighted routing path on a set of modules that are specifically trained on multiple tasks.
It also employs a loss-balancing strategy to rapidly adapt to the different learning progress of the tasks.
Offline datasets We create and use three types of datasets according to specific behavior policies at different quality levels.
Medium-Replay (MR) denotes the datasets sampled by a learning process from the initial to partially-trained medium policies, Replay (RP) denotes the datasets sampled during a whole learning process, and Medium-Expert (ME) denotes the datasets sampled by a learning process from the medium to expert policies.
Note that each dataset in MR, RP, and ME for a task contains episodic trajectories of 150, 100, and 50, respectively, unless otherwise stated.
5.1 Meta-world Tests
Here, we evaluate our model using the MT10 benchmark (i.e., 10 different control tasks) in Metaworld [26], where each task is given a specific manipulation objective such as opening a door or closing a window.
The tasks share common primitive functions such as grasp and moving, so they can be seen as general multi-tasks with shared subtasks, which are consistent with our task decomposition strategy.
The implementation detail can be found in Appendix.
Performance on MT10 benchmark Table 1 shows the performance in the average success rate on
MT10 under mixed configurations of different datasets (MR, RP, ME).
We compare the performance vii
[Table]
[Figure]
SoftMod shows better performance for the configurations of high-quality datasets e.g., the row of (MR 0, RP 0, ME 10).
TD3+BC and PCGrad explore the orthogonality of tasks by accumulating task-specific knowledge separately without much interference when learning different tasks, and SoftMod rather exploits the commonality of the tasks by learning shared skills and dynamically extracting task-specific knowledge by the combination of its modules [7, 8].
Specifically, our TD3+BC implementation with one-hot task encoding tends to learn individual tasks separately, considering that the task encoding does not represent the semantic relation of different tasks explicitly.
PCGrad intends for geometric separation of model updates for minimizing both the individual loss of each task and the distance between the weights of different tasks.
SoftMod utilizes the shared weights of a modular network for jointly optimizing the multiple loss functions for the tasks [28].
Our SRTD tends to adjust both orthogonality and commonality using the quality-aware joint learning, so it can achieve robust performance for different mixed configurations.
SRTD+ID improves the performance over SRTD by 2.97% at average, clarifying the benefit of imaginary demonstrations in offline datasets.
Ablation study Figure 5(a) shows the effect of our skill regularization, where TE denotes the task embedding without skill regularization (i.e., only L TE in (3) is used), and SRTD-Q denotes
SRTD without the quality weighted term ˜ R ( s, a ) in (4).
SRTD shows better performance than the others consistently for all configurations.
However, SRTD-Q shows worse performance than viii
[Table]
TE, which specifies the benefit of quality-aware regularization.
Figure 5(b) shows the effect of our data augmentation method, where SRTD+N denotes SRTD with the Gaussian noise-based data augmentation commonly used in offline RL [23].
We observe that SRTD+N rarely achieves performance gains, compared to SRTD.
This clarifies the advantage of SRTD+ID that leverages high-quality skills to generate trajectories.
5.2 A Case Study for Airsim-based Drone Navigation
Here, we verify the applicability of our model in real-world problem scenarios by conducting a case study with autonomous quad-copter drones in the Airsim simulator [27].
We configure various realistic maps in PEDRA [29] and diverse wind patterns to build a multi-task drone flying environment.
Regarding the RL formulation, the drone agent is set to observe its lidar data, position, speed, and angle of rotation, while it is set not to observe any data about wind patterns.
With continuous observations, the drone agent conducts control actions by manipulating the 3-dimensional acceleration, and receives rewards based on the goal distance.
For evaluation, we measure the normalized episodic return based on the maximum episodic return obtained by a fully trained online RL agent.
Table 2 compares the performance by our model and the others.
For all mixed configurations, our model shows the best performance, outperforming the competitive SoftMod by 5.01% ∼ 11 .
Related Work
Multi-task RL Multi-task RL has been investigated for sample-efficiently dealing with complex control problems in real-world settings [30, 6, 8, 31].
By training a deep neural network with multiple tasks jointly, multi-task RL algorithms drive agents to learn how to share, reuse, and combine the knowledge across correlated tasks.
Yang et al.
[8] presented an explicit modular architecture with a soft routing network for training an integrated multi-task policy.
This, called soft modularization, addresses the issue of unclear task relation in a single network such that which shared parameters are related to which tasks.
Yu et al.
[7] proposed a gradient surgery methodology that directly removes the negative effects of multi-task learning in a single policy, identifying and adjusting geometric conflicts of calculated gradients when learning different tasks.
Task and skill embeddings in multi-task RL Several approaches using task embeddings have been introduced in the context of meta RL [32, 33, 34], multi-task RL [6, 35], imitation learning [36, 37], and non-stationary RL [38, 39].
Pertsch et al.
[40] demonstrated that with a pretrained low-level policy that readily achieves given skills, a high-level policy yielding appropriate skills can facilitate the learning efficiency, where skills are embedded in the latent space with expert data.
Sodhani et al.
[6] used additional metadata for learning a multi-task policy, exploiting task descriptions in natural language to represent the semantics and relation of tasks in the latent space.
While these prior works rely on online interaction and they rarely consider heterogeneous datasets and different behavior polices, which are common in multi-task offline RL, our model employs the quality-aware regularization to handle the mixed configurations of multi-task datasets.
We also devise a joint learning mechanism for skill and task representation in offline settings.
Data augmentation in offline RL To alleviate the issue of limited datasets and unseen states, several works exploited data augmentation [23, 41], data sharing [15, 11, 42], and model-based approach [43, 41] in offline RL.
For example, Sinha et al.
[23] tested several data augmentation ix schemes, demonstrating the possible performance gain with offline RL algorithms.
Yu et al.
[11] presented the conservative Q-function that can judge which transitions are relevant for learning a specific task, thus establishing a conditional data sharing strategy upon data scarcity situations.
Our data augmentation by imaginary demonstrations is in the same vein, but it focuses on exploiting common skills to generate trajectories that are likely to be generated by expert policies.
Conclusion
In this study, we proposed a novel multi-task offline RL model to tackle the problem of heterogeneous datasets of different behavior quality across tasks.
In the model, skills and tasks are jointly learned with quality-aware regularization so that achievable subtasks are found and aligned with high-quality skills.
Our model consistently yields robust performance upon various mixed configurations of different-quality datasets without requiring additional interaction with the environment.
The direction of our future works is to investigate the hierarchy of skill representation with different temporal abstraction levels in multi-task offline RL.
This will tackle the limitation of our model that considers only fixed-length sub-trajectories for task and skill embeddings.
Acknowledgement
We would like to thank anonymous reviewers for their valuable comments and suggestions.
This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT)
(No. 2022-0-00688, 2022-0-01045, 2022-000043, 2019-0-00421) and by the National Research Foundation of Korea (NRF) grant funded by
MSIT (No. 2020M3C1C2A01080819).