{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-algorithm-class","entry":"get_algorithm_class","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":42,"n_papers_ran":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":5,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":43,"n_places_pointer_only":21,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2605.16372","paper":"/paper/arxiv-2605-16372","title":"SWORDBENCH: Evaluating Orthogonality of Steering Image Representations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Weixin-Liang/MetaShift","path":"experiments/distribution_shift/algorithms.py","file_url":"https://github.com/Weixin-Liang/MetaShift/blob/HEAD/experiments/distribution_shift/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2605.02063","paper":"/paper/arxiv-2605-02063","title":"Coopetition-Gym v1: A Formally Grounded Platform for Mixed-Motive Multi-Agent Reinforcement Learning under Strategic Coopetition","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vikpant/strategic-coopetition","path":"coopetition_gym/experiments/algorithms.py","file_url":"https://github.com/vikpant/strategic-coopetition/blob/HEAD/coopetition_gym/experiments/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"8d43b87e1759e8d1","mcp_get_code":{"code_sha256":"8d43b87e1759e8d1"}},{"arxiv_id":"2605.02063","paper":"/paper/arxiv-2605-02063","title":"Coopetition-Gym v1: A Formally Grounded Platform for Mixed-Motive Multi-Agent Reinforcement Learning under Strategic Coopetition","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vikpant/strategic-coopetition","path":"coopetition_gym/experiments/campaign.py","file_url":"https://github.com/vikpant/strategic-coopetition/blob/HEAD/coopetition_gym/experiments/campaign.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f7496be9dade6f6e","mcp_get_code":{"code_sha256":"f7496be9dade6f6e"}},{"arxiv_id":"2407.09498","paper":"/paper/ot-vp-optimal-transport-guided-visual","title":"OT-VP: Optimal Transport-guided Visual Prompting for Test-Time Adaptation","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/ot-vp","path":"domainbed/adapt_algorithms.py","file_url":"https://github.com/zybeich/ot-vp/blob/HEAD/domainbed/adapt_algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2404.16277","paper":"/paper/causally-inspired-regularization-enables","title":"Causally Inspired Regularization Enables Domain General Representations","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olawalesalaudeen/tcri","path":"DomainBed/domainbed/algorithms.py","file_url":"https://github.com/olawalesalaudeen/tcri/blob/HEAD/DomainBed/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2402.11682","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":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2401.14846","paper":"/paper/understanding-domain-generalization-a-noise","title":"Understanding Domain Generalization: A Noise Robustness Perspective","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiaoruiyt/NoiseRobustDG","path":"domainbed/algorithms.py","file_url":"https://github.com/qiaoruiyt/NoiseRobustDG/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2310.10908","paper":"/paper/emergent-mixture-of-experts-can-dense-pre","title":"Unlocking Emergent Modularity in Large Language Models","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiuzh20/emoe","path":"Vision/domainbed/algorithms.py","file_url":"https://github.com/qiuzh20/emoe/blob/HEAD/Vision/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2309.12559","paper":"/paper/invariant-learning-via-probability-of-1","title":"Invariant Learning via Probability of Sufficient and Necessary Causes","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymy4323460/casn","path":"domainbed/algorithms.py","file_url":"https://github.com/ymy4323460/casn/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2309.05927","paper":"/paper/frequency-aware-masked-autoencoders-for","title":"Frequency-Aware Masked Autoencoders for Multimodal Pretraining on Biosignals","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2309.05516","paper":"/paper/optimize-weight-rounding-via-signed-gradient","title":"Optimize Weight Rounding via Signed Gradient Descent for the Quantization of LLMs","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intel/auto-round","path":"auto_round/algorithms/config_resolver.py","file_url":"https://github.com/intel/auto-round/blob/HEAD/auto_round/algorithms/config_resolver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8dc37cb8349ffb98","mcp_get_code":{"code_sha256":"8dc37cb8349ffb98"}},{"arxiv_id":"2308.04431","paper":"/paper/when-more-is-less-incorporating-additional","title":"When More is Less: Incorporating Additional Datasets Can Hurt Performance By Introducing Spurious Correlations","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basedrhys/ood-generalization","path":"clinicaldg/algorithms.py","file_url":"https://github.com/basedrhys/ood-generalization/blob/HEAD/clinicaldg/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2307.12502","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/ccfp","path":"algorithms.py","file_url":"https://github.com/hackmebroo/ccfp/blob/HEAD/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2307.08187","paper":"/paper/an-empirical-investigation-of-pre-trained-1","title":"An Empirical Study of Pre-trained Model Selection for Out-of-Distribution Generalization and Calibration","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiroki11x/timm_ood_calibration","path":"domainbed/algorithms.py","file_url":"https://github.com/hiroki11x/timm_ood_calibration/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2307.07542","paper":"/paper/source-free-domain-adaptation-with-temporal","title":"Source-Free Domain Adaptation with Temporal Imputation for Time Series Data","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohamedr002/mapu_sfda_ts","path":"algorithms/algorithms.py","file_url":"https://github.com/mohamedr002/mapu_sfda_ts/blob/HEAD/algorithms/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2306.08328","paper":"/paper/distribution-shift-inversion-for-out-of-1","title":"Distribution Shift Inversion for Out-of-Distribution Prediction","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/distribution-shift-iverson","path":"DSI/Predictor/domainbed_part/algorithms.py","file_url":"https://github.com/yu-rp/distribution-shift-iverson/blob/HEAD/DSI/Predictor/domainbed_part/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2305.01281","paper":"/paper/addressing-parameter-choice-issues-in","title":"Addressing Parameter Choice Issues in Unsupervised Domain Adaptation by Aggregation","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpitfire/iwa","path":"algorithms/algorithms.py","file_url":"https://github.com/xpitfire/iwa/blob/HEAD/algorithms/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2305.01134","paper":"/paper/pgrad-learning-principal-gradients-for-domain","title":"PGrad: Learning Principal Gradients For Domain Generalization","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qdata/pgrad","path":"domainbed/algorithms.py","file_url":"https://github.com/qdata/pgrad/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2303.15698","paper":"/paper/tfs-vit-token-level-feature-stylization-for","title":"TFS-ViT: Token-Level Feature Stylization for Domain Generalization","date":"2023-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mehrdad-noori/tfs-vit_token-level_feature_stylization","path":"domainbed/algorithms.py","file_url":"https://github.com/mehrdad-noori/tfs-vit_token-level_feature_stylization/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2302.13485","paper":"/paper/fedclip-fast-generalization-and","title":"FedCLIP: Fast Generalization and Personalization for CLIP in Federated Learning","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/personalizedfl","path":"alg/algs.py","file_url":"https://github.com/microsoft/personalizedfl/blob/HEAD/alg/algs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2302.12254","paper":"/paper/change-is-hard-a-closer-look-at-subpopulation","title":"Change is Hard: A Closer Look at Subpopulation Shift","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2302.03133","paper":"/paper/domain-adaptation-for-time-series-under","title":"Domain Adaptation for Time Series Under Feature and Label Shifts","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/Raincoat","path":"algorithms/algorithms.py","file_url":"https://github.com/mims-harvard/Raincoat/blob/HEAD/algorithms/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2302.00194","paper":"/paper/free-lunch-for-domain-adversarial-training-1","title":"Free Lunch for Domain Adversarial Training: Environment Label Smoothing","date":"2023-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2212.01555","paper":"/paper/cotmix-contrastive-domain-adaptation-for-time","title":"Contrastive Domain Adaptation for Time-Series via Temporal Mixup","date":"2022-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2211.08583","paper":"/paper/empirical-study-on-optimizer-selection-for","title":"Empirical Study on Optimizer Selection for Out-of-Distribution Generalization","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiroki11x/optimizer_comparison_ood","path":"domainbed/algorithms.py","file_url":"https://github.com/hiroki11x/optimizer_comparison_ood/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2210.06807","paper":"/paper/improving-out-of-distribution-generalization-1","title":"Improving Out-of-Distribution Generalization by Adversarial Training with Structured Priors","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2208.08914","paper":"/paper/prompt-vision-transformer-for-domain","title":"Prompt Vision Transformer for Domain Generalization","date":"2022-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengzangw/DoPrompt","path":"domainbed/algorithms.py","file_url":"https://github.com/zhengzangw/DoPrompt/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2207.10792","paper":"/paper/test-time-adaptation-via-self-training-with","title":"Test-Time Adaptation via Self-Training with Nearest Neighbor Information","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingukjang/tast","path":"domainbed/adapt_algorithms.py","file_url":"https://github.com/mingukjang/tast/blob/HEAD/domainbed/adapt_algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2206.05263","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":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2206.04046","paper":"/paper/sparse-fusion-mixture-of-experts-are-domain","title":"Sparse Mixture-of-Experts are Domain Generalizable Learners","date":"2022-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luodian/sf-moe-dg","path":"domainbed/algorithms.py","file_url":"https://github.com/luodian/sf-moe-dg/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2205.14546","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":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2205.13462","paper":"/paper/fedaug-reducing-the-local-learning-bias","title":"FedBR: Improving Federated Learning on Heterogeneous Data via Local Learning Bias Reduction","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/fedbr","path":"fedbr/algorithms.py","file_url":"https://github.com/lins-lab/fedbr/blob/HEAD/fedbr/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2205.09739","paper":"/paper/diverse-weight-averaging-for-out-of","title":"Diverse Weight Averaging for Out-of-Distribution Generalization","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexrame/diwa","path":"domainbed/algorithms.py","file_url":"https://github.com/alexrame/diwa/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2203.08321","paper":"/paper/adatime-a-benchmarking-suite-for-domain","title":"ADATIME: A Benchmarking Suite for Domain Adaptation on Time Series Data","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2111.12853","paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","title":"Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shogi880/DPLCLIP","path":"domainbed/adapt_algorithms.py","file_url":"https://github.com/shogi880/DPLCLIP/blob/HEAD/domainbed/adapt_algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2106.06607","paper":"/paper/invariance-principle-meets-information","title":"Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalization","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2106.03632","paper":"/paper/quantifying-and-improving-transferability-in","title":"Quantifying and Improving Transferability in Domain Generalization","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/domainbed","path":"domainbed/algorithms.py","file_url":"https://github.com/facebookresearch/domainbed/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2106.02266","paper":"/paper/sand-mask-an-enhanced-gradient-masking","title":"SAND-mask: An Enhanced Gradient Masking Strategy for the Discovery of Invariances in Domain Generalization","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahtalebi/SAND-mask","path":"domainbed/algorithms.py","file_url":"https://github.com/shahtalebi/SAND-mask/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2104.09841","paper":"/paper/selfreg-self-supervised-contrastive","title":"SelfReg: Self-supervised Contrastive Regularization for Domain Generalization","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dnap512/SelfReg","path":"domainbed_code/algorithms.py","file_url":"https://github.com/dnap512/SelfReg/blob/HEAD/domainbed_code/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2007.02931","paper":"/paper/adaptive-risk-minimization-a-meta-learning","title":"Adaptive Risk Minimization: Learning to Adapt to Domain Shift","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"2007.01434","paper":"/paper/in-search-of-lost-domain-generalization","title":"In Search of Lost Domain Generalization","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"1907.02893","paper":"/paper/invariant-risk-minimization","title":"Invariant Risk Minimization","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"katoro8989/irm_variants_calibration","path":"domainbed/algorithms.py","file_url":"https://github.com/katoro8989/irm_variants_calibration/blob/HEAD/domainbed/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b0bc80b1655a6802","mcp_get_code":{"code_sha256":"b0bc80b1655a6802"}},{"arxiv_id":"aaai_28994","paper":null,"title":"arXiv:aaai_28994","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Alrash/EDM","path":"src/DeepDG/alg/alg.py","file_url":"https://github.com/Alrash/EDM/blob/HEAD/src/DeepDG/alg/alg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2676a45c41ebada6","mcp_get_code":{"code_sha256":"2676a45c41ebada6"}}]}