Papers › Counterfactual Data Augmentation using Locally Factored Dynamics

Counterfactual Data Augmentation using Locally Factored Dynamics

6 Jul 2020NeurIPS 2020 12arXiv:2007.02863archive 2025-07-28

Silviu Pitis, Elliot Creager, Animesh Garg

Many dynamic processes, including common scenarios in robotic control and reinforcement learning (RL), involve a set of interacting subprocesses. Though the subprocesses are not independent, their interactions are often sparse, and the dynamics at any given time step can often be decomposed into locally independent causal mechanisms. Such local causal structures can be leveraged to improve the sample efficiency of sequence prediction and off-policy reinforcement learning. We formalize this by introducing local causal models (LCMs), which are induced from a global causal model by conditioning on a subset of the state space. We propose an approach to inferring these structures given an object-oriented state representation, as well as a novel algorithm for Counterfactual Data Augmentation (CoDA). CoDA uses local structures and an experience replay to generate counterfactual experiences that are causally valid in the global model. We find that CoDA significantly improves the performance of RL agents in locally factored tasks, including the batch-constrained and goal-conditioned settings.

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="2007.02863")

Code

Syntology Ran 6 of 6 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 5 ran · our draft was wrong; 1 ran · fixture could not drive it.

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

spitis/mrl mentioned in paperpytorch 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

6 samples harvested; 6 ran; 0 honoured the contract we drafted; 0 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.

5ran · our draft was wrong
1ran · fixture could not drive it

Licence: 0 of the 6 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 spitis/mrl. “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.

disentangled_components spitis/mrl/experiments/coda/coda_generic.py named in the paper ran · our draft was wrong MIT (permissive) · f6088e3b8c2a14bd · report
get_cc_from_mask spitis/mrl/experiments/coda/coda_generic.py named in the paper ran · our draft was wrong MIT (permissive) · 62a66cf24d4188c6 · report
get_dcs_from_mask spitis/mrl/experiments/coda/coda_generic.py named in the paper ran · our draft was wrong MIT (permissive) · f6921d8bcbb23184 · report
powerset spitis/mrl/experiments/coda/coda_generic.py named in the paper ran · our draft was wrong MIT (permissive) · 04039e3271a013fe · report
reduce_cc_list_by_union spitis/mrl/experiments/coda/coda_generic.py named in the paper ran · our draft was wrong fingerprinted MIT (permissive) · d71eb24af229ef04 · report
transitions_and_masks_to_proposals spitis/mrl/experiments/coda/coda_generic.py named in the paper ran · fixture could not drive it MIT (permissive) · ae7321e51002bfa7 · report

Tasks

Data AugmentationGeneral Reinforcement LearningMulti-Goal Reinforcement LearningReinforcement LearningReinforcement Learning (RL)reinforcement-learning

2 archive task tags without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Experience Replay

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