{"url":"/sota/universal-domain-adaptation-on-domainnet","task":{"name":"Universal Domain Adaptation","url":"/task/universal-domain-adaptation","note":null},"dataset":{"name":"DomainNet","url":"/dataset/domainnet"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":null,"description_from":null,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["H-Score","Source-free"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"H-Score":"higher","Source-free":null}},"counts":{"rows":12,"rows_with_code":9,"rows_with_paper_page":12,"rows_dated":11,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"TASC","metrics":{"H-Score":"73.28","Source-free":"no"},"uses_additional_data":false,"paper_date":"2025-06-04","paper":"/paper/target-semantics-clustering-via-text-1","paper_url":"https://arxiv.org/abs/2506.03521v1","paper_title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","code":"https://github.com/Sapphire-356/TASC","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":11,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"UniAM","metrics":{"H-Score":"61.52","Source-free":"no"},"uses_additional_data":false,"paper_date":"2023-04-24","paper":"/paper/universal-domain-adaptation-via-compressive","paper_url":"https://arxiv.org/abs/2304.11862v4","paper_title":"Universal Domain Adaptation via Compressive Attention Matching","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"GLC","metrics":{"H-Score":"55.1","Source-free":"yes"},"uses_additional_data":false,"paper_date":"2023-03-13","paper":"/paper/upcycling-models-under-domain-and-category","paper_url":"https://arxiv.org/abs/2303.07110v1","paper_title":"Upcycling Models under Domain and Category Shift","code":"https://github.com/ispc-lab/glc","n_code_links":3,"syntology":null},{"rank_in_archive_order":4,"model":"UniOT","metrics":{"H-Score":"52.04","Source-free":"no"},"uses_additional_data":false,"paper_date":"2022-10-31","paper":"/paper/unified-optimal-transport-framework-for","paper_url":"https://arxiv.org/abs/2210.17067v2","paper_title":"Unified Optimal Transport Framework for Universal Domain Adaptation","code":"https://github.com/changwxx/uniot-for-unida","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"SAN","metrics":{"H-Score":"52.0","Source-free":"no"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/boosting-novel-category-discovery-over-1","paper_url":"http://openaccess.thecvf.com//content/ICCV2023/html/Zang_Boosting_Novel_Category_Discovery_Over_Domains_with_Soft_Contrastive_Learning_ICCV_2023_paper.html","paper_title":"Boosting Novel Category Discovery Over Domains with Soft Contrastive Learning and All in One Classifier","code":"https://github.com/zangzelin/code_san_share","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"LEAD","metrics":{"H-Score":"50.8","Source-free":"yes"},"uses_additional_data":false,"paper_date":"2024-03-06","paper":"/paper/lead-learning-decomposition-for-source-free","paper_url":"https://arxiv.org/abs/2403.03421v1","paper_title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","code":"https://github.com/ispc-lab/lead","n_code_links":2,"syntology":{"n_ran":9,"n_unverified":2,"n_samples":11,"n_pointer_only_licence":9}},{"rank_in_archive_order":7,"model":"OVANet","metrics":{"H-Score":"50.7","Source-free":"no"},"uses_additional_data":false,"paper_date":"2021-04-07","paper":"/paper/ovanet-one-vs-all-network-for-universal","paper_url":"https://arxiv.org/abs/2104.03344v4","paper_title":"OVANet: One-vs-All Network for Universal Domain Adaptation","code":"https://github.com/VisionLearningGroup/OVANet","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":8,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"DCC","metrics":{"H-Score":"49.20","Source-free":"no"},"uses_additional_data":false,"paper_date":"2021-06-05","paper":"/paper/domain-consensus-clustering-for-universal","paper_url":"http://www.guangrui.li/papers/guangruiCVPR2021.pdf","paper_title":"Domain Consensus Clustering for Universal Domain Adaptation","code":"https://github.com/Solacex/Domain-Consensus-Clustering","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"CMU","metrics":{"H-Score":"48.25","Source-free":"no"},"uses_additional_data":false,"paper_date":null,"paper":"/paper/learning-to-detect-open-classes-for-universal","paper_url":"https://www.ecva.net/papers/eccv_2020/papers_ECCV/html/2396_ECCV_2020_paper.php","paper_title":"Learning to Detect Open Classes for Universal Domain Adaptation","code":"https://github.com/thuml/Calibrated-Multiple-Uncertainties","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"UMAD","metrics":{"H-Score":"47.1","Source-free":"yes"},"uses_additional_data":false,"paper_date":"2021-12-16","paper":"/paper/umad-universal-model-adaptation-under-domain","paper_url":"https://arxiv.org/abs/2112.08553v1","paper_title":"UMAD: Universal Model Adaptation under Domain and Category Shift","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":11,"model":"UAN","metrics":{"H-Score":"40.98","Source-free":"no"},"uses_additional_data":false,"paper_date":"2019-06-01","paper":"/paper/universal-domain-adaptation","paper_url":"http://openaccess.thecvf.com/content_CVPR_2019/html/You_Universal_Domain_Adaptation_CVPR_2019_paper.html","paper_title":"Universal Domain Adaptation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":12,"model":"SHOT-O","metrics":{"H-Score":"32.6","Source-free":"no"},"uses_additional_data":false,"paper_date":"2020-02-20","paper":"/paper/do-we-really-need-to-access-the-source-data","paper_url":"https://arxiv.org/abs/2002.08546v6","paper_title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","code":"https://github.com/tim-learn/SHOT","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":5,"rows_with_any_sample_ran":4,"distinct_papers_with_graph_line":5,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":16,"n_unverified":23,"n_samples":39,"n_pointer_only_licence":11,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":16,"n_unverified":23,"n_samples":39,"n_pointer_only_licence":11,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}