{"url":"/sota/source-free-domain-adaptation-on-pacs","task":{"name":"Source-Free Domain Adaptation","url":"/task/source-free-domain-adaptation","note":null},"dataset":{"name":"PACS","url":"/dataset/pacs"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"Source-Free Domain Adaptation (SFDA) is a domain adaptation method in machine learning and computer vision where the goal is to adapt a pre-trained model to a new, target domain without access to the source domain data. This approach is advantageous in scenarios where sharing the source data is impractical due to privacy concerns, data size, or proprietary restrictions","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":["Average Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Average Accuracy":"higher"}},"counts":{"rows":3,"rows_with_code":2,"rows_with_paper_page":3,"rows_dated":3,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SPM","metrics":{"Average Accuracy":"86.7"},"uses_additional_data":false,"paper_date":"2025-05-30","paper":"/paper/shuffle-patchmix-augmentation-with-confidence","paper_url":"https://arxiv.org/abs/2505.24216v1","paper_title":"Shuffle PatchMix Augmentation with Confidence-Margin Weighted Pseudo-Labels for Enhanced Source-Free Domain Adaptation","code":"https://github.com/PrasannaPulakurthi/SPM","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"DRA","metrics":{"Average Accuracy":"84.0"},"uses_additional_data":false,"paper_date":"2025-04-17","paper":"/paper/effective-dual-region-augmentation-for","paper_url":"https://arxiv.org/abs/2504.13077v1","paper_title":"Effective Dual-Region Augmentation for Reduced Reliance on Large Amounts of Labeled Data","code":"https://github.com/PrasannaPulakurthi/Foreground-Background-Augmentation","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"NEL","metrics":{"Average Accuracy":"72.4"},"uses_additional_data":false,"paper_date":"2022-02-15","paper":"/paper/cleaning-noisy-labels-by-negative-ensemble","paper_url":"https://openaccess.thecvf.com/content/WACV2022/html/Ahmed_Cleaning_Noisy_Labels_by_Negative_Ensemble_Learning_for_Source-Free_Unsupervised_WACV_2022_paper.html","paper_title":"Cleaning Noisy Labels by Negative Ensemble Learning for Source-Free Unsupervised Domain Adaptation","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":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"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"}}}