Papers › Which Invariance Should We Transfer? A Causal Minimax Learning Approach

Which Invariance Should We Transfer? A Causal Minimax Learning Approach

5 Jul 2021arXiv:2107.01876archive 2025-07-28

Mingzhou Liu, Xiangyu Zheng, Xinwei Sun, Fang Fang, Yizhou Wang

A major barrier to deploying current machine learning models lies in their non-reliability to dataset shifts. To resolve this problem, most existing studies attempted to transfer stable information to unseen environments. Particularly, independent causal mechanisms-based methods proposed to remove mutable causal mechanisms via the do-operator. Compared to previous methods, the obtained stable predictors are more effective in identifying stable information. However, a key question remains: which subset of this whole stable information should the model transfer, in order to achieve optimal generalization ability? To answer this question, we present a comprehensive minimax analysis from a causal perspective. Specifically, we first provide a graphical condition for the whole stable set to be optimal. When this condition fails, we surprisingly find with an example that this whole stable set, although can fully exploit stable information, is not the optimal one to transfer. To identify the optimal subset under this case, we propose to estimate the worst-case risk with a novel optimization scheme over the intervention functions on mutable causal mechanisms. We then propose an efficient algorithm to search for the subset with minimal worst-case risk, based on a newly defined equivalence relation between stable subsets. Compared to the exponential cost of exhaustively searching over all subsets, our searching strategy enjoys a polynomial complexity. The effectiveness and efficiency of our methods are demonstrated on synthetic data and the diagnosis of Alzheimer's disease.

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

Code

Syntology Ran 9 of 11 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 3 ran · honoured contract; 2 ran · our draft was wrong; 4 ran with no contract checked.

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

lmz123321/which_invariance officialmentioned in papermentioned on GitHubpytorch 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; 9 ran; 3 honoured the contract we drafted; 2 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
2ran · our draft was wrong
4ran
2unverified

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 lmz123321/which_invariance. “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.

BaseSet lmz123321/which_invariance/findoptset/findoptset.py official repository ran MIT (permissive) · 8525b5bfafe1c30a · report
EarlyStopping lmz123321/which_invariance/findoptset/findoptset.py official repository ran MIT (permissive) · 3efc81b90aa688b0 · report
NonLinearF lmz123321/which_invariance/findoptset/findoptset.py official repository ran MIT (permissive) · 42a16c34a54474ad · report
StEq lmz123321/which_invariance/findoptset/findoptset.py official repository ran fingerprinted MIT (permissive) · 0ce589516bdf4ef9 · report
concat lmz123321/which_invariance/findoptset/findoptset.py official repository ran · honoured contract MIT (permissive) · 33d995585c147c9b · report
dfTotensor lmz123321/which_invariance/findoptset/findoptset.py official repository ran · our draft was wrong MIT (permissive) · e4ac4ec9482c424f · report
order lmz123321/which_invariance/causal_discovery/causal_discovery.py official repository ran · honoured contract MIT (permissive) · fee338106eb0430c · report
regularizer lmz123321/which_invariance/findoptset/findoptset.py official repository ran · honoured contract MIT (permissive) · a19bab3200fcd75c · report
sort_topology lmz123321/which_invariance/findoptset/findoptset.py official repository ran · our draft was wrong MIT (permissive) · 8db73106e0f2c5b7 · report
OptSet lmz123321/which_invariance/findoptset/findoptset.py official repository unverified MIT (permissive) · 04f9916e300a43a2 · report
_weightcut lmz123321/which_invariance/findoptset/findoptset.py official repository unverified MIT (permissive) · d1540a9de04fa0fc · report

Tasks

Domain Generalization

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