{"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/learning-explanations-that-are-hard-to-vary","title":"Learning explanations that are hard to vary","arxiv_id":"2009.00329","date":"2020-09-01","proceeding":"ICLR 2021 1","authors":["Giambattista Parascandolo","Alexander Neitz","Antonio Orvieto","Luigi Gresele","Bernhard Schölkopf"],"abstract":"In this paper, we investigate the principle that `good explanations are hard to vary' in the context of deep learning. We show that averaging gradients across examples -- akin to a logical OR of patterns -- can favor memorization and `patchwork' solutions that sew together different strategies, instead of identifying invariances. To inspect this, we first formalize a notion of consistency for minima of the loss surface, which measures to what extent a minimum appears only when examples are pooled. We then propose and experimentally validate a simple alternative algorithm based on a logical AND, that focuses on invariances and prevents memorization in a set of real-world tasks. Finally, using a synthetic dataset with a clear distinction between invariant and spurious mechanisms, we dissect learning signals and compare this approach to well-established regularizers.","url_abs":"https://arxiv.org/abs/2009.00329v3","url_pdf":"https://arxiv.org/pdf/2009.00329v3.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":"learning-explanations-that-are-hard-to-vary","repo_url":"https://github.com/gibipara92/learning-explanations-hard-to-vary","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"learning-explanations-that-are-hard-to-vary","repo_url":"https://github.com/pytorch/ignite","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"paper_slug":"learning-explanations-that-are-hard-to-vary","repo_url":"https://github.com/facebookresearch/DomainBed","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-explanations-that-are-hard-to-vary","repo_url":"https://github.com/jefferythewind/era-splitting-notebook-examples","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"CC0-1.0"}}],"tasks":[{"task_slug":"memorization","task_name":"Memorization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2009.00329","atlas_url":"https://app.syntology.ai/?focus=2009.00329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00329"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.00329"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.00329"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.00329\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2009.00329"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2009.00329\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2009.00329"},"call":"get_concepts_for_paper(arxiv_id=\"2009.00329\")"}],"by_repo":[{"repo":"gibipara92/learning-explanations-hard-to-vary","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"pytorch/ignite","kind":"official","samples":5,"ran":4,"instrument":0,"unverified":1},{"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\")"}]},{"repo":"jefferythewind/era-splitting-notebook-examples","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2009.00329.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2009.00329.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/facebookresearch/DomainBed","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pytorch/ignite","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/gibipara92/learning-explanations-hard-to-vary","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jefferythewind/era-splitting-notebook-examples","reach":{"status":"ok","spdx":"CC0-1.0"}}],"summary":{"ran":4,"unverified":1},"n_samples":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":5,"ran":4,"n_ran_checked":4,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":4,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"184b5d454726edda","code_sha256_prefix":"184b5d454726edda","entry":"apply_to_tensor","repo":"pytorch/ignite","repo_kind":"official","path":"ignite/utils.py","file_url":"https://github.com/pytorch/ignite/blob/HEAD/ignite/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"x:list/1/Tensor, func:callable/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"184b5d454726edda"}},{"code_sha256":"2e98a4328eaffa86","code_sha256_prefix":"2e98a4328eaffa86","entry":"apply_to_type","repo":"pytorch/ignite","repo_kind":"official","path":"ignite/utils.py","file_url":"https://github.com/pytorch/ignite/blob/HEAD/ignite/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"x:list/1/int, input_type:callable/0/?, func:callable/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2e98a4328eaffa86"}},{"code_sha256":"c5a5d2073ddf5d69","code_sha256_prefix":"c5a5d2073ddf5d69","entry":"keep_random_state","repo":"pytorch/ignite","repo_kind":"official","path":"ignite/engine/deterministic.py","file_url":"https://github.com/pytorch/ignite/blob/HEAD/ignite/engine/deterministic.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"func:callable/0/?","fixture_out_type":"function","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c5a5d2073ddf5d69"}},{"code_sha256":"bbdae9be673b6958","code_sha256_prefix":"bbdae9be673b6958","entry":"update_dataloader","repo":"pytorch/ignite","repo_kind":"official","path":"ignite/engine/deterministic.py","file_url":"https://github.com/pytorch/ignite/blob/HEAD/ignite/engine/deterministic.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataloader:DataLoader/0/?, new_batch_sampler:BatchSampler/0/?","fixture_out_type":"DataLoader","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bbdae9be673b6958"}},{"code_sha256":"d8322fb4b8af1ea8","code_sha256_prefix":"d8322fb4b8af1ea8","entry":"convert_tensor","repo":"pytorch/ignite","repo_kind":"official","path":"ignite/utils.py","file_url":"https://github.com/pytorch/ignite/blob/HEAD/ignite/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d8322fb4b8af1ea8"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d3b31a073e8e8a57ebd915f1f2bef941bafc72565b3a4e1548d444b106d21f26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}