Papers › Off-Dynamics Reinforcement Learning: Training for Transfer with Domain Classifiers

Off-Dynamics Reinforcement Learning: Training for Transfer with Domain Classifiers

24 Jun 2020ICLR 2021 1arXiv:2006.13916archive 2025-07-28

Benjamin Eysenbach, Swapnil Asawa, Shreyas Chaudhari, Sergey Levine, Ruslan Salakhutdinov

We propose a simple, practical, and intuitive approach for domain adaptation in reinforcement learning. Our approach stems from the idea that the agent's experience in the source domain should look similar to its experience in the target domain. Building off of a probabilistic view of RL, we formally show that we can achieve this goal by compensating for the difference in dynamics by modifying the reward function. This modified reward function is simple to estimate by learning auxiliary classifiers that distinguish source-domain transitions from target-domain transitions. Intuitively, the modified reward function penalizes the agent for visiting states and taking actions in the source domain which are not possible in the target domain. Said another way, the agent is penalized for transitions that would indicate that the agent is interacting with the source domain, rather than the target domain. Our approach is applicable to domains with continuous states and actions and does not require learning an explicit model of the dynamics. On discrete and continuous control tasks, we illustrate the mechanics of our approach and demonstrate its scalability to high-dimensional tasks.

PaperPDFConference PDFCodeCode 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="2006.13916")

Code

Syntology Ran 18 of 23 code samples harvested from 4 repositories linked to this paper; 5 have no recorded run. Of those that ran: 3 ran · honoured contract; 6 ran · our draft was wrong; 9 ran with no contract checked.

By repository: community (archive-listed): 17 samples from 2 repositories, 15 ran; found in paper text by Syntology: 6 samples from 2 repositories, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

pauldaoudi/food mentioned on GitHubpytorch report
shreyasc-13/off_domain_rlkit mentioned on GitHubpytorchMIT 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

23 samples harvested; 18 ran; 3 honoured the contract we drafted; 5 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.

3ran · honoured contract
6ran · our draft was wrong
9ran
5unverified

Licence: 0 of the 23 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 4 repositories linked to this paper, official or community; each sample names its own and says which. “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.

Discriminator pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran fingerprinted MIT (permissive) · 85dcfc68165685af · report
ExpertDataset pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran MIT (permissive) · 3072f035b0c85c12 · report
RolloutStorage pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran MIT (permissive) · d5c0698f7ffe2457 · report
RunningMeanStd pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran MIT (permissive) · 54a2a67d3023c95b · report
_flatten_helper pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran · our draft was wrong fingerprinted MIT (permissive) · 0207b2d8ce743999 · report
clip_magnitude shreyasc-13/off_domain_rlkit/rlkit/pythonplusplus.py community (archive-listed) ran fingerprinted MIT (permissive) · 93d28ca67303e04b · report
create_stats_ordered_dict shreyasc-13/off_domain_rlkit/rlkit/core/eval_util.py community (archive-listed) ran MIT (permissive) · fadf5f762ff04cd6 · report
expert_data_loader pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 6e7428e76d042cba · report
get_average_returns shreyasc-13/off_domain_rlkit/rlkit/core/eval_util.py community (archive-listed) ran MIT (permissive) · a5d10a0b704c8db7 · report
get_dataset pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran · our draft was wrong MIT (permissive) · c49250e1563ad2cd · report
identity shreyasc-13/off_domain_rlkit/rlkit/pythonplusplus.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 9910e2fc297f8665 · report
is_numeric shreyasc-13/off_domain_rlkit/rlkit/pythonplusplus.py community (archive-listed) ran fingerprinted MIT (permissive) · 4138766e854db009 · report
obs_batch_normalize pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 0642a6a4bea7b65a · report
simple_separated_format shreyasc-13/off_domain_rlkit/rlkit/core/tabulate.py community (archive-listed) ran MIT (permissive) · 5cb0c55f58279f59 · report
update_mean_var_count_from_moments pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · e2024afc1a6905ff · report
ConcatDiscriminator pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) unverified MIT (permissive) · 4bf00ffb22a14dca · report
NetworksManager pauldaoudi/food/agents/algos_utils/darc_utils/networks_manager.py community (archive-listed) unverified MIT (permissive) · a1e7649f2401900f · report
td_target JannerM/mbpo/mbpo/algorithms/mbpo.py found in paper text by Syntology ran · honoured contract fingerprinted MIT (permissive) · 31deb9c7be58e00c · report
format_samples_for_training JannerM/mbpo/mbpo/models/constructor.py found in paper text by Syntology ran · our draft was wrong MIT (permissive) · 1bb5583dba32f555 · report
get_required_argument JannerM/mbpo/mbpo/models/utils.py found in paper text by Syntology ran · our draft was wrong MIT (permissive) · 4eb5226056a1f70f · report
create_read_only kchua/handful-of-trials/dmbrl/config/default.py found in paper text by Syntology unverified MIT (permissive) · 738c96c362e9ea1d · report
make_bool kchua/handful-of-trials/dmbrl/config/default.py found in paper text by Syntology unverified MIT (permissive) · 22eb5e3f463c48d7 · report
mass_center JannerM/mbpo/mbpo/env/humanoid.py found in paper text by Syntology unverified MIT (permissive) · 46bd205700c42f20 · report

Tasks

Continuous ControlDomain AdaptationReinforcement LearningReinforcement Learning (RL)continuous-controlreinforcement-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