Papers › A DIRT-T Approach to Unsupervised Domain Adaptation

A DIRT-T Approach to Unsupervised Domain Adaptation

23 Feb 2018ICLR 2018 1arXiv:1802.08735archive 2025-07-28

Rui Shu, Hung H. Bui, Hirokazu Narui, Stefano Ermon

Domain adaptation refers to the problem of leveraging labeled data in a source domain to learn an accurate model in a target domain where labels are scarce or unavailable. A recent approach for finding a common representation of the two domains is via domain adversarial training (Ganin & Lempitsky, 2015), which attempts to induce a feature extractor that matches the source and target feature distributions in some feature space. However, domain adversarial training faces two critical limitations: 1) if the feature extraction function has high-capacity, then feature distribution matching is a weak constraint, 2) in non-conservative domain adaptation (where no single classifier can perform well in both the source and target domains), training the model to do well on the source domain hurts performance on the target domain. In this paper, we address these issues through the lens of the cluster assumption, i.e., decision boundaries should not cross high-density data regions. We propose two novel and related models: 1) the Virtual Adversarial Domain Adaptation (VADA) model, which combines domain adversarial training with a penalty term that punishes the violation the cluster assumption; 2) the Decision-boundary Iterative Refinement Training with a Teacher (DIRT-T) model, which takes the VADA model as initialization and employs natural gradient steps to further minimize the cluster assumption violation. Extensive empirical results demonstrate that the combination of these two models significantly improve the state-of-the-art performance on the digit, traffic sign, and Wi-Fi recognition domain adaptation benchmarks.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

RuiShu/dirt-t officialmentioned in papermentioned on GitHubtfMITSyntology: not harvested report
domainadaptation/salad mentioned on GitHubpytorchMPL-2.0Syntology: not harvested report
timgaripov/asa mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Domain-Adversarial Training of Neural Networks (arXiv:1505.07818; that paper's own run record: 35 ran (of which 11 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 17 where Syntology's instrument failed) · 17 unverified), Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift (arXiv:2003.04475; that paper's own run record: 4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified) and Adversarial Support Alignment (arXiv:2203.08908; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
kevinmusgrave/pytorch-adapt pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Deep CORAL: Correlation Alignment for Deep Domain Adaptation (arXiv:1607.01719; that paper's own run record: 10 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 4 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified), Adversarial Discriminative Domain Adaptation (arXiv:1702.05464; that paper's own run record: 14 ran (of which 5 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 7 where Syntology's instrument failed) · 34 unverified), Conditional Adversarial Domain Adaptation (arXiv:1705.10667; that paper's own run record: 0 ran · 3 unverified) and 1 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Domain AdaptationUnsupervised Domain Adaptation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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