Papers › Cross-Domain Policy Adaptation by Capturing Representation Mismatch

Cross-Domain Policy Adaptation by Capturing Representation Mismatch

24 May 2024arXiv:2405.15369archive 2025-07-28

Jiafei Lyu, Chenjia Bai, Jingwen Yang, Zongqing Lu, Xiu Li

It is vital to learn effective policies that can be transferred to different domains with dynamics discrepancies in reinforcement learning (RL). In this paper, we consider dynamics adaptation settings where there exists dynamics mismatch between the source domain and the target domain, and one can get access to sufficient source domain data, while can only have limited interactions with the target domain. Existing methods address this problem by learning domain classifiers, performing data filtering from a value discrepancy perspective, etc. Instead, we tackle this challenge from a decoupled representation learning perspective. We perform representation learning only in the target domain and measure the representation deviations on the transitions from the source domain, which we show can be a signal of dynamics mismatch. We also show that representation deviation upper bounds performance difference of a given policy in the source domain and target domain, which motivates us to adopt representation deviation as a reward penalty. The produced representations are not involved in either policy or value function, but only serve as a reward penalizer. We conduct extensive experiments on environments with kinematic and morphology mismatch, and the results show that our method exhibits strong performance on many tasks. Our code is publicly available at https://github.com/dmksjfl/PAR.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

Syntology holds a reference implementation of Cross-Domain Policy Adaptation by Capturing Representation Mismatch, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). For this implementation, level 3 is recorded, but its report lists no property test that passed on both. No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Cross-Domain Policy Adaptation by Capturing Representation Mismatch') (how to connect); the free check have('2405.15369') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 13 code samples harvested from 4 repositories linked to this paper: 10 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; 2 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 5 samples from 1 repository, 4 ran (3 with no instrument failure; 1 where Syntology's instrument failed); found in paper text by Syntology: 8 samples from 3 repositories, 6 ran (3 with no instrument failure; 3 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 10 samples that ran have no recorded date.

dmksjfl/par officialmentioned in papermentioned on GitHubpytorchSyntology: 5 samples, 4 ran (1 instrument-failed) · 1 unverified 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

13 samples harvested: 10 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
2ran; the contract check could not run
5ran
3unverified

Licence: 9 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. For 3 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. 1 sample whose link to this paper records no repository is listed under one of this paper's own repositories, because identical code was harvested from it for another paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

dmksjfl/par official repository 5 samples, 4 ran (1 instrument-failed) · 1 unverified
AvgL1Norm in 6 papers algo/PAR.py identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own ran · our draft was wrong fingerprinted licence of this copy not recorded · 1e71094b23b75fbe · report fixture: signature x:Tensor/2/float, eps:float/0/float · returned Tensor · level recorded, date not recorded
Encoder in 278 papers algo/PAR.py ran · metamorphic tier: deterministic no licence file found · pointer only · d4549ddb93436460 · report fixture: returned Encoder · level recorded 2026-09-22
Policy in 23 papers algo/PAR.py ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only · 410b5d459ab3fd2b · report fixture: returned Policy · level recorded 2026-09-22
eval_policy in 15 papers train_offline.py ran · honoured contract no licence file found · pointer only · 2a67e91feeab6fb8 · report fixture: signature policy:callable/0/?, env:SimpleEnv/0/?, eval_episodes:int/0/int, eval_cnt:int/0/int · returned float · level recorded, date not recorded
PAR algo/PAR.py unverified no licence file found · pointer only · 578f3481eb1c9cd4 · report
tinkoff-ai/CORL found in paper text by Syntology 1 sample, 1 ran (0 instrument-failed) · 0 unverified
CalQL algorithms/finetune/cal_ql.py ran Apache-2.0 (permissive) · 174015b80fd5152d · report fixture: returned CalQL · level recorded 2026-09-22
Kavka1/VGDF found in paper text by Syntology 6 samples, 4 ran (3 instrument-failed) · 2 unverified
call_activation model/base.py ran · our draft was wrong MIT (permissive) · 69beeb71e148597d · report fixture: signature name:str/0/str · returned type · level recorded 2026-09-24
call_mlp model/base.py ran MIT (permissive) · 9cae947bc688c602 · report fixture: signature in_dim:int/0/int, out_dim:int/0/int, hidden_layers:list/1/int, inner_activation:str/0/str, output_activation:str/0/str, initializer:str/0/str, layer_factory:NoneType/0/? · returned Sequential · level recorded 2026-09-24
is_terminal_region_for_at env/env_utils.py ran; the contract check could not run (RAISES) MIT (permissive) here; the stored copy is pointer only · b8653ae9a4e21d3c · report fixture: signature state:Tensor/2/float, return_done:bool/0/bool · returned Tensor · level recorded 2026-09-25
is_terminal_region_for_hp env/env_utils.py ran; the contract check could not run (RAISES) MIT (permissive) here; the stored copy is pointer only · 0aa4b9c66abed3d1 · report fixture: signature state:ndarray/2/float, return_done:bool/0/bool · returned ndarray · level recorded 2026-09-25
init_weights in 109 papers model/dynamics.py unverified MIT (permissive) · 3f3ed592dc8c7b88 · report
is_terminal_region_for_hc env/env_utils.py unverified MIT (permissive) here; the stored copy is pointer only · b126429395363b00 · report
t6-thu/H2O found in paper text by Syntology 1 sample, 1 ran (0 instrument-failed) · 0 unverified
Discriminator in 42 papers Network/Weight_net.py ran · metamorphic tier: invariant fingerprinted no licence file found · pointer only · a0b6506a43dcb733 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-22

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

4 assemblies on this paper: 3 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).

generated Assembly for Cross-Domain Policy Adaptation by Capturing Representation Mismatch (graph method: Cross-Domain Policy Adaptation by Capturing Representation Mismatch), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer; level 3 is recorded, but its report lists no property test that passed on both.

label matches by construction: the code was generated for this method (not judged by a model)

  1. compute_representation_mismatch_penalty entry · level 3 · ran · violated contract · 75fac75498c9e3330abb437128a5c4e130b8abb64b9bf0710ad6184fd792f19c

3 sibling assemblies for Cross-Domain Policy Adaptation by Capturing Representation Mismatch (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Cross-Domain Policy Adaptation by Capturing Representation Mismatch (graph method: Cross-Domain Policy Adaptation by Capturing Representation Mismatch). 7 bricks; individually on a fixture: 6 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.

one of 3 siblings

  1. PAR entry · level 0 · unverified · 578f3481eb1c9cd4
  2. DoubleQFunc model · level 1 · ran · 61f889f4af38b19e
  3. Encoder model · level 1 · ran · d4549ddb93436460
  4. Policy model · level 1 · ran · 410b5d459ab3fd2b
  5. MLPNetwork helper · level 1 · ran · c62cb3511f9129eb
  6. AvgL1Norm helper · level 1 · ran · our draft was wrong · 1e71094b23b75fbe
  7. TanhTransform data_transform · level 1 · ran · b6adb9bd3187839e

harvested Assembly for Cross-Domain Policy Adaptation by Capturing Representation Mismatch (graph method: Cross-Domain Policy Adaptation by Capturing Representation Mismatch). 3 bricks; individually on a fixture: 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 3 siblings

  1. CalQL entry · level 1 · ran · 174015b80fd5152d
  2. Scalar helper · level 1 · ran · d7ebf290cb024d50
  3. soft_update update_rule · level 0 · unverified · 12fd41e242a13169

harvested Assembly for Cross-Domain Policy Adaptation by Capturing Representation Mismatch (graph method: Cross-Domain Policy Adaptation by Capturing Representation Mismatch). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 3 siblings

  1. Discriminator entry · level 1 · ran · a0b6506a43dcb733

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2405.15369") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Reinforcement Learning (RL)Representation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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