{"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":"/dataset/domainnet/papers/ran/1","list_of":"/dataset/domainnet","dataset":"DomainNet","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_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'","samples_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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,22],"of":22,"counts":{"papers_with_a_benchmark_row":48,"with_a_code_link":40,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":48,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":5,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/domainnet/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/adapting-to-distribution-shift-by-visual","slug":"adapting-to-distribution-shift-by-visual","title":"Adapting to Distribution Shift by Visual Domain Prompt Generation","date":"2024-05-05","arxiv_id":"2405.02797","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["guliisgreat/vdpg"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adapting-to-distribution-shift-by-visual#ran","syntology_url":"https://syntology.ai/paper/2405.02797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02797"}}}},{"paper":"/paper/soft-prompt-generation-for-domain","slug":"soft-prompt-generation-for-domain","title":"Soft Prompt Generation for Domain Generalization","date":"2024-04-30","arxiv_id":"2404.19286","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["renytek13/soft-prompt-generation-with-cgan"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/soft-prompt-generation-for-domain#ran","syntology_url":"https://syntology.ai/paper/2404.19286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19286"}}}},{"paper":"/paper/sf-da-2-source-free-domain-adaptation-through","slug":"sf-da-2-source-free-domain-adaptation-through","title":"SF(DA)$^2$: Source-free Domain Adaptation Through the Lens of Data Augmentation","date":"2024-03-16","arxiv_id":"2403.10834","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["shinyflight/sfda2"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sf-da-2-source-free-domain-adaptation-through#ran","syntology_url":"https://syntology.ai/paper/2403.10834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10834"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":2,"pointer_only_for_licence":9,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/distilling-from-vision-language-models-for","slug":"distilling-from-vision-language-models-for","title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","date":"2023-10-12","arxiv_id":"2310.08255","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["val-iisc/VL2V-ADiP"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/distilling-from-vision-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2310.08255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08255"}}}},{"paper":"/paper/promptstyler-prompt-driven-style-generation","slug":"promptstyler-prompt-driven-style-generation","title":"PromptStyler: Prompt-driven Style Generation for Source-free Domain Generalization","date":"2023-07-27","arxiv_id":"2307.15199","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/promptstyler-prompt-driven-style-generation#ran","syntology_url":"https://syntology.ai/paper/2307.15199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15199"}}}},{"paper":"/paper/poem-polarization-of-embeddings-for-domain","slug":"poem-polarization-of-embeddings-for-domain","title":"POEM: Polarization of Embeddings for Domain-Invariant Representations","date":"2023-05-22","arxiv_id":"2305.13046","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["josangyoung/official-poem"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/poem-polarization-of-embeddings-for-domain#ran","syntology_url":"https://syntology.ai/paper/2305.13046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13046"}}}},{"paper":"/paper/class-overwhelms-mutual-conditional-blended","slug":"class-overwhelms-mutual-conditional-blended","title":"Class Overwhelms: Mutual Conditional Blended-Target Domain Adaptation","date":"2023-02-03","arxiv_id":"2302.01516","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/class-overwhelms-mutual-conditional-blended#ran","syntology_url":"https://syntology.ai/paper/2302.01516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01516"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/meta-dmoe-adapting-to-domain-shift-by-meta","slug":"meta-dmoe-adapting-to-domain-shift-by-meta","title":"Meta-DMoE: Adapting to Domain Shift by Meta-Distillation from Mixture-of-Experts","date":"2022-10-08","arxiv_id":"2210.03885","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["n3il666/meta-dmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/meta-dmoe-adapting-to-domain-shift-by-meta#ran","syntology_url":"https://syntology.ai/paper/2210.03885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03885"}}}},{"paper":"/paper/sparse-fusion-mixture-of-experts-are-domain","slug":"sparse-fusion-mixture-of-experts-are-domain","title":"Sparse Mixture-of-Experts are Domain Generalizable Learners","date":"2022-06-08","arxiv_id":"2206.04046","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":14,"official":{"repos":["luodian/sf-moe-dg"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sparse-fusion-mixture-of-experts-are-domain#ran","syntology_url":"https://syntology.ai/paper/2206.04046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04046"}}}},{"paper":"/paper/dynamic-domain-generalization","slug":"dynamic-domain-generalization","title":"Dynamic Domain Generalization","date":"2022-05-27","arxiv_id":"2205.13913","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["metavisionlab/ddg"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2205.13913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13913"}}}},{"paper":"/paper/domain-generalization-by-mutual-information","slug":"domain-generalization-by-mutual-information","title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","date":"2022-03-21","arxiv_id":"2203.10789","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["kakaobrain/miro"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-generalization-by-mutual-information#ran","syntology_url":"https://syntology.ai/paper/2203.10789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10789"}}}},{"paper":"/paper/ensemble-of-averages-improving-model","slug":"ensemble-of-averages-improving-model","title":"Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalization","date":"2021-10-21","arxiv_id":"2110.10832","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["salesforce/ensemble-of-averages"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ensemble-of-averages-improving-model#ran","syntology_url":"https://syntology.ai/paper/2110.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10832"}}}},{"paper":"/paper/fishr-invariant-gradient-variances-for-out-of","slug":"fishr-invariant-gradient-variances-for-out-of","title":"Fishr: Invariant Gradient Variances for Out-of-Distribution Generalization","date":"2021-09-07","arxiv_id":"2109.02934","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["alexrame/fishr","facebookresearch/DomainBed"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fishr-invariant-gradient-variances-for-out-of#ran","syntology_url":"https://syntology.ai/paper/2109.02934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.02934"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["VisionLearningGroup/OVANet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/curriculum-graph-co-teaching-for-multi-target","slug":"curriculum-graph-co-teaching-for-multi-target","title":"Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation","date":"2021-04-01","arxiv_id":"2104.00808","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["Evgeneus/Graph-Domain-Adaptaion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/curriculum-graph-co-teaching-for-multi-target#ran","syntology_url":"https://syntology.ai/paper/2104.00808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00808"}}}},{"paper":"/paper/domain-generalization-needs-stochastic-weight","slug":"domain-generalization-needs-stochastic-weight","title":"SWAD: Domain Generalization by Seeking Flat Minima","date":"2021-02-17","arxiv_id":"2102.08604","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["khanrc/swad"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-generalization-needs-stochastic-weight#ran","syntology_url":"https://syntology.ai/paper/2102.08604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08604"}}}},{"paper":"/paper/a-balanced-and-uncertainty-aware-approach-for","slug":"a-balanced-and-uncertainty-aware-approach-for","title":"A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation","date":"2020-03-05","arxiv_id":"2003.02541","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["tim-learn/BA3US"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-balanced-and-uncertainty-aware-approach-for#ran","syntology_url":"https://syntology.ai/paper/2003.02541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02541"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/less-confusion-more-transferable-minimum","slug":"less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","arxiv_id":"1912.03699","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["thuml/Versatile-Domain-Adaptation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/less-confusion-more-transferable-minimum#ran","syntology_url":"https://syntology.ai/paper/1912.03699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03699"}}}}],"record_sha256":"63e8ff4eaa846be50f9314cff525caf3ed6a3b56a9e405996b711a7a7f53d611","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}