{"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":"/task/universal-domain-adaptation","name":"Universal Domain Adaptation","slug":"universal-domain-adaptation","description_markdown":null,"categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":55,"papers_with_code":31,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/universal-domain-adaptation-on-office-home","slug":"universal-domain-adaptation-on-office-home","dataset":"Office-Home","dataset_url":"/dataset/office-home","rows_in_archive":14,"metrics":["H-Score","Source-free","VLM"],"first_row_in_archive_order":{"model":"TASC","paper_title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","paper_url":"/paper/target-semantics-clustering-via-text-1","paper_date":"2025-06-04","arxiv_id":"2506.03521","code_links":[{"title":"Sapphire-356/TASC","url":"https://github.com/Sapphire-356/TASC"}],"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/universal-domain-adaptation-on-visda2017","slug":"universal-domain-adaptation-on-visda2017","dataset":"VisDA2017","dataset_url":"/dataset/visda-2017","rows_in_archive":13,"metrics":["H-score","Source-free"],"first_row_in_archive_order":{"model":"TASC","paper_title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","paper_url":"/paper/target-semantics-clustering-via-text-1","paper_date":"2025-06-04","arxiv_id":"2506.03521","code_links":[{"title":"Sapphire-356/TASC","url":"https://github.com/Sapphire-356/TASC"}],"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/universal-domain-adaptation-on-domainnet","slug":"universal-domain-adaptation-on-domainnet","dataset":"DomainNet","dataset_url":"/dataset/domainnet","rows_in_archive":12,"metrics":["H-Score","Source-free"],"first_row_in_archive_order":{"model":"TASC","paper_title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","paper_url":"/paper/target-semantics-clustering-via-text-1","paper_date":"2025-06-04","arxiv_id":"2506.03521","code_links":[{"title":"Sapphire-356/TASC","url":"https://github.com/Sapphire-356/TASC"}],"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/universal-domain-adaptation-on-office-31","slug":"universal-domain-adaptation-on-office-31","dataset":"Office-31","dataset_url":"/dataset/office-31","rows_in_archive":12,"metrics":["H-score","Source-Free"],"first_row_in_archive_order":{"model":"UniAM","paper_title":"Universal Domain Adaptation via Compressive Attention Matching","paper_url":"/paper/universal-domain-adaptation-via-compressive","paper_date":"2023-04-24","arxiv_id":"2304.11862","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/office-home","name":"Office-Home","full_name":"","num_papers_in_archive":1074},{"url":"/dataset/domainnet","name":"DomainNet","full_name":"DomainNet","num_papers_in_archive":753},{"url":"/dataset/office-31","name":"Office-31","full_name":"Office Dataset","num_papers_in_archive":643},{"url":"/dataset/visda-2017","name":"VisDA-2017","full_name":"VisDA-2017","num_papers_in_archive":223},{"url":"/dataset/all-day-cityscapes","name":"All-day CityScapes","full_name":"","num_papers_in_archive":3}],"subtasks":[],"parent_tasks":[{"url":"/task/domain-adaptation","name":"Domain Adaptation"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":55,"of":55,"of_with_code":31,"tagged_in_all":55,"counts":{"archive_papers_tagged":55,"with_a_code_link":31,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":55,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":1,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/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","repositories_listed":3,"syntology":null},{"url":"/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","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/glc-source-free-universal-domain-adaptation","slug":"glc-source-free-universal-domain-adaptation","title":"GLC++: Source-Free Universal Domain Adaptation through Global-Local Clustering and Contrastive Affinity Learning","date":"2024-03-21","arxiv_id":"2403.14410","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":1,"n_instrument":8,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/paper/analysis-of-pseudo-labeling-for-online-source","slug":"analysis-of-pseudo-labeling-for-online-source","title":"Analysis of Pseudo-Labeling for Online Source-Free Universal Domain Adaptation","date":"2025-04-16","arxiv_id":"2504.11992","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-transport-and-adaptive-thresholding","slug":"optimal-transport-and-adaptive-thresholding","title":"Optimal Transport and Adaptive Thresholding for Universal Domain Adaptation on Time Series","date":"2025-03-14","arxiv_id":"2503.11217","repositories_listed":1,"syntology":null},{"url":"/paper/memory-efficient-pseudo-labeling-for-online","slug":"memory-efficient-pseudo-labeling-for-online","title":"Memory-Efficient Pseudo-Labeling for Online Source-Free Universal Domain Adaptation using a Gaussian Mixture Model","date":"2024-07-19","arxiv_id":"2407.14208","repositories_listed":1,"syntology":null},{"url":"/paper/universal-semi-supervised-domain-adaptation","slug":"universal-semi-supervised-domain-adaptation","title":"Universal Semi-Supervised Domain Adaptation by Mitigating Common-Class Bias","date":"2024-03-17","arxiv_id":"2403.11234","repositories_listed":1,"syntology":null},{"url":"/paper/comet-contrastive-mean-teacher-for-online","slug":"comet-contrastive-mean-teacher-for-online","title":"COMET: Contrastive Mean Teacher for Online Source-Free Universal Domain Adaptation","date":"2024-01-31","arxiv_id":"2401.17728","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/universal-domain-adaptation-for-robust","slug":"universal-domain-adaptation-for-robust","title":"Universal Domain Adaptation for Robust Handling of Distributional Shifts in NLP","date":"2023-10-23","arxiv_id":"2310.14849","repositories_listed":1,"syntology":null},{"url":"/paper/coca-classifier-oriented-calibration-for","slug":"coca-classifier-oriented-calibration-for","title":"COCA: Classifier-Oriented Calibration via Textual Prototype for Source-Free Universal Domain Adaptation","date":"2023-08-21","arxiv_id":"2308.10450","repositories_listed":1,"syntology":null},{"url":"/paper/universal-domain-adaptation-from-foundation","slug":"universal-domain-adaptation-from-foundation","title":"Universal Domain Adaptation from Foundation Models: A Baseline Study","date":"2023-05-18","arxiv_id":"2305.11092","repositories_listed":1,"syntology":null},{"url":"/paper/noisy-universal-domain-adaptation-via","slug":"noisy-universal-domain-adaptation-via","title":"Noisy Universal Domain Adaptation via Divergence Optimization for Visual Recognition","date":"2023-04-20","arxiv_id":"2304.10333","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adaptation-for-time-series-under","slug":"domain-adaptation-for-time-series-under","title":"Domain Adaptation for Time Series Under Feature and Label Shifts","date":"2023-02-06","arxiv_id":"2302.03133","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/domain-adaptation-for-time-series-under#ran","syntology_url":"https://syntology.ai/paper/2302.03133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03133"}},"official":{"repos":["mims-harvard/raincoat"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/deepastrouda-semi-supervised-universal-domain","slug":"deepastrouda-semi-supervised-universal-domain","title":"DeepAstroUDA: Semi-Supervised Universal Domain Adaptation for Cross-Survey Galaxy Morphology Classification and Anomaly Detection","date":"2023-02-03","arxiv_id":"2302.02005","repositories_listed":1,"syntology":null},{"url":"/paper/universal-domain-adaptation-for-remote","slug":"universal-domain-adaptation-for-remote","title":"Universal Domain Adaptation for Remote Sensing Image Scene Classification","date":"2023-01-26","arxiv_id":"2301.11387","repositories_listed":1,"syntology":null},{"url":"/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,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-domain-adaptation-for-cross","slug":"semi-supervised-domain-adaptation-for-cross","title":"Semi-Supervised Domain Adaptation for Cross-Survey Galaxy Morphology Classification and Anomaly Detection","date":"2022-11-01","arxiv_id":"2211.00677","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/semi-supervised-domain-adaptation-for-cross#ran","syntology_url":"https://syntology.ai/paper/2211.00677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.00677"}},"official":{"repos":["deepskies/deepastrouda"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/hyperdomainnet-universal-domain-adaptation","slug":"hyperdomainnet-universal-domain-adaptation","title":"HyperDomainNet: Universal Domain Adaptation for Generative Adversarial Networks","date":"2022-10-17","arxiv_id":"2210.08884","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/hyperdomainnet-universal-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2210.08884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08884"}},"official":{"repos":["macderru/hyperdomainnet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/one-ring-to-bring-them-all-towards-open-set","slug":"one-ring-to-bring-them-all-towards-open-set","title":"OneRing: A Simple Method for Source-free Open-partial Domain Adaptation","date":"2022-06-07","arxiv_id":"2206.03600","repositories_listed":1,"syntology":null},{"url":"/paper/visda-2021-competition-universal-domain","slug":"visda-2021-competition-universal-domain","title":"VisDA-2021 Competition Universal Domain Adaptation to Improve Performance on Out-of-Distribution Data","date":"2021-07-23","arxiv_id":"2107.11011","repositories_listed":1,"syntology":null},{"url":"/paper/distance-based-hyperspherical-classification","slug":"distance-based-hyperspherical-classification","title":"Distance-based Hyperspherical Classification for Multi-source Open-Set Domain Adaptation","date":"2021-07-05","arxiv_id":"2107.02067","repositories_listed":1,"syntology":null},{"url":"/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,"repositories_listed":1,"syntology":null},{"url":"/paper/on-universal-black-box-domain-adaptation","slug":"on-universal-black-box-domain-adaptation","title":"On Universal Black-Box Domain Adaptation","date":"2021-04-10","arxiv_id":"2104.04665","repositories_listed":1,"syntology":null},{"url":"/paper/divergence-optimization-for-noisy-universal","slug":"divergence-optimization-for-noisy-universal","title":"Divergence Optimization for Noisy Universal Domain Adaptation","date":"2021-04-01","arxiv_id":"2104.00246","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/divergence-optimization-for-noisy-universal#ran","syntology_url":"https://syntology.ai/paper/2104.00246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00246"}},"official":null}},{"url":"/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,"repositories_listed":1,"syntology":null},{"url":"/paper/universal-domain-adaptation-through-self","slug":"universal-domain-adaptation-through-self","title":"Universal Domain Adaptation through Self Supervision","date":"2020-02-19","arxiv_id":"2002.07953","repositories_listed":1,"syntology":null},{"url":null,"slug":"universal-domain-adaptation-for-semantic","title":"Universal Domain Adaptation for Semantic Segmentation","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-source-private-bias-in-extreme","title":"Reducing Source-Private Bias in Extreme Universal Domain Adaptation","date":"2024-10-15","arxiv_id":"2410.11271","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-01089","title":"Prototypical Partial Optimal Transport for Universal Domain Adaptation","date":"2024-08-02","arxiv_id":"2408.01089","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-unsupervised-domain","title":"A Unified Framework for Unsupervised Domain Adaptation based on Instance Weighting","date":"2023-12-08","arxiv_id":"2312.05024","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-assisted-sub-prototype-mining-for","title":"Memory-Assisted Sub-Prototype Mining for Universal Domain Adaptation","date":"2023-10-09","arxiv_id":"2310.05453","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-universal-domain-adaptation-with","title":"Generalized Universal Domain Adaptation with Generative Flow Networks","date":"2023-05-08","arxiv_id":"2305.04466","repositories_listed":0,"syntology":null},{"url":"/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","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-classifiers-of-prototypes-and","title":"Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation","date":"2022-12-16","arxiv_id":"2212.08355","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-novel-category-discovery-over","title":"Boosting Novel Category Discovery Over Domains with Soft Contrastive Learning and All-in-One Classifier","date":"2022-11-21","arxiv_id":"2211.11262","repositories_listed":0,"syntology":null},{"url":null,"slug":"subsidiary-prototype-alignment-for-universal","title":"Subsidiary Prototype Alignment for Universal Domain Adaptation","date":"2022-10-28","arxiv_id":"2210.15909","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-framework-based-on-unknown-estimation","title":"Provably Uncertainty-Guided Universal Domain Adaptation","date":"2022-09-19","arxiv_id":"2209.09616","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-inter-sample-affinity-for","title":"Exploiting Inter-Sample Affinity for Knowability-Aware Universal Domain Adaptation","date":"2022-07-19","arxiv_id":"2207.09280","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-adaptive-unknown-authentication-for","title":"Towards Adaptive Unknown Authentication for Universal Domain Adaptation by Classifier Paradox","date":"2022-07-10","arxiv_id":"2207.04494","repositories_listed":0,"syntology":null},{"url":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","repositories_listed":0,"syntology":null},{"url":"/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,"repositories_listed":0,"syntology":null},{"url":"/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","repositories_listed":0,"syntology":null},{"url":null,"slug":"2nd-place-solution-for-visda-2021-challenge","title":"2nd Place Solution for VisDA 2021 Challenge -- Universally Domain Adaptive Image Recognition","date":"2021-10-27","arxiv_id":"2110.14240","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-domain-adaptation-in-ordinal","title":"Universal Domain Adaptation in Ordinal Regression","date":"2021-06-22","arxiv_id":"2106.11576","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-universal-domain-adaptation","title":"Active Universal Domain Adaptation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-multi-source-domain-adaptation","title":"Universal Multi-Source Domain Adaptation","date":"2020-11-05","arxiv_id":"2011.02594","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-class-labeling-structure-for","title":"Unveiling Class-Labeling Structure for Universal Domain Adaptation","date":"2020-10-10","arxiv_id":"2010.04873","repositories_listed":0,"syntology":null},{"url":null,"slug":"buda-boundless-unsupervised-domain-adaptation","title":"Handling new target classes in semantic segmentation with domain adaptation","date":"2020-04-02","arxiv_id":"2004.01130","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sample-selection-approach-for-universal","title":"A Sample Selection Approach for Universal Domain Adaptation","date":"2020-01-14","arxiv_id":"2001.05071","repositories_listed":0,"syntology":null},{"url":"/paper/universal-domain-adaptation","slug":"universal-domain-adaptation","title":"Universal Domain Adaptation","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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/universal-domain-adaptation-on-office-home","since_archive":"/sota/universal-domain-adaptation-on-office-home#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/universal-domain-adaptation-on-domainnet","since_archive":"/sota/universal-domain-adaptation-on-domainnet#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/universal-domain-adaptation-on-office-31","since_archive":"/sota/universal-domain-adaptation-on-office-31#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/task/universal-domain-adaptation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/universal-domain-adaptation/papers/ran/1","json":"/task/universal-domain-adaptation/papers/ran/1.json","rows":9}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"0767348a94b5b30d1525afc00f3cc7c5d1cda11fcb3af7c7ebcf4f24c4d34581","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}