{"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-31","name":"Office-31","full_name":"Office Dataset","description_markdown":"The Office dataset contains 31 object categories in three domains: Amazon, DSLR and Webcam. The 31 categories in the dataset consist of objects commonly encountered in office settings, such as keyboards, file cabinets, and laptops. The Amazon domain contains on average 90 images per class and 2817 images in total. As these images were captured from a website of online merchants, they are captured against clean background and at a unified scale. The DSLR domain contains 498 low-noise high resolution images (4288×2848). There are 5 objects per category. Each object was captured from different viewpoints on average 3 times. For Webcam, the 795 images of low resolution (640×480) exhibit significant noise and color as well as white balance artifacts.\r\n\r\nSource: [Domain Adaptation by Mixture of Alignments of Second- or Higher-Order Scatter Tensors](https://arxiv.org/abs/1611.08195)\r\nImage Source: [https://www.researchgate.net/publication/310953258](https://www.researchgate.net/publication/310953258)","description_withheld":null,"homepage":"https://www.cc.gatech.edu/~judy/domainadapt/","introduced_date":"2010-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Adapting Visual Category Models to New Domains","first_author":null,"url":"https://doi.org/10.1007/978-3-642-15561-1_16"},"license":{"name":"Unknown","url":null},"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":"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":"Unsupervised Domain Adaptationn","url":"/task/unsupervised-domain-adaptationn","datasets_with_task":"/datasets/task/unsupervised-domain-adaptationn"}],"languages":[],"variants":["Office-31"],"data_loaders":[],"num_papers_in_archive":643,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/domain-adaptation-on-office-31","task":"Domain Adaptation","dataset_variant":"Office-31","rows":40,"metrics":["Average Accuracy"],"first_row_in_archive_order":{"model":"FFTAT","paper":"/paper/feature-fusion-transferability-aware","metrics":{"Average Accuracy":"96.0"},"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-31","task":"Universal Domain Adaptation","dataset_variant":"Office-31","rows":12,"metrics":["H-score","Source-Free"],"first_row_in_archive_order":{"model":"UniAM","paper":"/paper/universal-domain-adaptation-via-compressive","metrics":{"H-score":"95.95","Source-Free":"no"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/partial-domain-adaptation-on-office-31","task":"Partial Domain Adaptation","dataset_variant":"Office-31","rows":7,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"SLM","paper":"/paper/select-label-and-mix-learning-discriminative","metrics":{"Accuracy (%)":"98.38"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/multi-target-domain-adaptation-on-office-31","task":"Multi-target Domain Adaptation","dataset_variant":"Office-31","rows":5,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MCDA","paper":"/paper/class-overwhelms-mutual-conditional-blended","metrics":{"Accuracy":"89.6"},"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/unsupervised-domain-adaptation-on-office-31","task":"Unsupervised Domain Adaptation","dataset_variant":"Office-31","rows":5,"metrics":["Accuracy","Avg accuracy"],"first_row_in_archive_order":{"model":"PMTrans","paper":"/paper/patch-mix-transformer-for-unsupervised-domain","metrics":{"Accuracy":"95.3"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/blended-target-domain-adaptation-on-office-31","task":"Blended-target Domain Adaptation","dataset_variant":"Office-31","rows":2,"metrics":["Average Accuracy"],"first_row_in_archive_order":{"model":"MCDA","paper":"/paper/class-overwhelms-mutual-conditional-blended","metrics":{"Average Accuracy":"89.6"},"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/open-set-multi-target-domain-adaptation-on","task":"Open-Set Multi-Target Domain Adaptation","dataset_variant":"Office-31","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":"90.01"},"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":1,"rows_per_page":100,"shown":65,"of":65,"counts":{"papers_with_a_benchmark_row":65,"with_a_code_link":56,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":65,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":8,"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/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/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":1,"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":1,"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/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/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/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/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/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/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/global-local-regularization-via","slug":"global-local-regularization-via","title":"Global-Local Regularization Via Distributional Robustness","date":"2022-03-01","arxiv_id":"2203.00553","rows_on_this_dataset":1,"code_links":1,"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/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/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/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/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/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":2,"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/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/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/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/unsupervised-multi-target-domain-adaptation-2","slug":"unsupervised-multi-target-domain-adaptation-2","title":"Unsupervised Multi-Target Domain Adaptation Through Knowledge Distillation","date":"2020-07-14","arxiv_id":"2007.07077","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/supervised-domain-adaptation-were-we-doing","slug":"supervised-domain-adaptation-were-we-doing","title":"Supervised Domain Adaptation: A Graph Embedding Perspective and a Rectified Experimental Protocol","date":"2020-04-23","arxiv_id":"2004.11262","rows_on_this_dataset":3,"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":1,"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/dual-adversarial-domain-adaptation","slug":"dual-adversarial-domain-adaptation","title":"Dual Adversarial Domain Adaptation","date":"2020-01-01","arxiv_id":"2001.00153","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/discriminative-adversarial-domain-adaptation","slug":"discriminative-adversarial-domain-adaptation","title":"Discriminative Adversarial Domain Adaptation","date":"2019-11-27","arxiv_id":"1911.12036","rows_on_this_dataset":1,"code_links":2,"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/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/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":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":["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/curriculum-based-dropout-discriminator-for","slug":"curriculum-based-dropout-discriminator-for","title":"Curriculum based Dropout Discriminator for Domain Adaptation","date":"2019-07-24","arxiv_id":"1907.10628","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/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/190510748","slug":"190510748","title":"Learning Smooth Representation for Unsupervised Domain Adaptation","date":"2019-05-26","arxiv_id":"1905.10748","rows_on_this_dataset":1,"code_links":1,"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/modified-distribution-alignment-for-domain","slug":"modified-distribution-alignment-for-domain","title":"Modified Distribution Alignment for Domain Adaptation with Pre-trained Inception ResNet","date":"2019-04-04","arxiv_id":"1904.02322","rows_on_this_dataset":1,"code_links":2,"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":2,"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/cluster-alignment-with-a-teacher-for","slug":"cluster-alignment-with-a-teacher-for","title":"Cluster Alignment with a Teacher for Unsupervised Domain Adaptation","date":"2019-03-24","arxiv_id":"1903.09980","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":["thudzj/CAT"],"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/cluster-alignment-with-a-teacher-for#ran","syntology_url":"https://syntology.ai/paper/1903.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09980"}}}},{"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/multi-adversarial-domain-adaptation","slug":"multi-adversarial-domain-adaptation","title":"Multi-Adversarial Domain Adaptation","date":"2018-09-04","arxiv_id":"1809.02176","rows_on_this_dataset":1,"code_links":6,"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":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1809.02176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02176"}}}},{"paper":"/paper/generate-to-adapt-aligning-domains-using","slug":"generate-to-adapt-aligning-domains-using","title":"Generate To Adapt: Aligning Domains using Generative Adversarial Networks","date":"2017-04-06","arxiv_id":"1704.01705","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/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"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"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/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":1,"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":1,"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/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/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/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/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/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/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/global-local-regularization-via","slug":"global-local-regularization-via","title":"Global-Local Regularization Via Distributional Robustness","date":"2022-03-01","arxiv_id":"2203.00553","rows_on_this_dataset":1,"code_links":1,"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/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/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/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/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/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":2,"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/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/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/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/unsupervised-multi-target-domain-adaptation-2","slug":"unsupervised-multi-target-domain-adaptation-2","title":"Unsupervised Multi-Target Domain Adaptation Through Knowledge Distillation","date":"2020-07-14","arxiv_id":"2007.07077","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/supervised-domain-adaptation-were-we-doing","slug":"supervised-domain-adaptation-were-we-doing","title":"Supervised Domain Adaptation: A Graph Embedding Perspective and a Rectified Experimental Protocol","date":"2020-04-23","arxiv_id":"2004.11262","rows_on_this_dataset":3,"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":1,"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/dual-adversarial-domain-adaptation","slug":"dual-adversarial-domain-adaptation","title":"Dual Adversarial Domain Adaptation","date":"2020-01-01","arxiv_id":"2001.00153","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/discriminative-adversarial-domain-adaptation","slug":"discriminative-adversarial-domain-adaptation","title":"Discriminative Adversarial Domain Adaptation","date":"2019-11-27","arxiv_id":"1911.12036","rows_on_this_dataset":1,"code_links":2,"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/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/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":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":["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/curriculum-based-dropout-discriminator-for","slug":"curriculum-based-dropout-discriminator-for","title":"Curriculum based Dropout Discriminator for Domain Adaptation","date":"2019-07-24","arxiv_id":"1907.10628","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/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/190510748","slug":"190510748","title":"Learning Smooth Representation for Unsupervised Domain Adaptation","date":"2019-05-26","arxiv_id":"1905.10748","rows_on_this_dataset":1,"code_links":1,"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/modified-distribution-alignment-for-domain","slug":"modified-distribution-alignment-for-domain","title":"Modified Distribution Alignment for Domain Adaptation with Pre-trained Inception ResNet","date":"2019-04-04","arxiv_id":"1904.02322","rows_on_this_dataset":1,"code_links":2,"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":2,"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/cluster-alignment-with-a-teacher-for","slug":"cluster-alignment-with-a-teacher-for","title":"Cluster Alignment with a Teacher for Unsupervised Domain Adaptation","date":"2019-03-24","arxiv_id":"1903.09980","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":["thudzj/CAT"],"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/cluster-alignment-with-a-teacher-for#ran","syntology_url":"https://syntology.ai/paper/1903.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09980"}}}},{"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/multi-adversarial-domain-adaptation","slug":"multi-adversarial-domain-adaptation","title":"Multi-Adversarial Domain Adaptation","date":"2018-09-04","arxiv_id":"1809.02176","rows_on_this_dataset":1,"code_links":6,"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":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1809.02176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02176"}}}},{"paper":"/paper/generate-to-adapt-aligning-domains-using","slug":"generate-to-adapt-aligning-domains-using","title":"Generate To Adapt: Aligning Domains using Generative Adversarial Networks","date":"2017-04-06","arxiv_id":"1704.01705","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/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"}}}}],"papers_where_code_ran":21,"papers_where_code_ran_first_page":"/dataset/office-31/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/office-31/papers/ran/1","json":"/dataset/office-31/papers/ran/1.json","rows":21}],"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":21,"samples_harvested":516,"samples_ran":353,"samples_constructed":124,"samples_ran_checked":211,"samples_ran_instrument_failed":142,"samples_unverified":163,"pointer_only_for_licence":248,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":21,"papers_with_a_run_with_no_instrument_failure":13,"papers_where_every_run_was_an_instrument_failure":8,"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":2,"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/universal-domain-adaptation-on-office-31","since_archive":"/sota/universal-domain-adaptation-on-office-31#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-office-31","since_archive":"/sota/unsupervised-domain-adaptation-on-office-31#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":"8da624c7f6dc8f3d2daf027a4b1410e202c8a3929ab33fc7478c98d0ea133e35","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}