{"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":"/dataset/office-home","name":"Office-Home","full_name":null,"description_markdown":"**Office-Home** is a benchmark dataset for domain adaptation which contains 4 domains where each domain consists of 65 categories. The four domains are: Art – artistic images in the form of sketches, paintings, ornamentation, etc.; Clipart – collection of clipart images; Product – images of objects without a background and Real-World – images of objects captured with a regular camera. It contains 15,500 images, with an average of around 70 images per class and a maximum of 99 images in a class.\r\n\r\nSource: [Multi-component Image Translation for Deep Domain Generalization](https://arxiv.org/abs/1812.08974)\r\n\r\nImage Source: [Wen et al](https://www.researchgate.net/publication/329023199_Exploiting_Local_Feature_Patterns_for_Unsupervised_Domain_Adaptation)","description_withheld":null,"homepage":"https://www.hemanthdv.org/officeHomeDataset.html","introduced_date":"2017-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/deep-hashing-network-for-unsupervised-domain","title":"Deep Hashing Network for Unsupervised Domain Adaptation","first_author":"Hemanth Venkateswara","url":null},"license":{"name":"Custom (non-commercial research and educational purposes)","url":"https://www.hemanthdv.org/officeHomeDataset.html"},"modalities":[{"name":"Images","url":"/datasets/modality/images"}],"tasks":[{"name":"Domain Adaptation","url":"/task/domain-adaptation","datasets_with_task":"/datasets/task/domain-adaptation"},{"name":"Unsupervised Domain Adaptation","url":"/task/unsupervised-domain-adaptation","datasets_with_task":"/datasets/task/unsupervised-domain-adaptation"},{"name":"Domain Generalization","url":"/task/domain-generalization","datasets_with_task":"/datasets/task/domain-generalization"},{"name":"Transfer Learning","url":"/task/transfer-learning","datasets_with_task":"/datasets/task/transfer-learning"},{"name":"Multi-Source Unsupervised Domain Adaptation","url":"/task/multi-source-unsupervised-domain-adaptation","datasets_with_task":"/datasets/task/multi-source-unsupervised-domain-adaptation"},{"name":"Partial Domain Adaptation","url":"/task/partial-domain-adaptation","datasets_with_task":"/datasets/task/partial-domain-adaptation"},{"name":"Universal Domain Adaptation","url":"/task/universal-domain-adaptation","datasets_with_task":"/datasets/task/universal-domain-adaptation"},{"name":"Multi-target Domain Adaptation","url":"/task/multi-target-domain-adaptation","datasets_with_task":"/datasets/task/multi-target-domain-adaptation"},{"name":"Blended-target Domain Adaptation","url":"/task/blended-target-domain-adaptation","datasets_with_task":"/datasets/task/blended-target-domain-adaptation"},{"name":"Open-Set Multi-Target Domain Adaptation","url":"/task/open-set-multi-target-domain-adaptation","datasets_with_task":"/datasets/task/open-set-multi-target-domain-adaptation"},{"name":"cross-domain few-shot learning","url":"/task/cross-domain-few-shot-learning","datasets_with_task":"/datasets/task/cross-domain-few-shot-learning"}],"languages":[],"variants":["Office-Home","Office-Home (RS-UT imbalance)"],"data_loaders":[{"repo":"https://github.com/activeloopai/Hub","url":"https://docs.activeloop.ai/datasets/office-home-dataset","frameworks":["tf","pytorch"]}],"num_papers_in_archive":1074,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/domain-generalization-on-office-home","task":"Domain Generalization","dataset_variant":"Office-Home","rows":45,"metrics":["Average Accuracy"],"first_row_in_archive_order":{"model":"MoA (OpenCLIP, ViT-B/16)","paper":"/paper/domain-generalization-using-large-pretrained","metrics":{"Average Accuracy":"90.6"},"code_links":[{"title":"KU-CVLAB/MoA","url":"https://github.com/KU-CVLAB/MoA"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/domain-adaptation-on-office-home","task":"Domain Adaptation","dataset_variant":"Office-Home","rows":29,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SWG","paper":"/paper/combining-inherent-knowledge-of-vision","metrics":{"Accuracy":"92.3"},"code_links":[{"title":"ThomasWestfechtel/SWG","url":"https://github.com/ThomasWestfechtel/SWG"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-office-home","task":"Unsupervised Domain Adaptation","dataset_variant":"Office-Home","rows":20,"metrics":["Accuracy","Avg accuracy","Average Accuracy"],"first_row_in_archive_order":{"model":"FFTAT","paper":"/paper/feature-fusion-transferability-aware","metrics":{"Accuracy":"91.4"},"code_links":[{"title":"Shawey94/NoisyNN","url":"https://github.com/Shawey94/NoisyNN"},{"title":"Shawey94/WACV2025-FFTAT","url":"https://github.com/Shawey94/WACV2025-FFTAT"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/universal-domain-adaptation-on-office-home","task":"Universal Domain Adaptation","dataset_variant":"Office-Home","rows":14,"metrics":["H-Score","Source-free","VLM"],"first_row_in_archive_order":{"model":"TASC","paper":"/paper/target-semantics-clustering-via-text-1","metrics":{"H-Score":"89.44","Source-free":"no","VLM":"yes"},"code_links":[{"title":"Sapphire-356/TASC","url":"https://github.com/Sapphire-356/TASC"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/partial-domain-adaptation-on-office-home","task":"Partial Domain Adaptation","dataset_variant":"Office-Home","rows":11,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"EvoADA","paper":"/paper/on-evolving-attention-towards-domain","metrics":{"Accuracy (%)":"80.2"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/transfer-learning-on-office-home","task":"Transfer Learning","dataset_variant":"Office-Home","rows":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"APCLIP","paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","metrics":{"Accuracy":"84.2"},"code_links":[{"title":"shogi880/DPLCLIP","url":"https://github.com/shogi880/DPLCLIP"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-office-home-1","task":"Unsupervised Domain Adaptation","dataset_variant":"Office-Home (RS-UT imbalance)","rows":5,"metrics":["Average Per-Class Accuracy"],"first_row_in_archive_order":{"model":"Implicit Alignment (with MDD)","paper":"/paper/implicit-class-conditioned-domain-alignment","metrics":{"Average Per-Class Accuracy":"61.67"},"code_links":[{"title":"xiangdal/implicit_alignment","url":"https://github.com/xiangdal/implicit_alignment"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/multi-target-domain-adaptation-on-office-home","task":"Multi-target Domain Adaptation","dataset_variant":"Office-Home","rows":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MCDA","paper":"/paper/class-overwhelms-mutual-conditional-blended","metrics":{"Accuracy":"71.1"},"code_links":[{"title":"Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation","url":"https://github.com/Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/blended-target-domain-adaptation-on-office","task":"Blended-target Domain Adaptation","dataset_variant":"Office-Home","rows":2,"metrics":["Average Accuracy"],"first_row_in_archive_order":{"model":"MCDA","paper":"/paper/class-overwhelms-mutual-conditional-blended","metrics":{"Average Accuracy":"71.1"},"code_links":[{"title":"Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation","url":"https://github.com/Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/cross-domain-few-shot-learning-on-office-home","task":"cross-domain few-shot learning","dataset_variant":"Office-Home","rows":1,"metrics":["AUROC"],"first_row_in_archive_order":{"model":"DAFOSNET","paper":"/paper/domain-adaptive-few-shot-open-set-learning","metrics":{"AUROC":"54.44±0.29"},"code_links":[{"title":"debabratapal7/dafosnet","url":"https://github.com/debabratapal7/dafosnet"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/open-set-multi-target-domain-adaptation-on-1","task":"Open-Set Multi-Target Domain Adaptation","dataset_variant":"Office-Home","rows":1,"metrics":["H-Score"],"first_row_in_archive_order":{"model":"COSMo","paper":"/paper/cosmo-clip-talks-on-open-set-multi-target-1","metrics":{"H-Score":"83.04"},"code_links":[{"title":"munish30monga/COSMo","url":"https://github.com/munish30monga/COSMo"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":106,"counts":{"papers_with_a_benchmark_row":106,"with_a_code_link":91,"where_syntology_ran_a_sample":36,"not_listed_spam_title":0,"listed":106,"listed_where_code_ran":36,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":27,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":27,"listed_every_run_a_failure_of_syntologys_instrument":9,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/target-semantics-clustering-via-text-1","slug":"target-semantics-clustering-via-text-1","title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","date":"2025-06-04","arxiv_id":"2506.03521","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["Sapphire-356/TASC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/target-semantics-clustering-via-text-1#ran","syntology_url":"https://syntology.ai/paper/2506.03521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03521"}}}},{"paper":"/paper/transadapter-vision-transformer-for-feature","slug":"transadapter-vision-transformer-for-feature","title":"TransAdapter: Vision Transformer for Feature-Centric Unsupervised Domain Adaptation","date":"2024-12-05","arxiv_id":"2412.04073","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/feature-fusion-transferability-aware","slug":"feature-fusion-transferability-aware","title":"Feature Fusion Transferability Aware Transformer for Unsupervised Domain Adaptation","date":"2024-11-10","arxiv_id":"2411.07794","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/cosmo-clip-talks-on-open-set-multi-target-1","slug":"cosmo-clip-talks-on-open-set-multi-target-1","title":"COSMo: CLIP Talks on Open-Set Multi-Target Domain Adaptation","date":"2024-08-31","arxiv_id":"2409.00397","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/euda-an-efficient-unsupervised-domain","slug":"euda-an-efficient-unsupervised-domain","title":"EUDA: An Efficient Unsupervised Domain Adaptation via Self-Supervised Vision Transformer","date":"2024-07-31","arxiv_id":"2407.21311","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/enhancing-domain-adaptation-through-prompt","slug":"enhancing-domain-adaptation-through-prompt","title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","date":"2024-06-13","arxiv_id":"2406.09353","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":12,"official":{"repos":["viethoang1512/pga"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/enhancing-domain-adaptation-through-prompt#ran","syntology_url":"https://syntology.ai/paper/2406.09353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09353"}}}},{"paper":"/paper/proxy-denoising-for-source-free-domain","slug":"proxy-denoising-for-source-free-domain","title":"Proxy Denoising for Source-Free Domain Adaptation","date":"2024-06-03","arxiv_id":"2406.01658","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["tntek/source-free-domain-adaptation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proxy-denoising-for-source-free-domain#ran","syntology_url":"https://syntology.ai/paper/2406.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01658"}}}},{"paper":"/paper/empowering-source-free-domain-adaptation-with","slug":"empowering-source-free-domain-adaptation-with","title":"Empowering Source-Free Domain Adaptation with MLLM-driven Curriculum Learning","date":"2024-05-28","arxiv_id":"2405.18376","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/soft-prompt-generation-for-domain","slug":"soft-prompt-generation-for-domain","title":"Soft Prompt Generation for Domain Generalization","date":"2024-04-30","arxiv_id":"2404.19286","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":6,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/unsupervised-domain-adaption-harnessing","slug":"unsupervised-domain-adaption-harnessing","title":"Unsupervised Domain Adaption Harnessing Vision-Language Pre-training","date":"2024-04-19","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-cnn-on-vit-a-hybrid-model-to","slug":"learning-cnn-on-vit-a-hybrid-model-to","title":"Learning CNN on ViT: A Hybrid Model to Explicitly Class-specific Boundaries for Domain Adaptation","date":"2024-03-27","arxiv_id":"2403.18360","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/lead-learning-decomposition-for-source-free","slug":"lead-learning-decomposition-for-source-free","title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","date":"2024-03-06","arxiv_id":"2403.03421","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":8,"samples_unverified":2,"pointer_only_for_licence":9,"official":{"repos":["ispc-lab/lead"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lead-learning-decomposition-for-source-free#ran","syntology_url":"https://syntology.ai/paper/2403.03421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03421"}}}},{"paper":"/paper/rethinking-multi-domain-generalization-with-a","slug":"rethinking-multi-domain-generalization-with-a","title":"Rethinking Multi-domain Generalization with A General Learning Objective","date":"2024-02-29","arxiv_id":"2402.18853","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/prompt-based-distribution-alignment-for","slug":"prompt-based-distribution-alignment-for","title":"Prompt-based Distribution Alignment for Unsupervised Domain Adaptation","date":"2023-12-15","arxiv_id":"2312.09553","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["baishuanghao/prompt-based-distribution-alignment"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/prompt-based-distribution-alignment-for#ran","syntology_url":"https://syntology.ai/paper/2312.09553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.09553"}}}},{"paper":"/paper/mlnet-mutual-learning-network-with","slug":"mlnet-mutual-learning-network-with","title":"MLNet: Mutual Learning Network with Neighborhood Invariance for Universal Domain Adaptation","date":"2023-12-13","arxiv_id":"2312.07871","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["YanzuoLu/MLNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mlnet-mutual-learning-network-with#ran","syntology_url":"https://syntology.ai/paper/2312.07871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.07871"}}}},{"paper":"/paper/combining-inherent-knowledge-of-vision","slug":"combining-inherent-knowledge-of-vision","title":"Combining inherent knowledge of vision-language models with unsupervised domain adaptation through strong-weak guidance","date":"2023-12-07","arxiv_id":"2312.04066","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gradual-source-domain-expansion-for","slug":"gradual-source-domain-expansion-for","title":"Gradual Source Domain Expansion for Unsupervised Domain Adaptation","date":"2023-11-16","arxiv_id":"2311.09599","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-generalization-using-large-pretrained","slug":"domain-generalization-using-large-pretrained","title":"Domain Generalization Using Large Pretrained Models with Mixture-of-Adapters","date":"2023-10-17","arxiv_id":"2310.11031","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-unified-and-effective-domain","slug":"towards-unified-and-effective-domain","title":"Towards Unified and Effective Domain Generalization","date":"2023-10-16","arxiv_id":"2310.10008","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distilling-from-vision-language-models-for","slug":"distilling-from-vision-language-models-for","title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","date":"2023-10-12","arxiv_id":"2310.08255","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/domain-adaptive-few-shot-open-set-learning","slug":"domain-adaptive-few-shot-open-set-learning","title":"Domain Adaptive Few-Shot Open-Set Learning","date":"2023-09-22","arxiv_id":"2309.12814","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/weight-averaging-improves-knowledge","slug":"weight-averaging-improves-knowledge","title":"Weight Averaging Improves Knowledge Distillation under Domain Shift","date":"2023-09-20","arxiv_id":"2309.11446","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/promptstyler-prompt-driven-style-generation","slug":"promptstyler-prompt-driven-style-generation","title":"PromptStyler: Prompt-driven Style Generation for Source-free Domain Generalization","date":"2023-07-27","arxiv_id":"2307.15199","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/poem-polarization-of-embeddings-for-domain","slug":"poem-polarization-of-embeddings-for-domain","title":"POEM: Polarization of Embeddings for Domain-Invariant Representations","date":"2023-05-22","arxiv_id":"2305.13046","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/simple-specialized-model-sample-matching-for","slug":"simple-specialized-model-sample-matching-for","title":"SIMPLE: Specialized Model-Sample Matching for Domain Generalization","date":"2023-05-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/universal-domain-adaptation-via-compressive","slug":"universal-domain-adaptation-via-compressive","title":"Universal Domain Adaptation via Compressive Attention Matching","date":"2023-04-24","arxiv_id":"2304.11862","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/chatty-coupled-holistic-adversarial-transport","slug":"chatty-coupled-holistic-adversarial-transport","title":"CHATTY: Coupled Holistic Adversarial Transport Terms with Yield for Unsupervised Domain Adaptation","date":"2023-04-19","arxiv_id":"2304.09623","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/vne-an-effective-method-for-improving-deep","slug":"vne-an-effective-method-for-improving-deep","title":"VNE: An Effective Method for Improving Deep Representation by Manipulating Eigenvalue Distribution","date":"2023-04-04","arxiv_id":"2304.01434","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/patch-mix-transformer-for-unsupervised-domain","slug":"patch-mix-transformer-for-unsupervised-domain","title":"Patch-Mix Transformer for Unsupervised Domain Adaptation: A Game Perspective","date":"2023-03-23","arxiv_id":"2303.13434","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/upcycling-models-under-domain-and-category","slug":"upcycling-models-under-domain-and-category","title":"Upcycling Models under Domain and Category Shift","date":"2023-03-13","arxiv_id":"2303.07110","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/domain-aware-triplet-loss-in-domain","slug":"domain-aware-triplet-loss-in-domain","title":"Domain-aware Triplet loss in Domain Generalization","date":"2023-03-01","arxiv_id":"2303.01233","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/class-overwhelms-mutual-conditional-blended","slug":"class-overwhelms-mutual-conditional-blended","title":"Class Overwhelms: Mutual Conditional Blended-Target Domain Adaptation","date":"2023-02-03","arxiv_id":"2302.01516","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/class-overwhelms-mutual-conditional-blended#ran","syntology_url":"https://syntology.ai/paper/2302.01516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01516"}}}},{"paper":"/paper/free-lunch-for-domain-adversarial-training-1","slug":"free-lunch-for-domain-adversarial-training-1","title":"Free Lunch for Domain Adversarial Training: Environment Label Smoothing","date":"2023-02-01","arxiv_id":"2302.00194","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["yfzhang114/Environment-Label-Smoothing"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/free-lunch-for-domain-adversarial-training-1#ran","syntology_url":"https://syntology.ai/paper/2302.00194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00194"}}}},{"paper":"/paper/backprop-induced-feature-weighting-for","slug":"backprop-induced-feature-weighting-for","title":"Backprop Induced Feature Weighting for Adversarial Domain Adaptation with Iterative Label Distribution Alignment","date":"2023-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boosting-novel-category-discovery-over-1","slug":"boosting-novel-category-discovery-over-1","title":"Boosting Novel Category Discovery Over Domains with Soft Contrastive Learning and All in One Classifier","date":"2023-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recycling-diverse-models-for-out-of","slug":"recycling-diverse-models-for-out-of","title":"Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalization","date":"2022-12-20","arxiv_id":"2212.10445","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-generalization-by-learning-and","slug":"domain-generalization-by-learning-and","title":"Domain Generalization by Learning and Removing Domain-specific Features","date":"2022-12-14","arxiv_id":"2212.07101","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["yulearningg/LRDG"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-generalization-by-learning-and#ran","syntology_url":"https://syntology.ai/paper/2212.07101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.07101"}}}},{"paper":"/paper/semantic-aware-message-broadcasting-for","slug":"semantic-aware-message-broadcasting-for","title":"Semantic-aware Message Broadcasting for Efficient Unsupervised Domain Adaptation","date":"2022-12-06","arxiv_id":"2212.02739","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mic-masked-image-consistency-for-context","slug":"mic-masked-image-consistency-for-context","title":"MIC: Masked Image Consistency for Context-Enhanced Domain Adaptation","date":"2022-12-02","arxiv_id":"2212.01322","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/context-aware-robust-fine-tuning","slug":"context-aware-robust-fine-tuning","title":"Context-Aware Robust Fine-Tuning","date":"2022-11-29","arxiv_id":"2211.16175","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cross-domain-ensemble-distillation-for-domain-2","slug":"cross-domain-ensemble-distillation-for-domain-2","title":"Cross-Domain Ensemble Distillation for Domain Generalization","date":"2022-11-25","arxiv_id":"2211.14058","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unified-optimal-transport-framework-for","slug":"unified-optimal-transport-framework-for","title":"Unified Optimal Transport Framework for Universal Domain Adaptation","date":"2022-10-31","arxiv_id":"2210.17067","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["changwxx/uniot-for-unida"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unified-optimal-transport-framework-for#ran","syntology_url":"https://syntology.ai/paper/2210.17067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.17067"}}}},{"paper":"/paper/selective-partial-domain-adaptation","slug":"selective-partial-domain-adaptation","title":"Selective Partial Domain Adaptation","date":"2022-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-closer-look-at-smoothness-in-domain-1","slug":"a-closer-look-at-smoothness-in-domain-1","title":"A Closer Look at Smoothness in Domain Adversarial Training","date":"2022-06-16","arxiv_id":"2206.08213","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["val-iisc/sdat"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-closer-look-at-smoothness-in-domain-1#ran","syntology_url":"https://syntology.ai/paper/2206.08213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08213"}}}},{"paper":"/paper/sparse-fusion-mixture-of-experts-are-domain","slug":"sparse-fusion-mixture-of-experts-are-domain","title":"Sparse Mixture-of-Experts are Domain Generalizable Learners","date":"2022-06-08","arxiv_id":"2206.04046","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":5,"pointer_only_for_licence":14,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/dynamic-domain-generalization","slug":"dynamic-domain-generalization","title":"Dynamic Domain Generalization","date":"2022-05-27","arxiv_id":"2205.13913","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["metavisionlab/ddg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2205.13913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13913"}}}},{"paper":"/paper/safe-self-refinement-for-transformer-based","slug":"safe-self-refinement-for-transformer-based","title":"Safe Self-Refinement for Transformer-based Domain Adaptation","date":"2022-04-16","arxiv_id":"2204.07683","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":9,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":10,"pointer_only_for_licence":1,"official":{"repos":["tsun/ssrt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":10,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/safe-self-refinement-for-transformer-based#ran","syntology_url":"https://syntology.ai/paper/2204.07683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07683"}}}},{"paper":"/paper/reusing-the-task-specific-classifier-as-a","slug":"reusing-the-task-specific-classifier-as-a","title":"Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation","date":"2022-04-08","arxiv_id":"2204.03838","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["xiaoachen98/daln"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/reusing-the-task-specific-classifier-as-a#ran","syntology_url":"https://syntology.ai/paper/2204.03838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.03838"}}}},{"paper":"/paper/cadg-a-model-based-on-cross-attention-for","slug":"cadg-a-model-based-on-cross-attention-for","title":"CADG: A Model Based on Cross Attention for Domain Generalization","date":"2022-03-31","arxiv_id":"2203.17067","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/domain-generalization-by-mutual-information","slug":"domain-generalization-by-mutual-information","title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","date":"2022-03-21","arxiv_id":"2203.10789","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/domain-generalization-using-pretrained-models","slug":"domain-generalization-using-pretrained-models","title":"Domain Generalization using Pretrained Models without Fine-tuning","date":"2022-03-09","arxiv_id":"2203.04600","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/geometric-anchor-correspondence-mining-with","slug":"geometric-anchor-correspondence-mining-with","title":"Geometric Anchor Correspondence Mining With Uncertainty Modeling for Universal Domain Adaptation","date":"2022-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/pcl-proxy-based-contrastive-learning-for","slug":"pcl-proxy-based-contrastive-learning-for","title":"PCL: Proxy-Based Contrastive Learning for Domain Generalization","date":"2022-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-multi-domain-generalization-through","slug":"improving-multi-domain-generalization-through","title":"Automated Domain Discovery from Multiple Sources to Improve Zero-Shot Generalization","date":"2021-12-17","arxiv_id":"2112.09802","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/umad-universal-model-adaptation-under-domain","slug":"umad-universal-model-adaptation-under-domain","title":"UMAD: Universal Model Adaptation under Domain and Category Shift","date":"2021-12-16","arxiv_id":"2112.08553","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adaptive-methods-for-aggregated-domain","slug":"adaptive-methods-for-aggregated-domain","title":"Adaptive Methods for Aggregated Domain Generalization","date":"2021-12-09","arxiv_id":"2112.04766","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/adversarial-reweighting-for-partial-domain","slug":"adversarial-reweighting-for-partial-domain","title":"Adversarial Reweighting for Partial Domain Adaptation","date":"2021-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contrastive-vicinal-space-for-unsupervised","slug":"contrastive-vicinal-space-for-unsupervised","title":"Contrastive Vicinal Space for Unsupervised Domain Adaptation","date":"2021-11-26","arxiv_id":"2111.13353","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","slug":"amortized-prompt-lightweight-fine-tuning-for","title":"Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains","date":"2021-11-25","arxiv_id":"2111.12853","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":17,"official":{"repos":["shogi880/DPLCLIP"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/amortized-prompt-lightweight-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/2111.12853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12853"}}}},{"paper":"/paper/semantic-aware-representation-learning-via-1","slug":"semantic-aware-representation-learning-via-1","title":"Probabilistic Contrastive Learning for Domain Adaptation","date":"2021-11-11","arxiv_id":"2111.06021","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/ensemble-of-averages-improving-model","slug":"ensemble-of-averages-improving-model","title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","date":"2021-10-21","arxiv_id":"2110.10832","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/cross-domain-ensemble-distillation-for-domain","slug":"cross-domain-ensemble-distillation-for-domain","title":"Cross Domain Ensemble Distillation for Domain Generalization","date":"2021-09-29","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cdtrans-cross-domain-transformer-for","slug":"cdtrans-cross-domain-transformer-for","title":"CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptation","date":"2021-09-13","arxiv_id":"2109.06165","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["cdtrans/cdtrans"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cdtrans-cross-domain-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2109.06165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06165"}}}},{"paper":"/paper/fishr-invariant-gradient-variances-for-out-of","slug":"fishr-invariant-gradient-variances-for-out-of","title":"Fishr: Invariant Gradient Variances for Out-of-Distribution Generalization","date":"2021-09-07","arxiv_id":"2109.02934","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/source-class-selection-with-label-propagation","slug":"source-class-selection-with-label-propagation","title":"Source Class Selection with Label Propagation for Partial Domain Adaptation","date":"2021-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/feature-stylization-and-domain-aware","slug":"feature-stylization-and-domain-aware","title":"Feature Stylization and Domain-aware Contrastive Learning for Domain Generalization","date":"2021-08-19","arxiv_id":"2108.08596","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/source-free-domain-adaptation-via-avatar","slug":"source-free-domain-adaptation-via-avatar","title":"Source-free Domain Adaptation via Avatar Prototype Generation and Adaptation","date":"2021-06-18","arxiv_id":"2106.15326","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-consensus-clustering-for-universal","slug":"domain-consensus-clustering-for-universal","title":"Domain Consensus Clustering for Universal Domain Adaptation","date":"2021-06-05","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ovanet-one-vs-all-network-for-universal","slug":"ovanet-one-vs-all-network-for-universal","title":"OVANet: One-vs-All Network for Universal Domain Adaptation","date":"2021-04-07","arxiv_id":"2104.03344","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["VisionLearningGroup/OVANet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ovanet-one-vs-all-network-for-universal#ran","syntology_url":"https://syntology.ai/paper/2104.03344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03344"}}}},{"paper":"/paper/curriculum-graph-co-teaching-for-multi-target","slug":"curriculum-graph-co-teaching-for-multi-target","title":"Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation","date":"2021-04-01","arxiv_id":"2104.00808","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["Evgeneus/Graph-Domain-Adaptaion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/curriculum-graph-co-teaching-for-multi-target#ran","syntology_url":"https://syntology.ai/paper/2104.00808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00808"}}}},{"paper":"/paper/on-evolving-attention-towards-domain","slug":"on-evolving-attention-towards-domain","title":"On Evolving Attention Towards Domain Adaptation","date":"2021-03-25","arxiv_id":"2103.13561","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/bridging-adversarial-and-statistical-domain","slug":"bridging-adversarial-and-statistical-domain","title":"Bridging Adversarial and Statistical Domain Transfer via Spectral Adaptation Networks","date":"2021-02-25","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-generalization-needs-stochastic-weight","slug":"domain-generalization-needs-stochastic-weight","title":"SWAD: Domain Generalization by Seeking Flat Minima","date":"2021-02-17","arxiv_id":"2102.08604","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/sentry-selective-entropy-optimization-via","slug":"sentry-selective-entropy-optimization-via","title":"SENTRY: Selective Entropy Optimization via Committee Consistency for Unsupervised Domain Adaptation","date":"2020-12-21","arxiv_id":"2012.11460","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/select-label-and-mix-learning-discriminative","slug":"select-label-and-mix-learning-discriminative","title":"Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptation","date":"2020-12-06","arxiv_id":"2012.03358","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fixbi-bridging-domain-spaces-for-unsupervised","slug":"fixbi-bridging-domain-spaces-for-unsupervised","title":"FixBi: Bridging Domain Spaces for Unsupervised Domain Adaptation","date":"2020-11-18","arxiv_id":"2011.09230","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/discriminative-adversarial-domain","slug":"discriminative-adversarial-domain","title":"Discriminative Adversarial Domain Generalization with Meta-learning based Cross-domain Validation","date":"2020-11-01","arxiv_id":"2011.00444","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/learning-to-detect-open-classes-for-universal","slug":"learning-to-detect-open-classes-for-universal","title":"Learning to Detect Open Classes for Universal Domain Adaptation","date":"2020-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-challenging-improves-cross-domain","slug":"self-challenging-improves-cross-domain","title":"Self-Challenging Improves Cross-Domain Generalization","date":"2020-07-05","arxiv_id":"2007.02454","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/discriminative-feature-alignment","slug":"discriminative-feature-alignment","title":"Discriminative Feature Alignment: Improving Transferability of Unsupervised Domain Adaptation by Gaussian-guided Latent Alignment","date":"2020-06-23","arxiv_id":"2006.12770","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["JingWang18/Discriminative-Feature-Alignment"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/discriminative-feature-alignment#ran","syntology_url":"https://syntology.ai/paper/2006.12770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12770"}}}},{"paper":"/paper/implicit-class-conditioned-domain-alignment","slug":"implicit-class-conditioned-domain-alignment","title":"Implicit Class-Conditioned Domain Alignment for Unsupervised Domain Adaptation","date":"2020-06-09","arxiv_id":"2006.04996","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/a-balanced-and-uncertainty-aware-approach-for","slug":"a-balanced-and-uncertainty-aware-approach-for","title":"A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation","date":"2020-03-05","arxiv_id":"2003.02541","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["tim-learn/BA3US"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-balanced-and-uncertainty-aware-approach-for#ran","syntology_url":"https://syntology.ai/paper/2003.02541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02541"}}}},{"paper":"/paper/do-we-really-need-to-access-the-source-data","slug":"do-we-really-need-to-access-the-source-data","title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","date":"2020-02-20","arxiv_id":"2002.08546","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["tim-learn/SHOT"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/do-we-really-need-to-access-the-source-data#ran","syntology_url":"https://syntology.ai/paper/2002.08546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08546"}}}},{"paper":"/paper/entropy-minimization-vs-diversity","slug":"entropy-minimization-vs-diversity","title":"Entropy Minimization vs. Diversity Maximization for Domain Adaptation","date":"2020-02-05","arxiv_id":"2002.01690","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["AI-NERC-NUPT/MEDM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entropy-minimization-vs-diversity#ran","syntology_url":"https://syntology.ai/paper/2002.01690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01690"}}}},{"paper":"/paper/less-confusion-more-transferable-minimum","slug":"less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","arxiv_id":"1912.03699","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["thuml/Versatile-Domain-Adaptation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/less-confusion-more-transferable-minimum#ran","syntology_url":"https://syntology.ai/paper/1912.03699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03699"}}}},{"paper":"/paper/correlation-aware-adversarial-domain","slug":"correlation-aware-adversarial-domain","title":"Correlation-aware Adversarial Domain Adaptation and Generalization","date":"2019-11-29","arxiv_id":"1911.12983","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/unsupervised-domain-adaptation-via-structured","slug":"unsupervised-domain-adaptation-via-structured","title":"Unsupervised Domain Adaptation via Structured Prediction Based Selective Pseudo-Labeling","date":"2019-11-18","arxiv_id":"1911.07982","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/reducing-domain-gap-via-style-agnostic","slug":"reducing-domain-gap-via-style-agnostic","title":"Reducing Domain Gap by Reducing Style Bias","date":"2019-10-25","arxiv_id":"1910.11645","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/transfer-learning-with-dynamic-distribution","slug":"transfer-learning-with-dynamic-distribution","title":"Transfer Learning with Dynamic Distribution Adaptation","date":"2019-09-17","arxiv_id":"1909.08531","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/open-set-domain-adaptation-theoretical-bound","slug":"open-set-domain-adaptation-theoretical-bound","title":"Open Set Domain Adaptation: Theoretical Bound and Algorithm","date":"2019-07-19","arxiv_id":"1907.08375","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/blending-target-domain-adaptation-by-1","slug":"blending-target-domain-adaptation-by-1","title":"Blending-target Domain Adaptation by Adversarial Meta-Adaptation Networks","date":"2019-07-08","arxiv_id":"1907.03389","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/attending-to-discriminative-certainty-for-1","slug":"attending-to-discriminative-certainty-for-1","title":"Attending to Discriminative Certainty for Domain Adaptation","date":"2019-06-08","arxiv_id":"1906.03502","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/universal-domain-adaptation","slug":"universal-domain-adaptation","title":"Universal Domain Adaptation","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/selective-transfer-with-reinforced-transfer","slug":"selective-transfer-with-reinforced-transfer","title":"Selective Transfer with Reinforced Transfer Network for Partial Domain Adaptation","date":"2019-05-26","arxiv_id":"1905.10756","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/easy-transfer-learning-by-exploiting-intra","slug":"easy-transfer-learning-by-exploiting-intra","title":"Easy Transfer Learning By Exploiting Intra-domain Structures","date":"2019-04-02","arxiv_id":"1904.01376","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/looking-back-at-labels-a-class-based-domain","slug":"looking-back-at-labels-a-class-based-domain","title":"Looking back at Labels: A Class based Domain Adaptation Technique","date":"2019-04-02","arxiv_id":"1904.01341","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-transfer-examples-for-partial","slug":"learning-to-transfer-examples-for-partial","title":"Learning to Transfer Examples for Partial Domain Adaptation","date":"2019-03-28","arxiv_id":"1903.12230","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unsupervised-domain-adaptation-an-adaptive","slug":"unsupervised-domain-adaptation-an-adaptive","title":"Larger Norm More Transferable: An Adaptive Feature Norm Approach for Unsupervised Domain Adaptation","date":"2018-11-19","arxiv_id":"1811.07456","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/visual-domain-adaptation-with-manifold","slug":"visual-domain-adaptation-with-manifold","title":"Visual Domain Adaptation with Manifold Embedded Distribution Alignment","date":"2018-07-19","arxiv_id":"1807.07258","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/target-semantics-clustering-via-text-1","slug":"target-semantics-clustering-via-text-1","title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","date":"2025-06-04","arxiv_id":"2506.03521","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["Sapphire-356/TASC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/target-semantics-clustering-via-text-1#ran","syntology_url":"https://syntology.ai/paper/2506.03521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03521"}}}},{"paper":"/paper/transadapter-vision-transformer-for-feature","slug":"transadapter-vision-transformer-for-feature","title":"TransAdapter: Vision Transformer for Feature-Centric Unsupervised Domain Adaptation","date":"2024-12-05","arxiv_id":"2412.04073","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/feature-fusion-transferability-aware","slug":"feature-fusion-transferability-aware","title":"Feature Fusion Transferability Aware Transformer for Unsupervised Domain Adaptation","date":"2024-11-10","arxiv_id":"2411.07794","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/cosmo-clip-talks-on-open-set-multi-target-1","slug":"cosmo-clip-talks-on-open-set-multi-target-1","title":"COSMo: CLIP Talks on Open-Set Multi-Target Domain Adaptation","date":"2024-08-31","arxiv_id":"2409.00397","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/euda-an-efficient-unsupervised-domain","slug":"euda-an-efficient-unsupervised-domain","title":"EUDA: An Efficient Unsupervised Domain Adaptation via Self-Supervised Vision Transformer","date":"2024-07-31","arxiv_id":"2407.21311","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/enhancing-domain-adaptation-through-prompt","slug":"enhancing-domain-adaptation-through-prompt","title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","date":"2024-06-13","arxiv_id":"2406.09353","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":12,"official":{"repos":["viethoang1512/pga"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/enhancing-domain-adaptation-through-prompt#ran","syntology_url":"https://syntology.ai/paper/2406.09353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09353"}}}},{"paper":"/paper/proxy-denoising-for-source-free-domain","slug":"proxy-denoising-for-source-free-domain","title":"Proxy Denoising for Source-Free Domain Adaptation","date":"2024-06-03","arxiv_id":"2406.01658","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["tntek/source-free-domain-adaptation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proxy-denoising-for-source-free-domain#ran","syntology_url":"https://syntology.ai/paper/2406.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01658"}}}},{"paper":"/paper/empowering-source-free-domain-adaptation-with","slug":"empowering-source-free-domain-adaptation-with","title":"Empowering Source-Free Domain Adaptation with MLLM-driven Curriculum Learning","date":"2024-05-28","arxiv_id":"2405.18376","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/soft-prompt-generation-for-domain","slug":"soft-prompt-generation-for-domain","title":"Soft Prompt Generation for Domain Generalization","date":"2024-04-30","arxiv_id":"2404.19286","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":6,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/unsupervised-domain-adaption-harnessing","slug":"unsupervised-domain-adaption-harnessing","title":"Unsupervised Domain Adaption Harnessing Vision-Language Pre-training","date":"2024-04-19","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-cnn-on-vit-a-hybrid-model-to","slug":"learning-cnn-on-vit-a-hybrid-model-to","title":"Learning CNN on ViT: A Hybrid Model to Explicitly Class-specific Boundaries for Domain Adaptation","date":"2024-03-27","arxiv_id":"2403.18360","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/lead-learning-decomposition-for-source-free","slug":"lead-learning-decomposition-for-source-free","title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","date":"2024-03-06","arxiv_id":"2403.03421","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":8,"samples_unverified":2,"pointer_only_for_licence":9,"official":{"repos":["ispc-lab/lead"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lead-learning-decomposition-for-source-free#ran","syntology_url":"https://syntology.ai/paper/2403.03421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03421"}}}},{"paper":"/paper/rethinking-multi-domain-generalization-with-a","slug":"rethinking-multi-domain-generalization-with-a","title":"Rethinking Multi-domain Generalization with A General Learning Objective","date":"2024-02-29","arxiv_id":"2402.18853","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/prompt-based-distribution-alignment-for","slug":"prompt-based-distribution-alignment-for","title":"Prompt-based Distribution Alignment for Unsupervised Domain Adaptation","date":"2023-12-15","arxiv_id":"2312.09553","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["baishuanghao/prompt-based-distribution-alignment"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/prompt-based-distribution-alignment-for#ran","syntology_url":"https://syntology.ai/paper/2312.09553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.09553"}}}},{"paper":"/paper/mlnet-mutual-learning-network-with","slug":"mlnet-mutual-learning-network-with","title":"MLNet: Mutual Learning Network with Neighborhood Invariance for Universal Domain Adaptation","date":"2023-12-13","arxiv_id":"2312.07871","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["YanzuoLu/MLNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mlnet-mutual-learning-network-with#ran","syntology_url":"https://syntology.ai/paper/2312.07871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.07871"}}}},{"paper":"/paper/combining-inherent-knowledge-of-vision","slug":"combining-inherent-knowledge-of-vision","title":"Combining inherent knowledge of vision-language models with unsupervised domain adaptation through strong-weak guidance","date":"2023-12-07","arxiv_id":"2312.04066","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gradual-source-domain-expansion-for","slug":"gradual-source-domain-expansion-for","title":"Gradual Source Domain Expansion for Unsupervised Domain Adaptation","date":"2023-11-16","arxiv_id":"2311.09599","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-generalization-using-large-pretrained","slug":"domain-generalization-using-large-pretrained","title":"Domain Generalization Using Large Pretrained Models with Mixture-of-Adapters","date":"2023-10-17","arxiv_id":"2310.11031","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-unified-and-effective-domain","slug":"towards-unified-and-effective-domain","title":"Towards Unified and Effective Domain Generalization","date":"2023-10-16","arxiv_id":"2310.10008","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distilling-from-vision-language-models-for","slug":"distilling-from-vision-language-models-for","title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","date":"2023-10-12","arxiv_id":"2310.08255","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/domain-adaptive-few-shot-open-set-learning","slug":"domain-adaptive-few-shot-open-set-learning","title":"Domain Adaptive Few-Shot Open-Set Learning","date":"2023-09-22","arxiv_id":"2309.12814","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/weight-averaging-improves-knowledge","slug":"weight-averaging-improves-knowledge","title":"Weight Averaging Improves Knowledge Distillation under Domain Shift","date":"2023-09-20","arxiv_id":"2309.11446","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/promptstyler-prompt-driven-style-generation","slug":"promptstyler-prompt-driven-style-generation","title":"PromptStyler: Prompt-driven Style Generation for Source-free Domain Generalization","date":"2023-07-27","arxiv_id":"2307.15199","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/poem-polarization-of-embeddings-for-domain","slug":"poem-polarization-of-embeddings-for-domain","title":"POEM: Polarization of Embeddings for Domain-Invariant Representations","date":"2023-05-22","arxiv_id":"2305.13046","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/simple-specialized-model-sample-matching-for","slug":"simple-specialized-model-sample-matching-for","title":"SIMPLE: Specialized Model-Sample Matching for Domain Generalization","date":"2023-05-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/universal-domain-adaptation-via-compressive","slug":"universal-domain-adaptation-via-compressive","title":"Universal Domain Adaptation via Compressive Attention Matching","date":"2023-04-24","arxiv_id":"2304.11862","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/chatty-coupled-holistic-adversarial-transport","slug":"chatty-coupled-holistic-adversarial-transport","title":"CHATTY: Coupled Holistic Adversarial Transport Terms with Yield for Unsupervised Domain Adaptation","date":"2023-04-19","arxiv_id":"2304.09623","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/vne-an-effective-method-for-improving-deep","slug":"vne-an-effective-method-for-improving-deep","title":"VNE: An Effective Method for Improving Deep Representation by Manipulating Eigenvalue Distribution","date":"2023-04-04","arxiv_id":"2304.01434","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/patch-mix-transformer-for-unsupervised-domain","slug":"patch-mix-transformer-for-unsupervised-domain","title":"Patch-Mix Transformer for Unsupervised Domain Adaptation: A Game Perspective","date":"2023-03-23","arxiv_id":"2303.13434","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/upcycling-models-under-domain-and-category","slug":"upcycling-models-under-domain-and-category","title":"Upcycling Models under Domain and Category Shift","date":"2023-03-13","arxiv_id":"2303.07110","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/domain-aware-triplet-loss-in-domain","slug":"domain-aware-triplet-loss-in-domain","title":"Domain-aware Triplet loss in Domain Generalization","date":"2023-03-01","arxiv_id":"2303.01233","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/class-overwhelms-mutual-conditional-blended","slug":"class-overwhelms-mutual-conditional-blended","title":"Class Overwhelms: Mutual Conditional Blended-Target Domain Adaptation","date":"2023-02-03","arxiv_id":"2302.01516","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/class-overwhelms-mutual-conditional-blended#ran","syntology_url":"https://syntology.ai/paper/2302.01516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01516"}}}},{"paper":"/paper/free-lunch-for-domain-adversarial-training-1","slug":"free-lunch-for-domain-adversarial-training-1","title":"Free Lunch for Domain Adversarial Training: Environment Label Smoothing","date":"2023-02-01","arxiv_id":"2302.00194","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["yfzhang114/Environment-Label-Smoothing"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/free-lunch-for-domain-adversarial-training-1#ran","syntology_url":"https://syntology.ai/paper/2302.00194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00194"}}}},{"paper":"/paper/backprop-induced-feature-weighting-for","slug":"backprop-induced-feature-weighting-for","title":"Backprop Induced Feature Weighting for Adversarial Domain Adaptation with Iterative Label Distribution Alignment","date":"2023-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boosting-novel-category-discovery-over-1","slug":"boosting-novel-category-discovery-over-1","title":"Boosting Novel Category Discovery Over Domains with Soft Contrastive Learning and All in One Classifier","date":"2023-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recycling-diverse-models-for-out-of","slug":"recycling-diverse-models-for-out-of","title":"Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalization","date":"2022-12-20","arxiv_id":"2212.10445","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-generalization-by-learning-and","slug":"domain-generalization-by-learning-and","title":"Domain Generalization by Learning and Removing Domain-specific Features","date":"2022-12-14","arxiv_id":"2212.07101","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["yulearningg/LRDG"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-generalization-by-learning-and#ran","syntology_url":"https://syntology.ai/paper/2212.07101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.07101"}}}},{"paper":"/paper/semantic-aware-message-broadcasting-for","slug":"semantic-aware-message-broadcasting-for","title":"Semantic-aware Message Broadcasting for Efficient Unsupervised Domain Adaptation","date":"2022-12-06","arxiv_id":"2212.02739","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mic-masked-image-consistency-for-context","slug":"mic-masked-image-consistency-for-context","title":"MIC: Masked Image Consistency for Context-Enhanced Domain Adaptation","date":"2022-12-02","arxiv_id":"2212.01322","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/context-aware-robust-fine-tuning","slug":"context-aware-robust-fine-tuning","title":"Context-Aware Robust Fine-Tuning","date":"2022-11-29","arxiv_id":"2211.16175","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cross-domain-ensemble-distillation-for-domain-2","slug":"cross-domain-ensemble-distillation-for-domain-2","title":"Cross-Domain Ensemble Distillation for Domain Generalization","date":"2022-11-25","arxiv_id":"2211.14058","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unified-optimal-transport-framework-for","slug":"unified-optimal-transport-framework-for","title":"Unified Optimal Transport Framework for Universal Domain Adaptation","date":"2022-10-31","arxiv_id":"2210.17067","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["changwxx/uniot-for-unida"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unified-optimal-transport-framework-for#ran","syntology_url":"https://syntology.ai/paper/2210.17067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.17067"}}}},{"paper":"/paper/selective-partial-domain-adaptation","slug":"selective-partial-domain-adaptation","title":"Selective Partial Domain Adaptation","date":"2022-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-closer-look-at-smoothness-in-domain-1","slug":"a-closer-look-at-smoothness-in-domain-1","title":"A Closer Look at Smoothness in Domain Adversarial Training","date":"2022-06-16","arxiv_id":"2206.08213","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["val-iisc/sdat"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-closer-look-at-smoothness-in-domain-1#ran","syntology_url":"https://syntology.ai/paper/2206.08213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08213"}}}},{"paper":"/paper/sparse-fusion-mixture-of-experts-are-domain","slug":"sparse-fusion-mixture-of-experts-are-domain","title":"Sparse Mixture-of-Experts are Domain Generalizable Learners","date":"2022-06-08","arxiv_id":"2206.04046","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":5,"pointer_only_for_licence":14,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/dynamic-domain-generalization","slug":"dynamic-domain-generalization","title":"Dynamic Domain Generalization","date":"2022-05-27","arxiv_id":"2205.13913","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["metavisionlab/ddg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2205.13913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13913"}}}},{"paper":"/paper/safe-self-refinement-for-transformer-based","slug":"safe-self-refinement-for-transformer-based","title":"Safe Self-Refinement for Transformer-based Domain Adaptation","date":"2022-04-16","arxiv_id":"2204.07683","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":9,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":10,"pointer_only_for_licence":1,"official":{"repos":["tsun/ssrt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":10,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/safe-self-refinement-for-transformer-based#ran","syntology_url":"https://syntology.ai/paper/2204.07683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07683"}}}},{"paper":"/paper/reusing-the-task-specific-classifier-as-a","slug":"reusing-the-task-specific-classifier-as-a","title":"Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation","date":"2022-04-08","arxiv_id":"2204.03838","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["xiaoachen98/daln"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/reusing-the-task-specific-classifier-as-a#ran","syntology_url":"https://syntology.ai/paper/2204.03838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.03838"}}}},{"paper":"/paper/cadg-a-model-based-on-cross-attention-for","slug":"cadg-a-model-based-on-cross-attention-for","title":"CADG: A Model Based on Cross Attention for Domain Generalization","date":"2022-03-31","arxiv_id":"2203.17067","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/domain-generalization-by-mutual-information","slug":"domain-generalization-by-mutual-information","title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","date":"2022-03-21","arxiv_id":"2203.10789","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/domain-generalization-using-pretrained-models","slug":"domain-generalization-using-pretrained-models","title":"Domain Generalization using Pretrained Models without Fine-tuning","date":"2022-03-09","arxiv_id":"2203.04600","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/geometric-anchor-correspondence-mining-with","slug":"geometric-anchor-correspondence-mining-with","title":"Geometric Anchor Correspondence Mining With Uncertainty Modeling for Universal Domain Adaptation","date":"2022-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/pcl-proxy-based-contrastive-learning-for","slug":"pcl-proxy-based-contrastive-learning-for","title":"PCL: Proxy-Based Contrastive Learning for Domain Generalization","date":"2022-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-multi-domain-generalization-through","slug":"improving-multi-domain-generalization-through","title":"Automated Domain Discovery from Multiple Sources to Improve Zero-Shot Generalization","date":"2021-12-17","arxiv_id":"2112.09802","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/umad-universal-model-adaptation-under-domain","slug":"umad-universal-model-adaptation-under-domain","title":"UMAD: Universal Model Adaptation under Domain and Category Shift","date":"2021-12-16","arxiv_id":"2112.08553","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/adaptive-methods-for-aggregated-domain","slug":"adaptive-methods-for-aggregated-domain","title":"Adaptive Methods for Aggregated Domain Generalization","date":"2021-12-09","arxiv_id":"2112.04766","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/adversarial-reweighting-for-partial-domain","slug":"adversarial-reweighting-for-partial-domain","title":"Adversarial Reweighting for Partial Domain Adaptation","date":"2021-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contrastive-vicinal-space-for-unsupervised","slug":"contrastive-vicinal-space-for-unsupervised","title":"Contrastive Vicinal Space for Unsupervised Domain Adaptation","date":"2021-11-26","arxiv_id":"2111.13353","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","slug":"amortized-prompt-lightweight-fine-tuning-for","title":"Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains","date":"2021-11-25","arxiv_id":"2111.12853","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":17,"official":{"repos":["shogi880/DPLCLIP"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/amortized-prompt-lightweight-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/2111.12853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12853"}}}},{"paper":"/paper/semantic-aware-representation-learning-via-1","slug":"semantic-aware-representation-learning-via-1","title":"Probabilistic Contrastive Learning for Domain Adaptation","date":"2021-11-11","arxiv_id":"2111.06021","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/ensemble-of-averages-improving-model","slug":"ensemble-of-averages-improving-model","title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","date":"2021-10-21","arxiv_id":"2110.10832","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/cross-domain-ensemble-distillation-for-domain","slug":"cross-domain-ensemble-distillation-for-domain","title":"Cross Domain Ensemble Distillation for Domain Generalization","date":"2021-09-29","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cdtrans-cross-domain-transformer-for","slug":"cdtrans-cross-domain-transformer-for","title":"CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptation","date":"2021-09-13","arxiv_id":"2109.06165","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["cdtrans/cdtrans"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cdtrans-cross-domain-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2109.06165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06165"}}}},{"paper":"/paper/fishr-invariant-gradient-variances-for-out-of","slug":"fishr-invariant-gradient-variances-for-out-of","title":"Fishr: Invariant Gradient Variances for Out-of-Distribution Generalization","date":"2021-09-07","arxiv_id":"2109.02934","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/source-class-selection-with-label-propagation","slug":"source-class-selection-with-label-propagation","title":"Source Class Selection with Label Propagation for Partial Domain Adaptation","date":"2021-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/feature-stylization-and-domain-aware","slug":"feature-stylization-and-domain-aware","title":"Feature Stylization and Domain-aware Contrastive Learning for Domain Generalization","date":"2021-08-19","arxiv_id":"2108.08596","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/source-free-domain-adaptation-via-avatar","slug":"source-free-domain-adaptation-via-avatar","title":"Source-free Domain Adaptation via Avatar Prototype Generation and Adaptation","date":"2021-06-18","arxiv_id":"2106.15326","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-consensus-clustering-for-universal","slug":"domain-consensus-clustering-for-universal","title":"Domain Consensus Clustering for Universal Domain Adaptation","date":"2021-06-05","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/ovanet-one-vs-all-network-for-universal","slug":"ovanet-one-vs-all-network-for-universal","title":"OVANet: One-vs-All Network for Universal Domain Adaptation","date":"2021-04-07","arxiv_id":"2104.03344","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["VisionLearningGroup/OVANet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ovanet-one-vs-all-network-for-universal#ran","syntology_url":"https://syntology.ai/paper/2104.03344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03344"}}}},{"paper":"/paper/curriculum-graph-co-teaching-for-multi-target","slug":"curriculum-graph-co-teaching-for-multi-target","title":"Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation","date":"2021-04-01","arxiv_id":"2104.00808","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["Evgeneus/Graph-Domain-Adaptaion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/curriculum-graph-co-teaching-for-multi-target#ran","syntology_url":"https://syntology.ai/paper/2104.00808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00808"}}}},{"paper":"/paper/on-evolving-attention-towards-domain","slug":"on-evolving-attention-towards-domain","title":"On Evolving Attention Towards Domain Adaptation","date":"2021-03-25","arxiv_id":"2103.13561","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/bridging-adversarial-and-statistical-domain","slug":"bridging-adversarial-and-statistical-domain","title":"Bridging Adversarial and Statistical Domain Transfer via Spectral Adaptation Networks","date":"2021-02-25","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/domain-generalization-needs-stochastic-weight","slug":"domain-generalization-needs-stochastic-weight","title":"SWAD: Domain Generalization by Seeking Flat Minima","date":"2021-02-17","arxiv_id":"2102.08604","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/sentry-selective-entropy-optimization-via","slug":"sentry-selective-entropy-optimization-via","title":"SENTRY: Selective Entropy Optimization via Committee Consistency for Unsupervised Domain Adaptation","date":"2020-12-21","arxiv_id":"2012.11460","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/select-label-and-mix-learning-discriminative","slug":"select-label-and-mix-learning-discriminative","title":"Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptation","date":"2020-12-06","arxiv_id":"2012.03358","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fixbi-bridging-domain-spaces-for-unsupervised","slug":"fixbi-bridging-domain-spaces-for-unsupervised","title":"FixBi: Bridging Domain Spaces for Unsupervised Domain Adaptation","date":"2020-11-18","arxiv_id":"2011.09230","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/discriminative-adversarial-domain","slug":"discriminative-adversarial-domain","title":"Discriminative Adversarial Domain Generalization with Meta-learning based Cross-domain Validation","date":"2020-11-01","arxiv_id":"2011.00444","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/learning-to-detect-open-classes-for-universal","slug":"learning-to-detect-open-classes-for-universal","title":"Learning to Detect Open Classes for Universal Domain Adaptation","date":"2020-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-challenging-improves-cross-domain","slug":"self-challenging-improves-cross-domain","title":"Self-Challenging Improves Cross-Domain Generalization","date":"2020-07-05","arxiv_id":"2007.02454","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/discriminative-feature-alignment","slug":"discriminative-feature-alignment","title":"Discriminative Feature Alignment: Improving Transferability of Unsupervised Domain Adaptation by Gaussian-guided Latent Alignment","date":"2020-06-23","arxiv_id":"2006.12770","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["JingWang18/Discriminative-Feature-Alignment"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/discriminative-feature-alignment#ran","syntology_url":"https://syntology.ai/paper/2006.12770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12770"}}}},{"paper":"/paper/implicit-class-conditioned-domain-alignment","slug":"implicit-class-conditioned-domain-alignment","title":"Implicit Class-Conditioned Domain Alignment for Unsupervised Domain Adaptation","date":"2020-06-09","arxiv_id":"2006.04996","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/a-balanced-and-uncertainty-aware-approach-for","slug":"a-balanced-and-uncertainty-aware-approach-for","title":"A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation","date":"2020-03-05","arxiv_id":"2003.02541","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["tim-learn/BA3US"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-balanced-and-uncertainty-aware-approach-for#ran","syntology_url":"https://syntology.ai/paper/2003.02541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02541"}}}},{"paper":"/paper/do-we-really-need-to-access-the-source-data","slug":"do-we-really-need-to-access-the-source-data","title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","date":"2020-02-20","arxiv_id":"2002.08546","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["tim-learn/SHOT"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/do-we-really-need-to-access-the-source-data#ran","syntology_url":"https://syntology.ai/paper/2002.08546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08546"}}}},{"paper":"/paper/entropy-minimization-vs-diversity","slug":"entropy-minimization-vs-diversity","title":"Entropy Minimization vs. Diversity Maximization for Domain Adaptation","date":"2020-02-05","arxiv_id":"2002.01690","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["AI-NERC-NUPT/MEDM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entropy-minimization-vs-diversity#ran","syntology_url":"https://syntology.ai/paper/2002.01690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01690"}}}},{"paper":"/paper/less-confusion-more-transferable-minimum","slug":"less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","arxiv_id":"1912.03699","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["thuml/Versatile-Domain-Adaptation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/less-confusion-more-transferable-minimum#ran","syntology_url":"https://syntology.ai/paper/1912.03699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03699"}}}},{"paper":"/paper/correlation-aware-adversarial-domain","slug":"correlation-aware-adversarial-domain","title":"Correlation-aware Adversarial Domain Adaptation and Generalization","date":"2019-11-29","arxiv_id":"1911.12983","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/unsupervised-domain-adaptation-via-structured","slug":"unsupervised-domain-adaptation-via-structured","title":"Unsupervised Domain Adaptation via Structured Prediction Based Selective Pseudo-Labeling","date":"2019-11-18","arxiv_id":"1911.07982","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/reducing-domain-gap-via-style-agnostic","slug":"reducing-domain-gap-via-style-agnostic","title":"Reducing Domain Gap by Reducing Style Bias","date":"2019-10-25","arxiv_id":"1910.11645","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/transfer-learning-with-dynamic-distribution","slug":"transfer-learning-with-dynamic-distribution","title":"Transfer Learning with Dynamic Distribution Adaptation","date":"2019-09-17","arxiv_id":"1909.08531","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/open-set-domain-adaptation-theoretical-bound","slug":"open-set-domain-adaptation-theoretical-bound","title":"Open Set Domain Adaptation: Theoretical Bound and Algorithm","date":"2019-07-19","arxiv_id":"1907.08375","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/blending-target-domain-adaptation-by-1","slug":"blending-target-domain-adaptation-by-1","title":"Blending-target Domain Adaptation by Adversarial Meta-Adaptation Networks","date":"2019-07-08","arxiv_id":"1907.03389","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/attending-to-discriminative-certainty-for-1","slug":"attending-to-discriminative-certainty-for-1","title":"Attending to Discriminative Certainty for Domain Adaptation","date":"2019-06-08","arxiv_id":"1906.03502","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/universal-domain-adaptation","slug":"universal-domain-adaptation","title":"Universal Domain Adaptation","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/selective-transfer-with-reinforced-transfer","slug":"selective-transfer-with-reinforced-transfer","title":"Selective Transfer with Reinforced Transfer Network for Partial Domain Adaptation","date":"2019-05-26","arxiv_id":"1905.10756","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/easy-transfer-learning-by-exploiting-intra","slug":"easy-transfer-learning-by-exploiting-intra","title":"Easy Transfer Learning By Exploiting Intra-domain Structures","date":"2019-04-02","arxiv_id":"1904.01376","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/looking-back-at-labels-a-class-based-domain","slug":"looking-back-at-labels-a-class-based-domain","title":"Looking back at Labels: A Class based Domain Adaptation Technique","date":"2019-04-02","arxiv_id":"1904.01341","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-transfer-examples-for-partial","slug":"learning-to-transfer-examples-for-partial","title":"Learning to Transfer Examples for Partial Domain Adaptation","date":"2019-03-28","arxiv_id":"1903.12230","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unsupervised-domain-adaptation-an-adaptive","slug":"unsupervised-domain-adaptation-an-adaptive","title":"Larger Norm More Transferable: An Adaptive Feature Norm Approach for Unsupervised Domain Adaptation","date":"2018-11-19","arxiv_id":"1811.07456","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/visual-domain-adaptation-with-manifold","slug":"visual-domain-adaptation-with-manifold","title":"Visual Domain Adaptation with Manifold Embedded Distribution Alignment","date":"2018-07-19","arxiv_id":"1807.07258","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-transfer-learning-with-joint-adaptation","slug":"deep-transfer-learning-with-joint-adaptation","title":"Deep Transfer Learning with Joint Adaptation Networks","date":"2016-05-21","arxiv_id":"1605.06636","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-residual-learning-for-image-recognition","slug":"deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","arxiv_id":"1512.03385","rows_on_this_dataset":1,"code_links":484,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":377,"samples_ran":254,"samples_constructed":108,"samples_ran_checked":163,"samples_ran_instrument_failed":91,"samples_unverified":123,"pointer_only_for_licence":193,"official":{"repos":["KaimingHe/resnet-1k-layers"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-residual-learning-for-image-recognition#ran","syntology_url":"https://syntology.ai/paper/1512.03385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.03385"}}}},{"paper":"/paper/domain-adversarial-training-of-neural","slug":"domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","arxiv_id":"1505.07818","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":52,"samples_ran":35,"samples_constructed":11,"samples_ran_checked":18,"samples_ran_instrument_failed":17,"samples_unverified":17,"pointer_only_for_licence":22,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-adversarial-training-of-neural#ran","syntology_url":"https://syntology.ai/paper/1505.07818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.07818"}}}},{"paper":"/paper/learning-transferable-features-with-deep","slug":"learning-transferable-features-with-deep","title":"Learning Transferable Features with Deep Adaptation Networks","date":"2015-02-10","arxiv_id":"1502.02791","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-transferable-features-with-deep#ran","syntology_url":"https://syntology.ai/paper/1502.02791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.02791"}}}},{"paper":"/paper/unsupervised-domain-adaptation-by","slug":"unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","arxiv_id":"1409.7495","rows_on_this_dataset":1,"code_links":22,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":41,"samples_ran":34,"samples_constructed":11,"samples_ran_checked":22,"samples_ran_instrument_failed":12,"samples_unverified":7,"pointer_only_for_licence":14,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-domain-adaptation-by#ran","syntology_url":"https://syntology.ai/paper/1409.7495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.7495"}}}},{"paper":"/paper/imagenet-classification-with-deep","slug":"imagenet-classification-with-deep","title":"ImageNet Classification with Deep Convolutional Neural Networks","date":"2012-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":23,"syntology":null}],"papers_where_code_ran":36,"papers_where_code_ran_first_page":"/dataset/office-home/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/dataset/office-home/papers/2","json":"/dataset/office-home/papers/2.json","rows":6},{"order":"ran","page":1,"of":1,"url":"/dataset/office-home/papers/ran/1","json":"/dataset/office-home/papers/ran/1.json","rows":36}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":38,"samples_harvested":705,"samples_ran":489,"samples_constructed":137,"samples_ran_checked":293,"samples_ran_instrument_failed":196,"samples_unverified":216,"pointer_only_for_licence":328,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":36,"papers_with_a_run_with_no_instrument_failure":27,"papers_where_every_run_was_an_instrument_failure":9,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"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'","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)"},"since_archive_judged":{"papers":3,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/domain-adaptation-on-office-home","since_archive":"/sota/domain-adaptation-on-office-home#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-office-home","since_archive":"/sota/unsupervised-domain-adaptation-on-office-home#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/universal-domain-adaptation-on-office-home","since_archive":"/sota/universal-domain-adaptation-on-office-home#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/partial-domain-adaptation-on-office-home","since_archive":"/sota/partial-domain-adaptation-on-office-home#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"16856ee31119d93969bbbed4ea5ab81c0ee661af4939ee3309465ed76802cd2e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}