{"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":"/code/erm","entry":"ERM","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":13,"n_samples_ran":3,"n_samples_constructed":2,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":10,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":6,"n_places_pointer_only_link_open":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_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":10},"key_notes":{"n_samples_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_samples_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2601.21999","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21999","title":"Negatives-Dominant Contrastive Learning for Generalization in Imbalanced Domains","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Alrash/NDCL","path":"src/algorithms.py","file_url":"https://github.com/Alrash/NDCL/blob/HEAD/src/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ce4296f1a8be155","code_sha256_prefix":"8ce4296f1a8be155","mcp_get_code":{"code_sha256":"8ce4296f1a8be155"}},{"arxiv_id":"2502.04242","arxiv_id_is_arxiv":true,"paper":"/paper/a-theoretical-framework-for-data-efficient","title":"A Theoretical Framework for Data Efficient Multi-Source Transfer Learning Based on Cramér-Rao Bound","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zqy0126/OTQMS","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zqy0126/OTQMS when it was checked","code_sha256":"175c71bda4cdb132","code_sha256_prefix":"175c71bda4cdb132","mcp_get_code":{"code_sha256":"175c71bda4cdb132"}},{"arxiv_id":"2410.06976","arxiv_id_is_arxiv":true,"paper":"/paper/adarc-mitigating-graph-structure-shifts","title":"AdaRC: Mitigating Graph Structure Shifts during Test-Time","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baowenxuan/Matcha","path":"src/algo/Matcha.py","file_url":"https://github.com/baowenxuan/Matcha/blob/HEAD/src/algo/Matcha.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, baowenxuan/Matcha when it was checked","code_sha256":"44f52382869b4a66","code_sha256_prefix":"44f52382869b4a66","mcp_get_code":{"code_sha256":"44f52382869b4a66"}},{"arxiv_id":"2402.11682","arxiv_id_is_arxiv":true,"paper":"/paper/learning-conditional-invariances-through-non","title":"Learning Conditional Invariances through Non-Commutativity","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhrac/nci","path":"algorithms.py","file_url":"https://github.com/abhrac/nci/blob/HEAD/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c28eaad8aeddfa52","code_sha256_prefix":"c28eaad8aeddfa52","mcp_get_code":{"code_sha256":"c28eaad8aeddfa52"}},{"arxiv_id":"2309.16748","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-environments-with-xrm","title":"Discovering environments with XRM","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/XRM","path":"algorithms.py","file_url":"https://github.com/facebookresearch/XRM/blob/HEAD/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/XRM (NOASSERTION)","code_sha256":"4860ec38df3adff5","code_sha256_prefix":"4860ec38df3adff5","mcp_get_code":{"code_sha256":"4860ec38df3adff5"}},{"arxiv_id":"2307.12502","arxiv_id_is_arxiv":true,"paper":"/paper/cross-contrastive-feature-perturbation-for","title":"Cross Contrasting Feature Perturbation for Domain Generalization","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackmebroo/cross-contrasting-feature-perturbation-for-domain-generalization","path":"algorithms.py","file_url":"https://github.com/hackmebroo/cross-contrasting-feature-perturbation-for-domain-generalization/blob/HEAD/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hackmebroo/cross-contrasting-feature-perturbation-for-domain-generalization when it was checked","code_sha256":"50d94f70eea6617f","code_sha256_prefix":"50d94f70eea6617f","mcp_get_code":{"code_sha256":"50d94f70eea6617f"}},{"arxiv_id":"2303.17765","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-similar-linear-representations","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ytstat/rl-mtl-tl","path":"mtl_func_torch.py","file_url":"https://github.com/ytstat/rl-mtl-tl/blob/HEAD/mtl_func_torch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ytstat/rl-mtl-tl when it was checked","code_sha256":"2ebb3987790c2b6c","code_sha256_prefix":"2ebb3987790c2b6c","mcp_get_code":{"code_sha256":"2ebb3987790c2b6c"}},{"arxiv_id":"2301.12067","arxiv_id_is_arxiv":true,"paper":"/paper/learning-optimal-features-via-partial","title":"Learning Optimal Features via Partial Invariance","date":"2023-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IbtihalFerwana/pirm","path":"metashift/experiments/distribution_shift/algorithms.py","file_url":"https://github.com/IbtihalFerwana/pirm/blob/HEAD/metashift/experiments/distribution_shift/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e42c3e6342733d8","code_sha256_prefix":"5e42c3e6342733d8","mcp_get_code":{"code_sha256":"5e42c3e6342733d8"}},{"arxiv_id":"2206.05263","arxiv_id_is_arxiv":true,"paper":"/paper/causal-balancing-for-domain-generalization","title":"Causal Balancing for Domain Generalization","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangxinyilinda/causal-balancing-for-domain-generalization","path":"domainbed/algorithms.py","file_url":"https://github.com/wangxinyilinda/causal-balancing-for-domain-generalization/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7922723bedecc164","code_sha256_prefix":"7922723bedecc164","mcp_get_code":{"code_sha256":"7922723bedecc164"}},{"arxiv_id":"2205.14546","arxiv_id_is_arxiv":true,"paper":"/paper/the-missing-invariance-principle-found-the","title":"The Missing Invariance Principle Found -- the Reciprocal Twin of Invariant Risk Minimization","date":"2022-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/mri","path":"custom_algorithms.py","file_url":"https://github.com/ibm/mri/blob/HEAD/custom_algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5aebea4d4ebff0d4","code_sha256_prefix":"5aebea4d4ebff0d4","mcp_get_code":{"code_sha256":"5aebea4d4ebff0d4"}},{"arxiv_id":"2204.04384","arxiv_id_is_arxiv":true,"paper":"/paper/the-two-dimensions-of-worst-case-training-and","title":"The Two Dimensions of Worst-case Training and the Integrated Effect for Out-of-domain Generalization","date":"2022-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oodbag/w2d","path":"DomainBed/domainbed/algorithms.py","file_url":"https://github.com/oodbag/w2d/blob/HEAD/DomainBed/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, oodbag/w2d when it was checked","code_sha256":"ef92685dbb4a6185","code_sha256_prefix":"ef92685dbb4a6185","mcp_get_code":{"code_sha256":"ef92685dbb4a6185"}},{"arxiv_id":"2203.09513","arxiv_id_is_arxiv":true,"paper":"/paper/on-multi-domain-long-tailed-recognition","title":"On Multi-Domain Long-Tailed Recognition, Imbalanced Domain Generalization and Beyond","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YyzHarry/multi-domain-imbalance","path":"mdlt/learning/algorithms.py","file_url":"https://github.com/YyzHarry/multi-domain-imbalance/blob/HEAD/mdlt/learning/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dca4155e189930af","code_sha256_prefix":"dca4155e189930af","mcp_get_code":{"code_sha256":"dca4155e189930af"}},{"arxiv_id":"2201.12919","arxiv_id_is_arxiv":true,"paper":"/paper/provable-domain-generalization-via-invariant","title":"Provable Domain Generalization via Invariant-Feature Subspace Recovery","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoxiang-wang/isr","path":"linear_unit_tests/isr.py","file_url":"https://github.com/haoxiang-wang/isr/blob/HEAD/linear_unit_tests/isr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea8e9b41e123be6a","code_sha256_prefix":"ea8e9b41e123be6a","mcp_get_code":{"code_sha256":"ea8e9b41e123be6a"}}],"record_sha256":"ded497ada1a62e53b3db80e294e0d502030c7036f89c70dd91872e081ce8a118","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}