{"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":"/task/partial-domain-adaptation","name":"Partial Domain Adaptation","slug":"partial-domain-adaptation","description_markdown":"**Partial Domain Adaptation** is a transfer learning paradigm, which manages to transfer relevant knowledge from a large-scale source domain to a small-scale target domain.\n\n\n<span class=\"description-source\">Source: [Deep Residual Correction Network for Partial Domain Adaptation ](https://arxiv.org/abs/2004.04914)</span>","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":56,"papers_with_code":20,"benchmarks":5,"benchmark_tables_in_archive":5,"benchmark_tables_shown":5,"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":4,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/partial-domain-adaptation-on-office-home","slug":"partial-domain-adaptation-on-office-home","dataset":"Office-Home","dataset_url":"/dataset/office-home","rows_in_archive":11,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"EvoADA","paper_title":"On Evolving Attention Towards Domain Adaptation","paper_url":"/paper/on-evolving-attention-towards-domain","paper_date":"2021-03-25","arxiv_id":"2103.13561","code_links":[],"syntology":null}},{"leaderboard":"/sota/partial-domain-adaptation-on-office-31","slug":"partial-domain-adaptation-on-office-31","dataset":"Office-31","dataset_url":"/dataset/office-31","rows_in_archive":7,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"SLM","paper_title":"Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptation","paper_url":"/paper/select-label-and-mix-learning-discriminative","paper_date":"2020-12-06","arxiv_id":"2012.03358","code_links":[],"syntology":null}},{"leaderboard":"/sota/partial-domain-adaptation-on-imagenet-caltech","slug":"partial-domain-adaptation-on-imagenet-caltech","dataset":"ImageNet-Caltech","dataset_url":null,"rows_in_archive":4,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"AR","paper_title":"Adversarial Reweighting for Partial Domain Adaptation","paper_url":"/paper/adversarial-reweighting-for-partial-domain","paper_date":"2021-12-01","arxiv_id":null,"code_links":[{"title":"xjtu-xgu/adversarial-reweighting-for-partial-domain-adaptation","url":"https://github.com/xjtu-xgu/adversarial-reweighting-for-partial-domain-adaptation"}],"syntology":null}},{"leaderboard":"/sota/partial-domain-adaptation-on-domainnet","slug":"partial-domain-adaptation-on-domainnet","dataset":"DomainNet","dataset_url":"/dataset/domainnet","rows_in_archive":3,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"AR","paper_title":"Adversarial Reweighting for Partial Domain Adaptation","paper_url":"/paper/adversarial-reweighting-for-partial-domain","paper_date":"2021-12-01","arxiv_id":null,"code_links":[{"title":"xjtu-xgu/adversarial-reweighting-for-partial-domain-adaptation","url":"https://github.com/xjtu-xgu/adversarial-reweighting-for-partial-domain-adaptation"}],"syntology":null}},{"leaderboard":"/sota/partial-domain-adaptation-on-visda2017","slug":"partial-domain-adaptation-on-visda2017","dataset":"VisDA2017","dataset_url":"/dataset/visda-2017","rows_in_archive":3,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"SPDA","paper_title":"Selective Partial Domain Adaptation","paper_url":"/paper/selective-partial-domain-adaptation","paper_date":"2022-10-01","arxiv_id":null,"code_links":[{"title":"Pengxin-Guo/SPDA","url":"https://github.com/Pengxin-Guo/SPDA"},{"title":"gpx333/spda","url":"https://github.com/gpx333/spda"}],"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}],"subtasks":[],"parent_tasks":[{"url":"/task/domain-adaptation","name":"Domain Adaptation"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":56,"of":56,"of_with_code":20,"tagged_in_all":56,"counts":{"archive_papers_tagged":56,"with_a_code_link":20,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":56,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/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","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/paper/unsupervised-domain-adaptation-an-adaptive","slug":"unsupervised-domain-adaptation-an-adaptive","title":"Larger Norm More Transferable: An Adaptive Feature Norm Approach for Unsupervised Domain Adaptation","date":"2018-11-19","arxiv_id":"1811.07456","repositories_listed":3,"syntology":null},{"url":"/paper/selective-partial-domain-adaptation","slug":"selective-partial-domain-adaptation","title":"Selective Partial Domain Adaptation","date":"2022-10-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/an-efficient-mini-batch-method-via-partial","slug":"an-efficient-mini-batch-method-via-partial","title":"Improving Mini-batch Optimal Transport via Partial Transportation","date":"2021-08-22","arxiv_id":"2108.09645","repositories_listed":2,"syntology":{"n":11,"n_ran":7,"n_constructed":3,"n_ran_checked":3,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/an-efficient-mini-batch-method-via-partial#ran","syntology_url":"https://syntology.ai/paper/2108.09645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09645"}},"official":{"repos":["ut-austin-data-science-group/mini-batch-ot","khainb/BoMb-OT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/partial-adversarial-domain-adaptation","slug":"partial-adversarial-domain-adaptation","title":"Partial Adversarial Domain Adaptation","date":"2018-08-10","arxiv_id":"1808.04205","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/partial-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1808.04205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04205"}},"official":{"repos":["thuml/PADA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/learning-to-discover-knowledge-a-weakly","slug":"learning-to-discover-knowledge-a-weakly","title":"Learning to Discover Knowledge: A Weakly-Supervised Partial Domain Adaptation Approach","date":"2024-06-20","arxiv_id":"2406.14274","repositories_listed":1,"syntology":null},{"url":"/paper/one-ring-to-bring-them-all-towards-open-set","slug":"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/from-big-to-small-adaptive-learning-to","slug":"from-big-to-small-adaptive-learning-to","title":"From Big to Small: Adaptive Learning to Partial-Set Domains","date":"2022-03-14","arxiv_id":"2203.07375","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-reweighting-for-partial-domain","slug":"adversarial-reweighting-for-partial-domain","title":"Adversarial Reweighting for Partial Domain Adaptation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/implicit-semantic-response-alignment-for","slug":"implicit-semantic-response-alignment-for","title":"Implicit Semantic Response Alignment for Partial Domain Adaptation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/source-class-selection-with-label-propagation","slug":"source-class-selection-with-label-propagation","title":"Source Class Selection with Label Propagation for Partial Domain Adaptation","date":"2021-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/partial-domain-adaptation-without-domain","slug":"partial-domain-adaptation-without-domain","title":"Partial Domain Adaptation without Domain Alignment","date":"2021-08-29","arxiv_id":"2108.12867","repositories_listed":1,"syntology":null},{"url":"/paper/domain-consensus-clustering-for-universal","slug":"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/unsupervised-domain-adaptation-with-4","slug":"unsupervised-domain-adaptation-with-4","title":"Unsupervised Domain Adaptation with Progressive Adaptation of Subspaces","date":"2020-09-01","arxiv_id":"2009.00520","repositories_listed":1,"syntology":null},{"url":"/paper/deep-residual-correction-network-for-partial","slug":"deep-residual-correction-network-for-partial","title":"Deep Residual Correction Network for Partial Domain Adaptation","date":"2020-04-10","arxiv_id":"2004.04914","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","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"}},"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"]}}},{"url":"/paper/universal-domain-adaptation-through-self","slug":"universal-domain-adaptation-through-self","title":"Universal Domain Adaptation through Self Supervision","date":"2020-02-19","arxiv_id":"2002.07953","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-transfer-examples-for-partial","slug":"learning-to-transfer-examples-for-partial","title":"Learning to Transfer Examples for Partial Domain Adaptation","date":"2019-03-28","arxiv_id":"1903.12230","repositories_listed":1,"syntology":null},{"url":"/paper/importance-weighted-adversarial-nets-for","slug":"importance-weighted-adversarial-nets-for","title":"Importance Weighted Adversarial Nets for Partial Domain Adaptation","date":"2018-03-25","arxiv_id":"1803.09210","repositories_listed":1,"syntology":null},{"url":null,"slug":"bi-level-unbalanced-optimal-transport-for","title":"Bi-level Unbalanced Optimal Transport for Partial Domain Adaptation","date":"2025-05-19","arxiv_id":"2506.08020","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-masked-semi-dual-optimal-transport-for","title":"Soft-Masked Semi-Dual Optimal Transport for Partial Domain Adaptation","date":"2025-05-03","arxiv_id":"2505.01664","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-residual-domain-adaptation","title":"Co-training partial domain adaptation networks for industrial Fault Diagnosis","date":"2024-10-22","arxiv_id":"2410.16737","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-distribution-matching-via-partial","title":"Partial Distribution Matching via Partial Wasserstein Adversarial Networks","date":"2024-09-16","arxiv_id":"2409.10499","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-unsupervised-domain","title":"A Unified Framework for Unsupervised Domain Adaptation based on Instance Weighting","date":"2023-12-08","arxiv_id":"2312.05024","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-class-conditional-distribution","title":"Robust Class-Conditional Distribution Alignment for Partial Domain Adaptation","date":"2023-10-18","arxiv_id":"2310.12060","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-negative-learning-approach-to","title":"A Robust Negative Learning Approach to Partial Domain Adaptation Using Source Prototypes","date":"2023-09-07","arxiv_id":"2309.03531","repositories_listed":0,"syntology":null},{"url":null,"slug":"mot-masked-optimal-transport-for-partial","title":"MOT: Masked Optimal Transport for Partial Domain Adaptation","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-invariant-feature-alignment-using","title":"Domain-Invariant Feature Alignment Using Variational Inference For Partial Domain Adaptation","date":"2022-12-03","arxiv_id":"2212.01590","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-reproducible-and-realistic-evaluation-of","title":"A Reproducible and Realistic Evaluation of Partial Domain Adaptation Methods","date":"2022-10-03","arxiv_id":"2210.01210","repositories_listed":0,"syntology":null},{"url":null,"slug":"coupling-adversarial-learning-with-selective","title":"Coupling Adversarial Learning with Selective Voting Strategy for Distribution Alignment in Partial Domain Adaptation","date":"2022-07-17","arxiv_id":"2207.08145","repositories_listed":0,"syntology":null},{"url":null,"slug":"controlled-generation-of-unseen-faults-for","title":"Controlled Generation of Unseen Faults for Partial and Open-Partial Domain Adaptation","date":"2022-04-29","arxiv_id":"2204.14068","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-cost-on-device-partial-domain-adaptation","title":"Low-Cost On-device Partial Domain Adaptation (LoCO-PDA): Enabling efficient CNN retraining on edge devices","date":"2022-03-01","arxiv_id":"2203.00772","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-adaptive-partial-domain-adaptation","title":"Self-Adaptive Partial Domain Adaptation","date":"2021-09-18","arxiv_id":"2109.08829","repositories_listed":0,"syntology":null},{"url":"/paper/partial-video-domain-adaptation-with-partial","slug":"partial-video-domain-adaptation-with-partial","title":"Partial Video Domain Adaptation with Partial Adversarial Temporal Attentive Network","date":"2021-07-11","arxiv_id":"2107.04941","repositories_listed":0,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/partial-video-domain-adaptation-with-partial#ran","syntology_url":"https://syntology.ai/paper/2107.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.04941"}},"official":null}},{"url":null,"slug":"partial-feature-selection-and-alignment-for","title":"Partial Feature Selection and Alignment for Multi-Source Domain Adaptation","date":"2021-06-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/on-evolving-attention-towards-domain","slug":"on-evolving-attention-towards-domain","title":"On Evolving Attention Towards Domain Adaptation","date":"2021-03-25","arxiv_id":"2103.13561","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-domain-adaptation-using-selective","title":"Partial Domain Adaptation Using Selective Representation Learning For Class-Weight Computation","date":"2021-01-06","arxiv_id":"2101.02275","repositories_listed":0,"syntology":null},{"url":"/paper/select-label-and-mix-learning-discriminative","slug":"select-label-and-mix-learning-discriminative","title":"Select, Label, and Mix: Learning Discriminative Invariant Feature Representations for Partial Domain Adaptation","date":"2020-12-06","arxiv_id":"2012.03358","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-consistent-learning-on-partial","title":"Adversarial Consistent Learning on Partial Domain Adaptation of PlantCLEF 2020 Challenge","date":"2020-09-19","arxiv_id":"2009.09289","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptively-accumulated-knowledge-transfer-for","title":"Adaptively-Accumulated Knowledge Transfer for Partial Domain Adaptation","date":"2020-08-27","arxiv_id":"2008.11873","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-cross-domain-feature-learning","title":"Discriminative Cross-Domain Feature Learning for Partial Domain Adaptation","date":"2020-08-26","arxiv_id":"2008.11360","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-target-domain-specific-classifier","title":"Learning Target Domain Specific Classifier for Partial Domain Adaptation","date":"2020-08-25","arxiv_id":"2008.10785","repositories_listed":0,"syntology":null},{"url":null,"slug":"associative-partial-domain-adaptation","title":"Associative Partial Domain Adaptation","date":"2020-08-07","arxiv_id":"2008.03111","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-partial-domain-adversarial","title":"Discriminative Partial Domain Adversarial Network","date":"2020-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/self-supervised-learning-across-domains","slug":"self-supervised-learning-across-domains","title":"Self-Supervised Learning Across Domains","date":"2020-07-24","arxiv_id":"2007.12368","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-domain-adaptation-with-6","title":"Unsupervised Domain Adaptation With Hierarchical Gradient Synchronization","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-domain-adaptation-using-graph","title":"Partial Domain Adaptation Using Graph Convolutional Networks","date":"2020-05-16","arxiv_id":"2005.07858","repositories_listed":0,"syntology":null},{"url":null,"slug":"class-conditional-alignment-for-partial","title":"Class Conditional Alignment for Partial Domain Adaptation","date":"2020-03-14","arxiv_id":"2003.06722","repositories_listed":0,"syntology":null},{"url":"/paper/relation-adversarial-network-for-low-resource","slug":"relation-adversarial-network-for-low-resource","title":"Relation Adversarial Network for Low Resource Knowledge Graph Completion","date":"2019-11-08","arxiv_id":"1911.03091","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-learning-for-relation-extraction-via","title":"Transfer Learning for Relation Extraction via Relation-Gated Adversarial Learning","date":"2019-08-22","arxiv_id":"1908.08507","repositories_listed":0,"syntology":null},{"url":null,"slug":"tackling-partial-domain-adaptation-with-self","title":"Tackling Partial Domain Adaptation with Self-Supervision","date":"2019-06-12","arxiv_id":"1906.05199","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-clustering-for-robust","title":"Discriminative Clustering for Robust Unsupervised Domain Adaptation","date":"2019-05-30","arxiv_id":"1905.13331","repositories_listed":0,"syntology":null},{"url":"/paper/selective-transfer-with-reinforced-transfer","slug":"selective-transfer-with-reinforced-transfer","title":"Selective Transfer with Reinforced Transfer Network for Partial Domain Adaptation","date":"2019-05-26","arxiv_id":"1905.10756","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adversarial-reinforcement-learning-for","title":"Domain Adversarial Reinforcement Learning for Partial Domain Adaptation","date":"2019-05-10","arxiv_id":"1905.04094","repositories_listed":0,"syntology":null},{"url":null,"slug":"twins-two-weighted-inconsistency-reduced","title":"TWINs: Two Weighted Inconsistency-reduced Networks for Partial Domain Adaptation","date":"2018-12-18","arxiv_id":"1812.07405","repositories_listed":0,"syntology":null}],"syntology_records":6,"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"},"key_notes":{"n_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'","n_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)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/partial-domain-adaptation-on-office-home","since_archive":"/sota/partial-domain-adaptation-on-office-home#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/task/partial-domain-adaptation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/partial-domain-adaptation/papers/ran/1","json":"/task/partial-domain-adaptation/papers/ran/1.json","rows":5}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"d6d97173e24c3e2e9c7ab5db24d4e1b15e9e1efe831c82d21c4d1578792b42e3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}