{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/out-of-distribution-generalization-with","title":"When is invariance useful in an Out-of-Distribution Generalization problem ?","arxiv_id":"2008.01883","date":"2020-08-04","proceeding":null,"authors":["Masanori Koyama","Shoichiro Yamaguchi"],"abstract":"The goal of Out-of-Distribution (OOD) generalization problem is to train a predictor that generalizes on all environments. Popular approaches in this field use the hypothesis that such a predictor shall be an \\textit{invariant predictor} that captures the mechanism that remains constant across environments. While these approaches have been experimentally successful in various case studies, there is still much room for the theoretical validation of this hypothesis. This paper presents a new set of theoretical conditions necessary for an invariant predictor to achieve the OOD optimality. Our theory not only applies to non-linear cases, but also generalizes the necessary condition used in \\citet{rojas2018invariant}. We also derive Inter Gradient Alignment algorithm from our theory and demonstrate its competitiveness on MNIST-derived benchmark datasets as well as on two of the three \\textit{Invariance Unit Tests} proposed by \\citet{aubinlinear}.","url_abs":"https://arxiv.org/abs/2008.01883v4","url_pdf":"https://arxiv.org/pdf/2008.01883v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"out-of-distribution-generalization-with","repo_url":"https://github.com/facebookresearch/DomainBed","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"out-of-distribution-generalization","task_name":"Out-of-Distribution Generalization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2008.01883","atlas_url":"https://app.syntology.ai/?focus=2008.01883","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2008.01883"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2008.01883\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2008.01883"},"call":"get_concepts_for_paper(arxiv_id=\"2008.01883\")"}],"by_repo":[{"repo":"facebookresearch/DomainBed","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":11,"harvested_for":["1505.07818","1512.03385","1607.01719","1907.02893","1911.08731","2003.00688","2007.01434","2011.09468","2106.03632","2106.07847","2201.00057"],"harvested_for_calls":[{"arxiv_id":"1505.07818","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.07818"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.07818\")"},{"arxiv_id":"1512.03385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.03385"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.03385\")"},{"arxiv_id":"1607.01719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.01719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.01719\")"},{"arxiv_id":"1907.02893","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.02893"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.02893\")"},{"arxiv_id":"1911.08731","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.08731"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.08731\")"},{"arxiv_id":"2003.00688","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.00688"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.00688\")"},{"arxiv_id":"2007.01434","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.01434"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.01434\")"},{"arxiv_id":"2011.09468","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2011.09468"},"call":"get_harvested_code_for_paper(arxiv_id=\"2011.09468\")"},{"arxiv_id":"2106.03632","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03632"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03632\")"},{"arxiv_id":"2106.07847","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.07847"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.07847\")"},{"arxiv_id":"2201.00057","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.00057"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.00057\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e5788ef1d1487b6183216fc9bbd3ea835b711d614bd2cd14f6b406935886de64","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}