Papers › Task-Aware Harmony Multi-Task Decision Transformer for Offline Reinforcement Learning

Task-Aware Harmony Multi-Task Decision Transformer for Offline Reinforcement Learning

2 Nov 2024arXiv:2411.01146archive 2025-07-28

Ziqing Fan, Shengchao Hu, YuHang Zhou, Li Shen, Ya zhang, Yanfeng Wang, DaCheng Tao

The purpose of offline multi-task reinforcement learning (MTRL) is to develop a unified policy applicable to diverse tasks without the need for online environmental interaction. Recent advancements approach this through sequence modeling, leveraging the Transformer architecture's scalability and the benefits of parameter sharing to exploit task similarities. However, variations in task content and complexity pose significant challenges in policy formulation, necessitating judicious parameter sharing and management of conflicting gradients for optimal policy performance. Furthermore, identifying the optimal parameter subspace for each task often necessitates prior knowledge of the task identifier during inference, limiting applicability in real-world scenarios with variable task content and unknown current tasks. In this work, we introduce the Harmony Multi-Task Decision Transformer (HarmoDT), a novel solution designed to identify an optimal harmony subspace of parameters for each task. We formulate this as a bi-level optimization problem within a meta-learning framework, where the upper level learns masks to define the harmony subspace, while the inner level focuses on updating parameters to improve the overall performance of the unified policy. To eliminate the need for task identifiers, we further design a group-wise variant (G-HarmoDT) that clusters tasks into coherent groups based on gradient information, and utilizes a gating network to determine task identifiers during inference. Empirical evaluations across various benchmarks highlight the superiority of our approach, demonstrating its effectiveness in the multi-task context with specific improvements of 8% gain in task-provided settings, 5% in task-agnostic settings, and 10% in unseen settings.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2411.01146")

Code

Syntology Ran 1 of 11 code samples harvested from 1 repository linked to this paper; 10 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

charleshsc/HarmoDT officialpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 1 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
10unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from charleshsc/HarmoDT. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

simple_separated_format charleshsc/HarmoDT/tabulate.py official repository ran Apache-2.0 (permissive) · 5cb0c55f58279f59 · report
create_exp_name charleshsc/HarmoDT/logger.py official repository unverified Apache-2.0 (permissive) · 5e687d63bb9beb4a · report
dict_to_safe_json charleshsc/HarmoDT/logger.py official repository unverified Apache-2.0 (permissive) · 41279dfcda8b39e4 · report
flatten_prompt charleshsc/HarmoDT/prompt_dt/prompt_utils.py official repository unverified Apache-2.0 (permissive) · 0228f4b37ceb225d · report
get_harmo_gradient charleshsc/HarmoDT/prompt_dt/fl_utils.py official repository unverified Apache-2.0 (permissive) · c268a0545b986015 · report
load_tf_weights_in_gpt2 charleshsc/HarmoDT/prompt_dt/trajectory_gpt2.py official repository unverified Apache-2.0 (permissive) · 00a33466c69c5705 · report
mask_dead_harmo charleshsc/HarmoDT/prompt_dt/fl_utils.py official repository unverified Apache-2.0 (permissive) · 75501b4b19ca6c54 · report
mask_generate_harmo charleshsc/HarmoDT/prompt_dt/fl_utils.py official repository unverified Apache-2.0 (permissive) · 87276e0c489ddfa4 · report
prompt_evaluate_episode charleshsc/HarmoDT/prompt_dt/prompt_evaluate_episodes.py official repository unverified Apache-2.0 (permissive) · 5025e676615b5431 · report
prompt_evaluate_episode_rtg charleshsc/HarmoDT/prompt_dt/prompt_evaluate_episodes.py official repository unverified Apache-2.0 (permissive) · efac75dc4db6721d · report
safe_json charleshsc/HarmoDT/logger.py official repository unverified Apache-2.0 (permissive) · 07afff96928bd142 · report

Tasks

Meta-Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections