{"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/visda-2017","name":"VisDA-2017","full_name":"VisDA-2017","description_markdown":"**VisDA-2017** is a simulation-to-real dataset for domain adaptation with over 280,000 images across 12 categories in the training, validation and testing domains. The training images are generated from the same object under different circumstances, while the validation images are collected from MSCOCO..\r\n\r\nSource: [Gradually Vanishing Bridge for Adversarial Domain Adaptation](https://arxiv.org/abs/2003.13183)\r\nImage Source: [http://ai.bu.edu/visda-2017/](http://ai.bu.edu/visda-2017/)","description_withheld":null,"homepage":"http://ai.bu.edu/visda-2017/","introduced_date":"2017-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/visda-the-visual-domain-adaptation-challenge","title":"VisDA: The Visual Domain Adaptation Challenge","first_author":"Xingchao Peng","url":null},"license":{"name":"Custom","url":"http://ai.bu.edu/visda-2017/"},"modalities":[{"name":"Images","url":"/datasets/modality/images"}],"tasks":[{"name":"Semantic Segmentation","url":"/task/semantic-segmentation","datasets_with_task":"/datasets/task/semantic-segmentation"},{"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":"Source-Free Domain Adaptation","url":"/task/source-free-domain-adaptation","datasets_with_task":"/datasets/task/source-free-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":"Semi-supervised Domain Adaptation","url":"/task/semi-supervised-domain-adaptation","datasets_with_task":"/datasets/task/semi-supervised-domain-adaptation"}],"languages":[],"variants":["VisDA2017","VisDA-2017"],"data_loaders":[],"num_papers_in_archive":223,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/domain-adaptation-on-visda2017","task":"Domain Adaptation","dataset_variant":"VisDA2017","rows":28,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"FFTAT","paper":"/paper/feature-fusion-transferability-aware","metrics":{"Accuracy":"93.8"},"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-visda2017","task":"Universal Domain Adaptation","dataset_variant":"VisDA2017","rows":13,"metrics":["H-score","Source-free"],"first_row_in_archive_order":{"model":"TASC","paper":"/paper/target-semantics-clustering-via-text-1","metrics":{"H-score":"90.36","Source-free":"no"},"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/unsupervised-domain-adaptation-on-visda2017","task":"Unsupervised Domain Adaptation","dataset_variant":"VisDA2017","rows":13,"metrics":["Accuracy","Average Accuracy"],"first_row_in_archive_order":{"model":"FFTAT","paper":"/paper/feature-fusion-transferability-aware","metrics":{"Accuracy":"93.8"},"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/source-free-domain-adaptation-on-visda-2017","task":"Source-Free Domain Adaptation","dataset_variant":"VisDA-2017","rows":10,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"RCL","paper":"/paper/empowering-source-free-domain-adaptation-with","metrics":{"Accuracy":"93.2"},"code_links":[{"title":"Dong-Jie-Chen/RCL","url":"https://github.com/Dong-Jie-Chen/RCL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/partial-domain-adaptation-on-visda2017","task":"Partial Domain Adaptation","dataset_variant":"VisDA2017","rows":3,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"SPDA","paper":"/paper/selective-partial-domain-adaptation","metrics":{"Accuracy (%)":"87.69"},"code_links":[{"title":"Pengxin-Guo/SPDA","url":"https://github.com/Pengxin-Guo/SPDA"},{"title":"gpx333/spda","url":"https://github.com/gpx333/spda"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-visda-2017-1","task":"Unsupervised Domain Adaptation","dataset_variant":"VisDA-2017","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"TransAdapter","paper":"/paper/transadapter-vision-transformer-for-feature","metrics":{"Accuracy":"91.2"},"code_links":[{"title":"enesdoruk/TransAdapter","url":"https://github.com/enesdoruk/TransAdapter"}]},"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":1,"rows_per_page":100,"shown":53,"of":53,"counts":{"papers_with_a_benchmark_row":53,"with_a_code_link":46,"where_syntology_ran_a_sample":19,"not_listed_spam_title":0,"listed":53,"listed_where_code_ran":19,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":6,"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/shuffle-patchmix-augmentation-with-confidence","slug":"shuffle-patchmix-augmentation-with-confidence","title":"Shuffle PatchMix Augmentation with Confidence-Margin Weighted Pseudo-Labels for Enhanced Source-Free Domain Adaptation","date":"2025-05-30","arxiv_id":"2505.24216","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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":2,"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":2,"code_links":2,"syntology":null},{"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":3,"code_links":1,"syntology":null},{"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/sf-da-2-source-free-domain-adaptation-through","slug":"sf-da-2-source-free-domain-adaptation-through","title":"SF(DA)$^2$: Source-free Domain Adaptation Through the Lens of Data Augmentation","date":"2024-03-16","arxiv_id":"2403.10834","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["shinyflight/sfda2"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/sf-da-2-source-free-domain-adaptation-through#ran","syntology_url":"https://syntology.ai/paper/2403.10834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10834"}}}},{"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/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/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/c-sfda-a-curriculum-learning-aided-self","slug":"c-sfda-a-curriculum-learning-aided-self","title":"C-SFDA: A Curriculum Learning Aided Self-Training Framework for Efficient Source Free Domain Adaptation","date":"2023-03-30","arxiv_id":"2303.17132","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["nazmul-karim170/C-SFDA_Source-Free-Domain-Adaptation"],"state":"official (archive's flag): 3 ran","n_ran":3,"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/c-sfda-a-curriculum-learning-aided-self#ran","syntology_url":"https://syntology.ai/paper/2303.17132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17132"}}}},{"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/unsupervised-domain-adaptation-via-distilled","slug":"unsupervised-domain-adaptation-via-distilled","title":"Unsupervised Domain Adaptation via Distilled Discriminative Clustering","date":"2023-02-23","arxiv_id":"2302.11984","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["huitangtang/disclusterda"],"state":"official (archive's flag): 7 ran","n_ran":7,"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/unsupervised-domain-adaptation-via-distilled#ran","syntology_url":"https://syntology.ai/paper/2302.11984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11984"}}}},{"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/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/divide-and-contrast-source-free-domain","slug":"divide-and-contrast-source-free-domain","title":"Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning","date":"2022-11-12","arxiv_id":"2211.06612","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":7,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":11,"pointer_only_for_licence":15,"official":{"repos":["zyezhang/dac"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/divide-and-contrast-source-free-domain#ran","syntology_url":"https://syntology.ai/paper/2211.06612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06612"}}}},{"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/visual-prompt-tuning-for-test-time-domain","slug":"visual-prompt-tuning-for-test-time-domain","title":"Visual Prompt Tuning for Test-time Domain Adaptation","date":"2022-10-10","arxiv_id":"2210.04831","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/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/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/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/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/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/exploiting-the-intrinsic-neighborhood","slug":"exploiting-the-intrinsic-neighborhood","title":"Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptation","date":"2021-10-08","arxiv_id":"2110.04202","rows_on_this_dataset":1,"code_links":2,"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":["albert0147/sfda_neighbors"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploiting-the-intrinsic-neighborhood#ran","syntology_url":"https://syntology.ai/paper/2110.04202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04202"}}}},{"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":1,"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/generalized-source-free-domain-adaptation","slug":"generalized-source-free-domain-adaptation","title":"Generalized Source-free Domain Adaptation","date":"2021-08-03","arxiv_id":"2108.01614","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":["Albert0147/G-SFDA"],"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/generalized-source-free-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2108.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01614"}}}},{"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/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/source-data-absent-unsupervised-domain","slug":"source-data-absent-unsupervised-domain","title":"Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer","date":"2020-12-14","arxiv_id":"2012.07297","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["tim-learn/SHOT-plus"],"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","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/source-data-absent-unsupervised-domain#ran","syntology_url":"https://syntology.ai/paper/2012.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07297"}}}},{"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/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":1,"code_links":1,"syntology":null},{"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/drop-to-adapt-learning-discriminative","slug":"drop-to-adapt-learning-discriminative","title":"Drop to Adapt: Learning Discriminative Features for Unsupervised Domain Adaptation","date":"2019-10-12","arxiv_id":"1910.05562","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/confidence-regularized-self-training","slug":"confidence-regularized-self-training","title":"Confidence Regularized Self-Training","date":"2019-08-26","arxiv_id":"1908.09822","rows_on_this_dataset":2,"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":["yzou2/CRST"],"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/confidence-regularized-self-training#ran","syntology_url":"https://syntology.ai/paper/1908.09822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09822"}}}},{"paper":"/paper/d-sne-domain-adaptation-using-stochastic","slug":"d-sne-domain-adaptation-using-stochastic","title":"d-SNE: Domain Adaptation Using Stochastic Neighborhood Embedding","date":"2019-06-01","arxiv_id":null,"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/sliced-wasserstein-discrepancy-for","slug":"sliced-wasserstein-discrepancy-for","title":"Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation","date":"2019-03-10","arxiv_id":"1903.04064","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/contrastive-adaptation-network-for","slug":"contrastive-adaptation-network-for","title":"Contrastive Adaptation Network for Unsupervised Domain Adaptation","date":"2019-01-04","arxiv_id":"1901.00976","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/contrastive-adaptation-network-for#ran","syntology_url":"https://syntology.ai/paper/1901.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00976"}}}},{"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/deepjdot-deep-joint-distribution-optimal","slug":"deepjdot-deep-joint-distribution-optimal","title":"DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation","date":"2018-03-27","arxiv_id":"1803.10081","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepjdot-deep-joint-distribution-optimal#ran","syntology_url":"https://syntology.ai/paper/1803.10081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10081"}}}},{"paper":"/paper/self-ensembling-for-visual-domain-adaptation","slug":"self-ensembling-for-visual-domain-adaptation","title":"Self-ensembling for visual domain adaptation","date":"2017-06-16","arxiv_id":"1706.05208","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/conditional-adversarial-domain-adaptation","slug":"conditional-adversarial-domain-adaptation","title":"Conditional Adversarial Domain Adaptation","date":"2017-05-26","arxiv_id":"1705.10667","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["thuml/CDAN"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/conditional-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1705.10667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.10667"}}}},{"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}],"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/shuffle-patchmix-augmentation-with-confidence","slug":"shuffle-patchmix-augmentation-with-confidence","title":"Shuffle PatchMix Augmentation with Confidence-Margin Weighted Pseudo-Labels for Enhanced Source-Free Domain Adaptation","date":"2025-05-30","arxiv_id":"2505.24216","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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":2,"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":2,"code_links":2,"syntology":null},{"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":3,"code_links":1,"syntology":null},{"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/sf-da-2-source-free-domain-adaptation-through","slug":"sf-da-2-source-free-domain-adaptation-through","title":"SF(DA)$^2$: Source-free Domain Adaptation Through the Lens of Data Augmentation","date":"2024-03-16","arxiv_id":"2403.10834","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["shinyflight/sfda2"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/sf-da-2-source-free-domain-adaptation-through#ran","syntology_url":"https://syntology.ai/paper/2403.10834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10834"}}}},{"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/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/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/c-sfda-a-curriculum-learning-aided-self","slug":"c-sfda-a-curriculum-learning-aided-self","title":"C-SFDA: A Curriculum Learning Aided Self-Training Framework for Efficient Source Free Domain Adaptation","date":"2023-03-30","arxiv_id":"2303.17132","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["nazmul-karim170/C-SFDA_Source-Free-Domain-Adaptation"],"state":"official (archive's flag): 3 ran","n_ran":3,"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/c-sfda-a-curriculum-learning-aided-self#ran","syntology_url":"https://syntology.ai/paper/2303.17132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17132"}}}},{"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/unsupervised-domain-adaptation-via-distilled","slug":"unsupervised-domain-adaptation-via-distilled","title":"Unsupervised Domain Adaptation via Distilled Discriminative Clustering","date":"2023-02-23","arxiv_id":"2302.11984","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["huitangtang/disclusterda"],"state":"official (archive's flag): 7 ran","n_ran":7,"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/unsupervised-domain-adaptation-via-distilled#ran","syntology_url":"https://syntology.ai/paper/2302.11984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11984"}}}},{"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/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/divide-and-contrast-source-free-domain","slug":"divide-and-contrast-source-free-domain","title":"Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning","date":"2022-11-12","arxiv_id":"2211.06612","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":7,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":11,"pointer_only_for_licence":15,"official":{"repos":["zyezhang/dac"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/divide-and-contrast-source-free-domain#ran","syntology_url":"https://syntology.ai/paper/2211.06612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06612"}}}},{"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/visual-prompt-tuning-for-test-time-domain","slug":"visual-prompt-tuning-for-test-time-domain","title":"Visual Prompt Tuning for Test-time Domain Adaptation","date":"2022-10-10","arxiv_id":"2210.04831","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/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/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/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/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/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/exploiting-the-intrinsic-neighborhood","slug":"exploiting-the-intrinsic-neighborhood","title":"Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptation","date":"2021-10-08","arxiv_id":"2110.04202","rows_on_this_dataset":1,"code_links":2,"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":["albert0147/sfda_neighbors"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploiting-the-intrinsic-neighborhood#ran","syntology_url":"https://syntology.ai/paper/2110.04202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04202"}}}},{"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":1,"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/generalized-source-free-domain-adaptation","slug":"generalized-source-free-domain-adaptation","title":"Generalized Source-free Domain Adaptation","date":"2021-08-03","arxiv_id":"2108.01614","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":["Albert0147/G-SFDA"],"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/generalized-source-free-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2108.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01614"}}}},{"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/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/source-data-absent-unsupervised-domain","slug":"source-data-absent-unsupervised-domain","title":"Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer","date":"2020-12-14","arxiv_id":"2012.07297","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["tim-learn/SHOT-plus"],"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","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/source-data-absent-unsupervised-domain#ran","syntology_url":"https://syntology.ai/paper/2012.07297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07297"}}}},{"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/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":1,"code_links":1,"syntology":null},{"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/drop-to-adapt-learning-discriminative","slug":"drop-to-adapt-learning-discriminative","title":"Drop to Adapt: Learning Discriminative Features for Unsupervised Domain Adaptation","date":"2019-10-12","arxiv_id":"1910.05562","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/confidence-regularized-self-training","slug":"confidence-regularized-self-training","title":"Confidence Regularized Self-Training","date":"2019-08-26","arxiv_id":"1908.09822","rows_on_this_dataset":2,"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":["yzou2/CRST"],"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/confidence-regularized-self-training#ran","syntology_url":"https://syntology.ai/paper/1908.09822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09822"}}}},{"paper":"/paper/d-sne-domain-adaptation-using-stochastic","slug":"d-sne-domain-adaptation-using-stochastic","title":"d-SNE: Domain Adaptation Using Stochastic Neighborhood Embedding","date":"2019-06-01","arxiv_id":null,"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/sliced-wasserstein-discrepancy-for","slug":"sliced-wasserstein-discrepancy-for","title":"Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation","date":"2019-03-10","arxiv_id":"1903.04064","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/contrastive-adaptation-network-for","slug":"contrastive-adaptation-network-for","title":"Contrastive Adaptation Network for Unsupervised Domain Adaptation","date":"2019-01-04","arxiv_id":"1901.00976","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/contrastive-adaptation-network-for#ran","syntology_url":"https://syntology.ai/paper/1901.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00976"}}}},{"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/deepjdot-deep-joint-distribution-optimal","slug":"deepjdot-deep-joint-distribution-optimal","title":"DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation","date":"2018-03-27","arxiv_id":"1803.10081","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepjdot-deep-joint-distribution-optimal#ran","syntology_url":"https://syntology.ai/paper/1803.10081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10081"}}}},{"paper":"/paper/self-ensembling-for-visual-domain-adaptation","slug":"self-ensembling-for-visual-domain-adaptation","title":"Self-ensembling for visual domain adaptation","date":"2017-06-16","arxiv_id":"1706.05208","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/conditional-adversarial-domain-adaptation","slug":"conditional-adversarial-domain-adaptation","title":"Conditional Adversarial Domain Adaptation","date":"2017-05-26","arxiv_id":"1705.10667","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["thuml/CDAN"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/conditional-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1705.10667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.10667"}}}},{"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}],"papers_where_code_ran":19,"papers_where_code_ran_first_page":"/dataset/visda-2017/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":"ran","page":1,"of":1,"url":"/dataset/visda-2017/papers/ran/1","json":"/dataset/visda-2017/papers/ran/1.json","rows":19}],"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":22,"samples_harvested":140,"samples_ran":87,"samples_constructed":8,"samples_ran_checked":48,"samples_ran_instrument_failed":39,"samples_unverified":53,"pointer_only_for_licence":44,"papers_with_no_sample_that_ran":3,"papers_with_a_sample_that_ran":19,"papers_with_a_run_with_no_instrument_failure":13,"papers_where_every_run_was_an_instrument_failure":6,"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":1,"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-visda2017","since_archive":"/sota/domain-adaptation-on-visda2017#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-visda2017","since_archive":"/sota/unsupervised-domain-adaptation-on-visda2017#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":"3a28137431fd7d8b3845c3e25a4b4680178c08f6e24291ba1ded475c7b75c6bb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}