U Berkeley, Abhishek Gupta, Sergey Levine, Chelsea Finn, Marvin Zhang, Henrik Marklund, Nikita Dhawan
None of the 1 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2007.02931.json · badge: /api/ran/2007.02931.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_algorithm_class | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from facebookresearch/domainbed pointer only · get_code("b0bc80b1655a6802") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 1 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| get_algorithm_class | 39 other papers 1 dated earlier, 1 the same month, 37 later |
1907.02893 (2019-07) Invariant Risk Minimization |
2007.01434 (2020-07) In Search of Lost Domain Generalization 2104.09841 (2021-04) SelfReg: Self-supervised Contrastive Regularization for Domain Generalization and 36 more not named here |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A fundamental assumption of most machine learning algorithms is that the training and test data are drawn from the same underlying distribution. However, this assumption is violated in almost all practical applications: machine learning systems are regularly tested under distribution shift, due to changing temporal correlations, atypical end users, or other factors. In this work, we consider the problem setting of domain generalization, where the training data are structured into domains and there may be multiple test time shifts, corresponding to new domains or domain distributions. Most prior methods aim to learn a single robust model or invariant feature space that performs well on all domains. In contrast, we aim to learn models that adapt at test time to domain shift using unlabeled test points. Our primary contribution is to introduce the framework of adaptive risk minimization (ARM), in which models are directly optimized for effective adaptation to shift by learning to adapt on the training domains. Compared to prior methods for robustness, invariance, and adaptation, ARM methods provide performance gains of 1-4% test accuracy on a number of image classification problems exhibiting domain shift.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.02931")
get_code_for_paper("2007.02931")
have("2007.02931")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.02931.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.02931)
Connect an agent — have() is free.