{"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":0,"n_unverified":11,"n_pointer_only":0}}},{"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":0,"n_unverified":11,"n_pointer_only":0}}},{"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":0,"n_unverified":11,"n_pointer_only":0}}},{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":31,"tagged_in_all":55,"items":[{"url":"/paper/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","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_unverified":0,"n_pointer_only":2}},{"url":"/paper/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","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_unverified":2,"n_pointer_only":9}},{"url":"/paper/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":4,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/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":0,"n_unverified":11,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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":3,"n_unverified":14,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":2,"n_pointer_only":0}},{"url":"/paper/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":1,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/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_unverified":8,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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_unverified":0,"n_pointer_only":3}},{"url":"/paper/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}],"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}