{"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":"/sota/domain-generalization-on-vlcs","task":{"name":"Domain Generalization","url":"/task/domain-generalization","note":null},"dataset":{"name":"VLCS","url":"/dataset/vlcs"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"The idea of **Domain Generalization** is to learn from one or multiple training domains, to extract a domain-agnostic model which can be applied to an unseen domain\n\n\n<span class=\"description-source\">Source: [Diagram Image Retrieval using Sketch-Based Deep Learning and Transfer Learning ](https://arxiv.org/abs/2004.10780)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Average Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"Average Accuracy":"higher"}},"counts":{"rows":37,"rows_with_code":33,"rows_with_paper_page":37,"rows_dated":37,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"CAR-FT (CLIP, ViT-B/16)","metrics":{"Average Accuracy":"85.5"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/context-aware-robust-fine-tuning","paper_url":"https://arxiv.org/abs/2211.16175v1","paper_title":"Context-Aware Robust Fine-Tuning","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":2,"model":"UniDG + CORAL + ConvNeXt-B","metrics":{"Average Accuracy":"84.5"},"uses_additional_data":false,"paper_date":"2023-10-16","paper":"/paper/towards-unified-and-effective-domain","paper_url":"https://arxiv.org/abs/2310.10008v1","paper_title":"Towards Unified and Effective Domain Generalization","code":"https://github.com/invictus717/UniDG","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":3,"model":"SPG (CLIP, ResNet-50)","metrics":{"Average Accuracy":"84.0"},"uses_additional_data":false,"paper_date":"2024-04-30","paper":"/paper/soft-prompt-generation-for-domain","paper_url":"https://arxiv.org/abs/2404.19286v2","paper_title":"Soft Prompt Generation for Domain Generalization","code":"https://github.com/renytek13/soft-prompt-generation-with-cgan","n_code_links":1,"official":{"repos":["renytek13/soft-prompt-generation-with-cgan"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":3,"n_samples":9,"n_pointer_only_licence":2,"sample_list":"/paper/soft-prompt-generation-for-domain#ran","syntology_url":"https://syntology.ai/paper/2404.19286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19286"}}}},{"rank_in_archive_order":4,"model":"VL2V-SD (CLIP, ViT-B/16)","metrics":{"Average Accuracy":"83.25"},"uses_additional_data":false,"paper_date":"2023-10-12","paper":"/paper/distilling-from-vision-language-models-for","paper_url":"https://arxiv.org/abs/2310.08255v2","paper_title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","code":"https://github.com/val-iisc/VL2V-ADiP","n_code_links":1,"official":{"repos":["val-iisc/VL2V-ADiP"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_samples":15,"n_pointer_only_licence":2,"sample_list":"/paper/distilling-from-vision-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2310.08255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08255"}}}},{"rank_in_archive_order":5,"model":"MoA (OpenCLIP, ViT-B/16)","metrics":{"Average Accuracy":"83.1"},"uses_additional_data":false,"paper_date":"2023-10-17","paper":"/paper/domain-generalization-using-large-pretrained","paper_url":"https://arxiv.org/abs/2310.11031v2","paper_title":"Domain Generalization Using Large Pretrained Models with Mixture-of-Adapters","code":"https://github.com/KU-CVLAB/MoA","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":6,"model":"D-Triplet(RegNetY-16GF)","metrics":{"Average Accuracy":"82.9"},"uses_additional_data":false,"paper_date":"2023-03-01","paper":"/paper/domain-aware-triplet-loss-in-domain","paper_url":"https://arxiv.org/abs/2303.01233v1","paper_title":"Domain-aware Triplet loss in Domain Generalization","code":"https://github.com/workerbcd/dct","n_code_links":1,"official":{"repos":["workerbcd/dct"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_samples":12,"n_pointer_only_licence":1,"sample_list":"/paper/domain-aware-triplet-loss-in-domain#ran","syntology_url":"https://syntology.ai/paper/2303.01233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.01233"}}}},{"rank_in_archive_order":7,"model":"PromptStyler (CLIP, ViT-B/16)","metrics":{"Average Accuracy":"82.9"},"uses_additional_data":false,"paper_date":"2023-07-27","paper":"/paper/promptstyler-prompt-driven-style-generation","paper_url":"https://arxiv.org/abs/2307.15199v2","paper_title":"PromptStyler: Prompt-driven Style Generation for Source-free Domain Generalization","code":"https://github.com/zhanghr2001/promptta","n_code_links":1,"official":null,"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/promptstyler-prompt-driven-style-generation#ran","syntology_url":"https://syntology.ai/paper/2307.15199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15199"}}}},{"rank_in_archive_order":8,"model":"SIMPLE+","metrics":{"Average Accuracy":"82.7"},"uses_additional_data":false,"paper_date":"2023-05-01","paper":"/paper/simple-specialized-model-sample-matching-for","paper_url":"https://openreview.net/forum?id=BqrPeZ_e5P","paper_title":"SIMPLE: Specialized Model-Sample Matching for Domain Generalization","code":"https://github.com/microsoft/SeqML/tree/main/SIMPLE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":9,"model":"PromptStyler (CLIP, ViT-L/14)","metrics":{"Average Accuracy":"82.4"},"uses_additional_data":false,"paper_date":"2023-07-27","paper":"/paper/promptstyler-prompt-driven-style-generation","paper_url":"https://arxiv.org/abs/2307.15199v2","paper_title":"PromptStyler: Prompt-driven Style Generation for Source-free Domain Generalization","code":"https://github.com/zhanghr2001/promptta","n_code_links":1,"official":null,"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/promptstyler-prompt-driven-style-generation#ran","syntology_url":"https://syntology.ai/paper/2307.15199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15199"}}}},{"rank_in_archive_order":10,"model":"GMDG (RegNetY-16GF)","metrics":{"Average Accuracy":"82.4"},"uses_additional_data":false,"paper_date":"2024-02-29","paper":"/paper/rethinking-multi-domain-generalization-with-a","paper_url":"https://arxiv.org/abs/2402.18853v2","paper_title":"Rethinking Multi-domain Generalization with A General Learning Objective","code":"https://github.com/zhaorui-tan/gmdg","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"SPG (CLIP, ViT-B/16)","metrics":{"Average Accuracy":"82.4"},"uses_additional_data":false,"paper_date":"2024-04-30","paper":"/paper/soft-prompt-generation-for-domain","paper_url":"https://arxiv.org/abs/2404.19286v2","paper_title":"Soft Prompt Generation for Domain Generalization","code":"https://github.com/renytek13/soft-prompt-generation-with-cgan","n_code_links":1,"official":{"repos":["renytek13/soft-prompt-generation-with-cgan"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":3,"n_samples":9,"n_pointer_only_licence":2,"sample_list":"/paper/soft-prompt-generation-for-domain#ran","syntology_url":"https://syntology.ai/paper/2404.19286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19286"}}}},{"rank_in_archive_order":12,"model":"PromptStyler (CLIP, ResNet-50)","metrics":{"Average Accuracy":"82.3"},"uses_additional_data":false,"paper_date":"2023-07-27","paper":"/paper/promptstyler-prompt-driven-style-generation","paper_url":"https://arxiv.org/abs/2307.15199v2","paper_title":"PromptStyler: Prompt-driven Style Generation for Source-free Domain Generalization","code":"https://github.com/zhanghr2001/promptta","n_code_links":1,"official":null,"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/promptstyler-prompt-driven-style-generation#ran","syntology_url":"https://syntology.ai/paper/2307.15199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15199"}}}},{"rank_in_archive_order":13,"model":"SEDGE+","metrics":{"Average Accuracy":"82.2"},"uses_additional_data":false,"paper_date":"2022-03-09","paper":"/paper/domain-generalization-using-pretrained-models","paper_url":"https://arxiv.org/abs/2203.04600v1","paper_title":"Domain Generalization using Pretrained Models without Fine-tuning","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"CADG","metrics":{"Average Accuracy":"82.2"},"uses_additional_data":false,"paper_date":"2022-03-31","paper":"/paper/cadg-a-model-based-on-cross-attention-for","paper_url":"https://arxiv.org/abs/2203.17067v3","paper_title":"CADG: A Model Based on Cross Attention for Domain Generalization","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":15,"model":"GMDG (RegNetY-16GF, SWAD)","metrics":{"Average Accuracy":"82.2"},"uses_additional_data":false,"paper_date":"2024-02-29","paper":"/paper/rethinking-multi-domain-generalization-with-a","paper_url":"https://arxiv.org/abs/2402.18853v2","paper_title":"Rethinking Multi-domain Generalization with A General Learning Objective","code":"https://github.com/zhaorui-tan/gmdg","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":16,"model":"MIRO (RegNetY-16GF, SWAD)","metrics":{"Average Accuracy":"81.7"},"uses_additional_data":false,"paper_date":"2022-03-21","paper":"/paper/domain-generalization-by-mutual-information","paper_url":"https://arxiv.org/abs/2203.10789v2","paper_title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","code":"https://github.com/kakaobrain/miro","n_code_links":1,"official":{"repos":["kakaobrain/miro"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":2,"n_samples":13,"n_pointer_only_licence":3,"sample_list":"/paper/domain-generalization-by-mutual-information#ran","syntology_url":"https://syntology.ai/paper/2203.10789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10789"}}}},{"rank_in_archive_order":17,"model":"Ensemble of Averages (RegNetY-16GF)","metrics":{"Average Accuracy":"81.1"},"uses_additional_data":false,"paper_date":"2021-10-21","paper":"/paper/ensemble-of-averages-improving-model","paper_url":"https://arxiv.org/abs/2110.10832v4","paper_title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","code":"https://github.com/salesforce/ensemble-of-averages","n_code_links":1,"official":{"repos":["salesforce/ensemble-of-averages"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/ensemble-of-averages-improving-model#ran","syntology_url":"https://syntology.ai/paper/2110.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10832"}}}},{"rank_in_archive_order":18,"model":"Ensemble of Averages (ResNeXt-50 32x4d)","metrics":{"Average Accuracy":"80.4"},"uses_additional_data":false,"paper_date":"2021-10-21","paper":"/paper/ensemble-of-averages-improving-model","paper_url":"https://arxiv.org/abs/2110.10832v4","paper_title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","code":"https://github.com/salesforce/ensemble-of-averages","n_code_links":1,"official":{"repos":["salesforce/ensemble-of-averages"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/ensemble-of-averages-improving-model#ran","syntology_url":"https://syntology.ai/paper/2110.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10832"}}}},{"rank_in_archive_order":19,"model":"GMoE-S/16","metrics":{"Average Accuracy":"80.2"},"uses_additional_data":false,"paper_date":"2022-06-08","paper":"/paper/sparse-fusion-mixture-of-experts-are-domain","paper_url":"https://arxiv.org/abs/2206.04046v6","paper_title":"Sparse Mixture-of-Experts are Domain Generalizable Learners","code":"https://github.com/luodian/sf-moe-dg","n_code_links":2,"official":{"repos":["luodian/sf-moe-dg"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":5,"n_samples":14,"n_pointer_only_licence":14,"sample_list":"/paper/sparse-fusion-mixture-of-experts-are-domain#ran","syntology_url":"https://syntology.ai/paper/2206.04046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04046"}}}},{"rank_in_archive_order":20,"model":"SIMPLE","metrics":{"Average Accuracy":"79.9"},"uses_additional_data":false,"paper_date":"2023-05-01","paper":"/paper/simple-specialized-model-sample-matching-for","paper_url":"https://openreview.net/forum?id=BqrPeZ_e5P","paper_title":"SIMPLE: Specialized Model-Sample Matching for Domain Generalization","code":"https://github.com/microsoft/SeqML/tree/main/SIMPLE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":21,"model":"SEDGE","metrics":{"Average Accuracy":"79.8"},"uses_additional_data":false,"paper_date":"2022-03-09","paper":"/paper/domain-generalization-using-pretrained-models","paper_url":"https://arxiv.org/abs/2203.04600v1","paper_title":"Domain Generalization using Pretrained Models without Fine-tuning","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":22,"model":"VNE (ResNet-50, SWAD)","metrics":{"Average Accuracy":"79.7"},"uses_additional_data":false,"paper_date":"2023-04-04","paper":"/paper/vne-an-effective-method-for-improving-deep","paper_url":"https://arxiv.org/abs/2304.01434v1","paper_title":"VNE: An Effective Method for Improving Deep Representation by Manipulating Eigenvalue Distribution","code":"https://github.com/jaeill/CVPR23-VNE","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":23,"model":"AdaClust (ResNet-50, SWAD)","metrics":{"Average Accuracy":"79.6"},"uses_additional_data":false,"paper_date":"2021-12-09","paper":"/paper/adaptive-methods-for-aggregated-domain","paper_url":"https://arxiv.org/abs/2112.04766v2","paper_title":"Adaptive Methods for Aggregated Domain Generalization","code":"https://github.com/xavierohan/AdaClust_DomainBed","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":24,"model":"MIRO (ResNet-50, SWAD)","metrics":{"Average Accuracy":"79.6"},"uses_additional_data":false,"paper_date":"2022-03-21","paper":"/paper/domain-generalization-by-mutual-information","paper_url":"https://arxiv.org/abs/2203.10789v2","paper_title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","code":"https://github.com/kakaobrain/miro","n_code_links":1,"official":{"repos":["kakaobrain/miro"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]},"syntology":{"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":2,"n_samples":13,"n_pointer_only_licence":3,"sample_list":"/paper/domain-generalization-by-mutual-information#ran","syntology_url":"https://syntology.ai/paper/2203.10789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10789"}}}},{"rank_in_archive_order":25,"model":"GMDG (ResNet-50, SWAD)","metrics":{"Average Accuracy":"79.6"},"uses_additional_data":false,"paper_date":"2024-02-29","paper":"/paper/rethinking-multi-domain-generalization-with-a","paper_url":"https://arxiv.org/abs/2402.18853v2","paper_title":"Rethinking Multi-domain Generalization with A General Learning Objective","code":"https://github.com/zhaorui-tan/gmdg","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":26,"model":"D-Triplet(Resnet-50)","metrics":{"Average Accuracy":"79.3"},"uses_additional_data":false,"paper_date":"2023-03-01","paper":"/paper/domain-aware-triplet-loss-in-domain","paper_url":"https://arxiv.org/abs/2303.01233v1","paper_title":"Domain-aware Triplet loss in Domain Generalization","code":"https://github.com/workerbcd/dct","n_code_links":1,"official":{"repos":["workerbcd/dct"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_samples":12,"n_pointer_only_licence":1,"sample_list":"/paper/domain-aware-triplet-loss-in-domain#ran","syntology_url":"https://syntology.ai/paper/2303.01233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.01233"}}}},{"rank_in_archive_order":27,"model":"POEM","metrics":{"Average Accuracy":"79.2"},"uses_additional_data":false,"paper_date":"2023-05-22","paper":"/paper/poem-polarization-of-embeddings-for-domain","paper_url":"https://arxiv.org/abs/2305.13046v1","paper_title":"POEM: Polarization of Embeddings for Domain-Invariant Representations","code":"https://github.com/josangyoung/official-poem","n_code_links":1,"official":{"repos":["josangyoung/official-poem"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_samples":12,"n_pointer_only_licence":2,"sample_list":"/paper/poem-polarization-of-embeddings-for-domain#ran","syntology_url":"https://syntology.ai/paper/2305.13046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13046"}}}},{"rank_in_archive_order":28,"model":"GMDG (ResNet-50)","metrics":{"Average Accuracy":"79.2"},"uses_additional_data":false,"paper_date":"2024-02-29","paper":"/paper/rethinking-multi-domain-generalization-with-a","paper_url":"https://arxiv.org/abs/2402.18853v2","paper_title":"Rethinking Multi-domain Generalization with A General Learning Objective","code":"https://github.com/zhaorui-tan/gmdg","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":29,"model":"SWAD (ResNet-50)","metrics":{"Average Accuracy":"79.1"},"uses_additional_data":false,"paper_date":"2021-02-17","paper":"/paper/domain-generalization-needs-stochastic-weight","paper_url":"https://arxiv.org/abs/2102.08604v4","paper_title":"SWAD: Domain Generalization by Seeking Flat Minima","code":"https://github.com/khanrc/swad","n_code_links":4,"official":{"repos":["khanrc/swad"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0,"sample_list":"/paper/domain-generalization-needs-stochastic-weight#ran","syntology_url":"https://syntology.ai/paper/2102.08604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08604"}}}},{"rank_in_archive_order":30,"model":"Ensemble of Averages (ResNet-50)","metrics":{"Average Accuracy":"79.1"},"uses_additional_data":false,"paper_date":"2021-10-21","paper":"/paper/ensemble-of-averages-improving-model","paper_url":"https://arxiv.org/abs/2110.10832v4","paper_title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","code":"https://github.com/salesforce/ensemble-of-averages","n_code_links":1,"official":{"repos":["salesforce/ensemble-of-averages"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/ensemble-of-averages-improving-model#ran","syntology_url":"https://syntology.ai/paper/2110.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10832"}}}},{"rank_in_archive_order":31,"model":"DREAME","metrics":{"Average Accuracy":"79.02"},"uses_additional_data":false,"paper_date":"2021-12-17","paper":"/paper/improving-multi-domain-generalization-through","paper_url":"https://arxiv.org/abs/2112.09802v3","paper_title":"Automated Domain Discovery from Multiple Sources to Improve Zero-Shot Generalization","code":"https://github.com/kowshikthopalli/DREAME","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":32,"model":"AdaClust (ResNet-50)","metrics":{"Average Accuracy":"78.9"},"uses_additional_data":false,"paper_date":"2021-12-09","paper":"/paper/adaptive-methods-for-aggregated-domain","paper_url":"https://arxiv.org/abs/2112.04766v2","paper_title":"Adaptive Methods for Aggregated Domain Generalization","code":"https://github.com/xavierohan/AdaClust_DomainBed","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"DADG (ResNet-18)","metrics":{"Average Accuracy":"78.21"},"uses_additional_data":false,"paper_date":"2020-11-01","paper":"/paper/discriminative-adversarial-domain","paper_url":"https://arxiv.org/abs/2011.00444v2","paper_title":"Discriminative Adversarial Domain Generalization with Meta-learning based Cross-domain Validation","code":"https://github.com/Epi-NMT/DADG","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":34,"model":"Fishr (ResNet-50)","metrics":{"Average Accuracy":"78.2"},"uses_additional_data":false,"paper_date":"2021-09-07","paper":"/paper/fishr-invariant-gradient-variances-for-out-of","paper_url":"https://arxiv.org/abs/2109.02934v3","paper_title":"Fishr: Invariant Gradient Variances for Out-of-Distribution Generalization","code":"https://github.com/facebookresearch/DomainBed","n_code_links":2,"official":{"repos":["alexrame/fishr","facebookresearch/DomainBed"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/fishr-invariant-gradient-variances-for-out-of#ran","syntology_url":"https://syntology.ai/paper/2109.02934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.02934"}}}},{"rank_in_archive_order":35,"model":"StableNet (ResNet-18)","metrics":{"Average Accuracy":"77.65"},"uses_additional_data":false,"paper_date":"2021-04-16","paper":"/paper/deep-stable-learning-for-out-of-distribution","paper_url":"https://arxiv.org/abs/2104.07876v1","paper_title":"Deep Stable Learning for Out-Of-Distribution Generalization","code":"https://github.com/xxgege/StableNet","n_code_links":2,"official":{"repos":["xxgege/StableNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_samples":8,"n_pointer_only_licence":0,"sample_list":"/paper/deep-stable-learning-for-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2104.07876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07876"}}}},{"rank_in_archive_order":36,"model":"RSC (AlexNet)","metrics":{"Average Accuracy":"75.43"},"uses_additional_data":false,"paper_date":"2020-07-05","paper":"/paper/self-challenging-improves-cross-domain","paper_url":"https://arxiv.org/abs/2007.02454v1","paper_title":"Self-Challenging Improves Cross-Domain Generalization","code":"https://github.com/facebookresearch/DomainBed","n_code_links":8,"official":null,"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":1,"sample_list":"/paper/self-challenging-improves-cross-domain#ran","syntology_url":"https://syntology.ai/paper/2007.02454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02454"}}}},{"rank_in_archive_order":37,"model":"DADG (AlexNet)","metrics":{"Average Accuracy":"74.46"},"uses_additional_data":false,"paper_date":"2020-11-01","paper":"/paper/discriminative-adversarial-domain","paper_url":"https://arxiv.org/abs/2011.00444v2","paper_title":"Discriminative Adversarial Domain Generalization with Meta-learning based Cross-domain Validation","code":"https://github.com/Epi-NMT/DADG","n_code_links":3,"official":null,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 1 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,596 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and 1 proposed a result, which gave no cell that passed the extractor's own checks; none await a verdict and none were placed.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":37,"metric_columns":1,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1596,"candidates":1,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":1,"no_cell_passed_checks":1,"rejected_by_independent_check":0,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; 1 newer paper judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables Claude Sonnet 4.5 judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"a_record_without_a_model":false,"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":1,"shown_on_page":1,"no_cell_split":{"no_cell_passed_checks_in_ledger":1,"rows_refused_by_rule":1,"rows_no_cell_passed_checks":0},"rows":[{"arxiv_id":"2601.21999","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"}]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","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)"},"rows_with_graph_line":19,"rows_with_any_sample_ran":19,"rows_with_a_run_with_no_instrument_failure":10,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":15,"rows_whose_official_repository_has_a_sample_that_ran":14,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":8,"rows_community_repositories_only":1,"rows_runs_from_other_or_unrecorded_repositories":0,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","distinct_papers_with_graph_line":12,"distinct_papers_with_any_sample_ran":12,"distinct_papers_with_a_run_with_no_instrument_failure":8,"samples_over_distinct_papers":{"n_ran":74,"n_constructed":2,"n_ran_checked":45,"n_instrument":29,"n_unverified":23,"n_samples":97,"n_pointer_only_licence":28,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":106,"n_constructed":2,"n_ran_checked":58,"n_instrument":48,"n_unverified":31,"n_samples":137,"n_pointer_only_licence":38,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"9e5459dcdd9c4cbee9afd1cdd61b5595d13299eb6fdf24d404f8d3a9009b3306","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}