{"url":"/sota/domain-adaptation-on-office-home","task":{"name":"Domain Adaptation","url":"/task/domain-adaptation","note":null},"dataset":{"name":"Office-Home","url":"/dataset/office-home"},"category":"Computer Vision","categories":["Computer Vision","Methodology"],"category_note":null,"description":"**Domain Adaptation** is the task of adapting models across domains. This is motivated by the challenge where the test and training datasets fall from different data distributions due to some factor. Domain adaptation aims to build machine learning models that can be generalized into a target domain and dealing with the discrepancy across domain distributions. \r\n\r\nFurther readings:\r\n\r\n- [A Brief Review of Domain Adaptation](https://paperswithcode.com/paper/a-brief-review-of-domain-adaptation)\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Unsupervised Image-to-Image Translation Networks](https://arxiv.org/pdf/1703.00848v6.pdf) )</span>","description_from":"task","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":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":29,"rows_with_code":26,"rows_with_paper_page":29,"rows_dated":29,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SWG","metrics":{"Accuracy":"92.3"},"uses_additional_data":false,"paper_date":"2023-12-07","paper":"/paper/combining-inherent-knowledge-of-vision","paper_url":"https://arxiv.org/abs/2312.04066v4","paper_title":"Combining inherent knowledge of vision-language models with unsupervised domain adaptation through strong-weak guidance","code":"https://github.com/ThomasWestfechtel/SWG","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"RCL","metrics":{"Accuracy":"90.0"},"uses_additional_data":false,"paper_date":"2024-05-28","paper":"/paper/empowering-source-free-domain-adaptation-with","paper_url":"https://arxiv.org/abs/2405.18376v1","paper_title":"Empowering Source-Free Domain Adaptation with MLLM-driven Curriculum Learning","code":"https://github.com/Dong-Jie-Chen/RCL","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"PGA (ViT-L/14)","metrics":{"Accuracy":"89.4"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/enhancing-domain-adaptation-through-prompt","paper_url":"https://arxiv.org/abs/2406.09353v3","paper_title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","code":"https://github.com/viethoang1512/pga","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":5,"n_samples":12,"n_pointer_only_licence":12}},{"rank_in_archive_order":4,"model":"PMTrans","metrics":{"Accuracy":"89.0"},"uses_additional_data":false,"paper_date":"2023-03-23","paper":"/paper/patch-mix-transformer-for-unsupervised-domain","paper_url":"https://arxiv.org/abs/2303.13434v2","paper_title":"Patch-Mix Transformer for Unsupervised Domain Adaptation: A Game Perspective","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":5,"model":"CMKD","metrics":{"Accuracy":"89.0"},"uses_additional_data":false,"paper_date":"2024-04-19","paper":"/paper/unsupervised-domain-adaption-harnessing","paper_url":"https://ieeexplore.ieee.org/document/10505301","paper_title":"Unsupervised Domain Adaption Harnessing Vision-Language Pre-training","code":"https://github.com/Wenlve-Zhou/VLP-UDA","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"MIC","metrics":{"Accuracy":"86.2"},"uses_additional_data":false,"paper_date":"2022-12-02","paper":"/paper/mic-masked-image-consistency-for-context","paper_url":"https://arxiv.org/abs/2212.01322v2","paper_title":"MIC: Masked Image Consistency for Context-Enhanced Domain Adaptation","code":"https://github.com/lhoyer/mic","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"PGA (ViT-B/16)","metrics":{"Accuracy":"85.1"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/enhancing-domain-adaptation-through-prompt","paper_url":"https://arxiv.org/abs/2406.09353v3","paper_title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","code":"https://github.com/viethoang1512/pga","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":5,"n_samples":12,"n_pointer_only_licence":12}},{"rank_in_archive_order":8,"model":"ELS","metrics":{"Accuracy":"84.6"},"uses_additional_data":false,"paper_date":"2023-02-01","paper":"/paper/free-lunch-for-domain-adversarial-training-1","paper_url":"https://arxiv.org/abs/2302.00194v1","paper_title":"Free Lunch for Domain Adversarial Training: Environment Label Smoothing","code":"https://github.com/yfzhang114/Environment-Label-Smoothing","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":9,"model":"SDAT (ViT-B/16)","metrics":{"Accuracy":"84.3"},"uses_additional_data":false,"paper_date":"2022-06-16","paper":"/paper/a-closer-look-at-smoothness-in-domain-1","paper_url":"https://arxiv.org/abs/2206.08213v1","paper_title":"A Closer Look at Smoothness in Domain Adversarial Training","code":"https://github.com/val-iisc/sdat","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"CDTrans (DeiT-B)","metrics":{"Accuracy":"80.5"},"uses_additional_data":false,"paper_date":"2021-09-13","paper":"/paper/cdtrans-cross-domain-transformer-for","paper_url":"https://arxiv.org/abs/2109.06165v4","paper_title":"CDTrans: Cross-domain Transformer for Unsupervised Domain Adaptation","code":"https://github.com/cdtrans/cdtrans","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":7,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":11,"model":"PGA (RN50)","metrics":{"Accuracy":"75.8"},"uses_additional_data":false,"paper_date":"2024-06-13","paper":"/paper/enhancing-domain-adaptation-through-prompt","paper_url":"https://arxiv.org/abs/2406.09353v3","paper_title":"Enhancing Domain Adaptation through Prompt Gradient Alignment","code":"https://github.com/viethoang1512/pga","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":5,"n_samples":12,"n_pointer_only_licence":12}},{"rank_in_archive_order":12,"model":"PCL","metrics":{"Accuracy":"74.5"},"uses_additional_data":false,"paper_date":"2021-11-11","paper":"/paper/semantic-aware-representation-learning-via-1","paper_url":"https://arxiv.org/abs/2111.06021v5","paper_title":"Probabilistic Contrastive Learning for Domain Adaptation","code":"https://github.com/ljjcoder/PCL","n_code_links":2,"syntology":null},{"rank_in_archive_order":13,"model":"EvoADA","metrics":{"Accuracy":"73.9"},"uses_additional_data":false,"paper_date":"2021-03-25","paper":"/paper/on-evolving-attention-towards-domain","paper_url":"https://arxiv.org/abs/2103.13561v1","paper_title":"On Evolving Attention Towards Domain Adaptation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":14,"model":"GSDE","metrics":{"Accuracy":"73.6"},"uses_additional_data":false,"paper_date":"2023-11-16","paper":"/paper/gradual-source-domain-expansion-for","paper_url":"https://arxiv.org/abs/2311.09599v1","paper_title":"Gradual Source Domain Expansion for Unsupervised Domain Adaptation","code":"https://github.com/ThomasWestfechtel/GSDE","n_code_links":1,"syntology":null},{"rank_in_archive_order":15,"model":"CoVi","metrics":{"Accuracy":"73.1"},"uses_additional_data":false,"paper_date":"2021-11-26","paper":"/paper/contrastive-vicinal-space-for-unsupervised","paper_url":"https://arxiv.org/abs/2111.13353v3","paper_title":"Contrastive Vicinal Space for Unsupervised Domain Adaptation","code":"https://github.com/najaemin92/covi","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"FixBi","metrics":{"Accuracy":"72.7"},"uses_additional_data":false,"paper_date":"2020-11-18","paper":"/paper/fixbi-bridging-domain-spaces-for-unsupervised","paper_url":"https://arxiv.org/abs/2011.09230v2","paper_title":"FixBi: Bridging Domain Spaces for Unsupervised Domain Adaptation","code":"https://github.com/najaemin92/fixbi","n_code_links":1,"syntology":null},{"rank_in_archive_order":17,"model":"MCC+NWD","metrics":{"Accuracy":"72.6"},"uses_additional_data":false,"paper_date":"2022-04-08","paper":"/paper/reusing-the-task-specific-classifier-as-a","paper_url":"https://arxiv.org/abs/2204.03838v1","paper_title":"Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation","code":"https://github.com/xiaoachen98/daln","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":18,"model":"SENTRY (ResNet50)","metrics":{"Accuracy":"72.2"},"uses_additional_data":false,"paper_date":"2020-12-21","paper":"/paper/sentry-selective-entropy-optimization-via","paper_url":"https://arxiv.org/abs/2012.11460v2","paper_title":"SENTRY: Selective Entropy Optimization via Committee Consistency for Unsupervised Domain Adaptation","code":"https://github.com/virajprabhu/SENTRY","n_code_links":2,"syntology":null},{"rank_in_archive_order":19,"model":"SHOT","metrics":{"Accuracy":"71.8"},"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}},{"rank_in_archive_order":20,"model":"CPGA","metrics":{"Accuracy":"71.6"},"uses_additional_data":false,"paper_date":"2021-06-18","paper":"/paper/source-free-domain-adaptation-via-avatar","paper_url":"https://arxiv.org/abs/2106.15326v1","paper_title":"Source-free Domain Adaptation via Avatar Prototype Generation and Adaptation","code":"https://github.com/SCUT-AILab/CPGA","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"BIWAA","metrics":{"Accuracy":"71.5"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/backprop-induced-feature-weighting-for","paper_url":"https://openaccess.thecvf.com/content/WACV2023/html/Westfechtel_Backprop_Induced_Feature_Weighting_for_Adversarial_Domain_Adaptation_With_Iterative_WACV_2023_paper.html","paper_title":"Backprop Induced Feature Weighting for Adversarial Domain Adaptation with Iterative Label Distribution Alignment","code":"https://github.com/ThomasWestfechtel/BIWAA","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"SPL","metrics":{"Accuracy":"71"},"uses_additional_data":false,"paper_date":"2019-11-18","paper":"/paper/unsupervised-domain-adaptation-via-structured","paper_url":"https://arxiv.org/abs/1911.07982v1","paper_title":"Unsupervised Domain Adaptation via Structured Prediction Based Selective Pseudo-Labeling","code":"https://github.com/hellowangqian/domain-adaptation-capls","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"CADA","metrics":{"Accuracy":"70.2"},"uses_additional_data":false,"paper_date":"2019-06-08","paper":"/paper/attending-to-discriminative-certainty-for-1","paper_url":"https://arxiv.org/abs/1906.03502v2","paper_title":"Attending to Discriminative Certainty for Domain Adaptation","code":"https://github.com/DelTA-Lab-IITK/CADA","n_code_links":1,"syntology":null},{"rank_in_archive_order":24,"model":"DAOD","metrics":{"Accuracy":"69.8"},"uses_additional_data":false,"paper_date":"2019-07-19","paper":"/paper/open-set-domain-adaptation-theoretical-bound","paper_url":"https://arxiv.org/abs/1907.08375v2","paper_title":"Open Set Domain Adaptation: Theoretical Bound and Algorithm","code":"https://github.com/fang-zhen/Open-set-domain-adaptation","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"MEDM","metrics":{"Accuracy":"69.5"},"uses_additional_data":false,"paper_date":"2020-02-05","paper":"/paper/entropy-minimization-vs-diversity","paper_url":"https://arxiv.org/abs/2002.01690v1","paper_title":"Entropy Minimization vs. Diversity Maximization for Domain Adaptation","code":"https://github.com/AI-NERC-NUPT/MEDM","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":26,"model":"ASAN","metrics":{"Accuracy":"68.6"},"uses_additional_data":false,"paper_date":"2021-02-25","paper":"/paper/bridging-adversarial-and-statistical-domain","paper_url":"https://link.springer.com/chapter/10.1007/978-3-030-69535-4_28","paper_title":"Bridging Adversarial and Statistical Domain Transfer via Spectral Adaptation Networks","code":"https://github.com/ChristophRaab/ASAN","n_code_links":1,"syntology":null},{"rank_in_archive_order":27,"model":"MEDA (ResNet50)","metrics":{"Accuracy":"67.6"},"uses_additional_data":false,"paper_date":"2019-09-17","paper":"/paper/transfer-learning-with-dynamic-distribution","paper_url":"https://arxiv.org/abs/1909.08531v1","paper_title":"Transfer Learning with Dynamic Distribution Adaptation","code":"https://github.com/jindongwang/transferlearning","n_code_links":1,"syntology":null},{"rank_in_archive_order":28,"model":"IDDA","metrics":{"Accuracy":"49.46"},"uses_additional_data":false,"paper_date":"2019-04-02","paper":"/paper/looking-back-at-labels-a-class-based-domain","paper_url":"http://arxiv.org/abs/1904.01341v1","paper_title":"Looking back at Labels: A Class based Domain Adaptation Technique","code":"https://github.com/vinodkkurmi/DiscriminatorDomainAdaptation","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"CAADA","metrics":{"Accuracy":"48.19"},"uses_additional_data":false,"paper_date":"2019-11-29","paper":"/paper/correlation-aware-adversarial-domain","paper_url":"https://arxiv.org/abs/1911.12983v1","paper_title":"Correlation-aware Adversarial Domain Adaptation and Generalization","code":null,"n_code_links":0,"syntology":null}],"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,885 of the 9,623 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":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+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":9,"rows_with_any_sample_ran":8,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":6,"samples_over_distinct_papers":{"n_ran":14,"n_unverified":16,"n_samples":30,"n_pointer_only_licence":21,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":28,"n_unverified":26,"n_samples":54,"n_pointer_only_licence":45,"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"}}}