Browse State-of-the-Art › Partial Domain Adaptation
Partial Domain Adaptation
20 papers with code · 5 benchmarks · 4 datasets archive 2025-07-28
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.
Source: Deep Residual Correction Network for Partial Domain Adaptation
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
5 leaderboard tables shown for this task, 5 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology 1 newer paper was judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 0 placed): Office-Home (1 judged, 0 placed). Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| Office-Home (11 rows) | EvoADA | On Evolving Attention Towards Domain Adaptation | — | — | Compare |
| Office-31 (7 rows) | SLM | Select, Label, and Mix: Learning Discriminative Invariant Feature... | — | — | Compare |
| ImageNet-Caltech (4 rows) | AR | Adversarial Reweighting for Partial Domain Adaptation | code | — | Compare |
| DomainNet (3 rows) | AR | Adversarial Reweighting for Partial Domain Adaptation | code | — | Compare |
| VisDA2017 (3 rows) | SPDA | Selective Partial Domain Adaptation | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
4 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 56 · with a code link: 20 · where Syntology ran a sample: 5 (4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (5 of 56 tagged: 4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 56 of 56, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
20 Feb 2020 3 repositories listed Syntology official: no sample here; runs from other or unrecorded repositories · 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 (of 2 harvested samples) · 2 pointer-only (licence)Unsupervised domain adaptation (UDA) aims to leverage the knowledge learned from a labeled source dataset to solve similar tasks in a new unlabeled domain.
-
8 Dec 2019 3 repositories listed Syntology official (archive's flag): 1 ran · 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 (of 4 harvested samples) · 4 pointer-only (licence)It can be characterized as (1) a non-adversarial DA method without explicitly deploying domain alignment, enjoying faster convergence speed; (2) a versatile approach that can handle four existing scenarios: Closed-Set…
-
19 Nov 2018 3 repositories listedDomain adaptation enables the learner to safely generalize into novel environments by mitigating domain shifts across distributions.
-
1 Oct 2022 2 repositories listedTo solve this problem, we propose a Selective Partial Domain Adaptation (SPDA) method, which selects useful data for the adaptation to the target domain.
-
22 Aug 2021 2 repositories listed Syntology official (archive's flag): 7 ran · 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 (of 11 harvested samples) · 1 pointer-only (licence)Mini-batch optimal transport (m-OT) has been widely used recently to deal with the memory issue of OT in large-scale applications.
-
10 Aug 2018 2 repositories listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples) · 2 pointer-only (licence)We present Partial Adversarial Domain Adaptation (PADA), which simultaneously alleviates negative transfer by down-weighing the data of outlier source classes for training both source classifier and domain adversary…
-
20 Jun 2024 1 repository listedAs such, the key issues of WS-PDA are: 1) how to sufficiently discover the knowledge from the noisy labeled source domain and the unlabeled target domain, and 2) how to successfully adapt the knowledge across domains.
-
7 Jun 2022 1 repository listedIn this paper, we investigate Source-free Open-partial Domain Adaptation (SF-OPDA), which addresses the situation where there exist both domain and category shifts between source and target domains.
-
14 Mar 2022 1 repository listedStill, the common requirement of identical class space shared across domains hinders applications of domain adaptation to partial-set domains.
-
1 Dec 2021 1 repository listedTo tackle the challenge of negative domain transfer, we propose a novel Adversarial Reweighting (AR) approach that adversarially learns the weights of source domain data to align the source and target domain…
-
1 Dec 2021 1 repository listedPartial Domain Adaptation (PDA) addresses the unsupervised domain adaptation problem where the target label space is a subset of the source label space.
-
1 Sep 2021 1 repository listedThe outlier classes can be detected if no target-domain data are labeled as these classes.
-
29 Aug 2021 1 repository listedConsidering the difficulty of perfect alignment in solving PDA, we turn to focus on the model smoothness while discard the riskier domain alignment to enhance the adaptability of the model.
-
5 Jun 2021 1 repository listedTo better exploit the intrinsic structure of the target domain, we propose Domain Consensus Clustering (DCC), which exploits the domain consensus knowledge to discover discriminative clusters on both common samples and…
-
1 Sep 2020 1 repository listedUnsupervised Domain Adaptation (UDA) aims to classify unlabeled target domain by transferring knowledge from labeled source domain with domain shift.
-
10 Apr 2020 1 repository listedDeep domain adaptation methods have achieved appealing performance by learning transferable representations from a well-labeled source domain to a different but related unlabeled target domain.
-
5 Mar 2020 1 repository listed Syntology official (archive's flag): 8 ran · 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 (of 10 harvested samples) · 4 pointer-only (licence)On one hand, negative transfer results in misclassification of target samples to the classes only present in the source domain.
-
19 Feb 2020 1 repository listedWhile some methods address target settings with either partial or open-set categories, they assume that the particular setting is known a priori.
-
28 Mar 2019 1 repository listedUnder the condition that target labels are unknown, the key challenge of PDA is how to transfer relevant examples in the shared classes to promote positive transfer, and ignore irrelevant ones in the specific classes to…
-
25 Mar 2018 1 repository listedThis paper proposes an importance weighted adversarial nets-based method for unsupervised domain adaptation, specific for partial domain adaptation where the target domain has less number of classes compared to the…
-
Bi-level Unbalanced Optimal Transport for Partial Domain Adaptation19 May 2025 0 repositories listedPartial domain adaptation (PDA) problem requires aligning cross-domain samples while distinguishing the outlier classes for accurate knowledge transfer.
-
Soft-Masked Semi-Dual Optimal Transport for Partial Domain Adaptation3 May 2025 0 repositories listedVisual domain adaptation aims to learn discriminative and domain-invariant representation for an unlabeled target domain by leveraging knowledge from a labeled source domain.
-
Co-training partial domain adaptation networks for industrial Fault Diagnosis22 Oct 2024 0 repositories listedThe partial domain adaptation (PDA) challenge is a prevalent issue in industrial fault diagnosis.
-
Partial Distribution Matching via Partial Wasserstein Adversarial Networks16 Sep 2024 0 repositories listedThis paper studies the problem of distribution matching (DM), which is a fundamental machine learning problem seeking to robustly align two probability distributions.
-
A Unified Framework for Unsupervised Domain Adaptation based on Instance Weighting8 Dec 2023 0 repositories listedDespite the progress made in domain adaptation, solving Unsupervised Domain Adaptation (UDA) problems with a general method under complex conditions caused by label shifts between domains remains a formidable task.
-
Robust Class-Conditional Distribution Alignment for Partial Domain Adaptation18 Oct 2023 0 repositories listedUnwanted samples from private source categories in the learning objective of a partial domain adaptation setup can lead to negative transfer and reduce classification performance.
-
A Robust Negative Learning Approach to Partial Domain Adaptation Using Source Prototypes7 Sep 2023 0 repositories listedThis work proposes a robust Partial Domain Adaptation (PDA) framework that mitigates the negative transfer problem by incorporating a robust target-supervision strategy.
-
MOT: Masked Optimal Transport for Partial Domain Adaptation1 Jan 2023 0 repositories listedAs an important methodology to measure distribution discrepancy, optimal transport (OT) has been successfully applied to learn generalizable visual models under changing environments.
-
Domain-Invariant Feature Alignment Using Variational Inference For Partial Domain Adaptation3 Dec 2022 0 repositories listedThe standard closed-set domain adaptation approaches seek to mitigate distribution discrepancies between two domains under the constraint of both sharing identical label sets.
-
A Reproducible and Realistic Evaluation of Partial Domain Adaptation Methods3 Oct 2022 0 repositories listedUnsupervised Domain Adaptation (UDA) aims at classifying unlabeled target images leveraging source labeled ones.
-
Coupling Adversarial Learning with Selective Voting Strategy for Distribution Alignment in Partial Domain Adaptation17 Jul 2022 0 repositories listed
-
Controlled Generation of Unseen Faults for Partial and Open-Partial Domain Adaptation29 Apr 2022 0 repositories listed
-
Low-Cost On-device Partial Domain Adaptation (LoCO-PDA): Enabling efficient CNN retraining on edge devices1 Mar 2022 0 repositories listed
-
Self-Adaptive Partial Domain Adaptation18 Sep 2021 0 repositories listed
-
11 Jul 2021 0 repositories listed Syntology 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 (of 7 harvested samples) · 1 pointer-only (licence)
-
Partial Feature Selection and Alignment for Multi-Source Domain Adaptation19 Jun 2021 0 repositories listed
-
25 Mar 2021 0 repositories listed
-
Partial Domain Adaptation Using Selective Representation Learning For Class-Weight Computation6 Jan 2021 0 repositories listed
-
6 Dec 2020 0 repositories listed
-
Adversarial Consistent Learning on Partial Domain Adaptation of PlantCLEF 2020 Challenge19 Sep 2020 0 repositories listed
-
Adaptively-Accumulated Knowledge Transfer for Partial Domain Adaptation27 Aug 2020 0 repositories listed
-
Discriminative Cross-Domain Feature Learning for Partial Domain Adaptation26 Aug 2020 0 repositories listed
-
Learning Target Domain Specific Classifier for Partial Domain Adaptation25 Aug 2020 0 repositories listed
-
Associative Partial Domain Adaptation7 Aug 2020 0 repositories listed
-
Discriminative Partial Domain Adversarial Network1 Aug 2020 0 repositories listed
-
24 Jul 2020 0 repositories listed
-
Unsupervised Domain Adaptation With Hierarchical Gradient Synchronization1 Jun 2020 0 repositories listed
-
Partial Domain Adaptation Using Graph Convolutional Networks16 May 2020 0 repositories listed
-
Class Conditional Alignment for Partial Domain Adaptation14 Mar 2020 0 repositories listed
-
8 Nov 2019 0 repositories listed
-
Transfer Learning for Relation Extraction via Relation-Gated Adversarial Learning22 Aug 2019 0 repositories listed
-
Tackling Partial Domain Adaptation with Self-Supervision12 Jun 2019 0 repositories listed
-
Discriminative Clustering for Robust Unsupervised Domain Adaptation30 May 2019 0 repositories listed
-
26 May 2019 0 repositories listed
-
Domain Adversarial Reinforcement Learning for Partial Domain Adaptation10 May 2019 0 repositories listed
-
TWINs: Two Weighted Inconsistency-reduced Networks for Partial Domain Adaptation18 Dec 2018 0 repositories listed
Syntology lines on 6 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections