Papers › Domain Separation Networks
Domain Separation Networks
Konstantinos Bousmalis, George Trigeorgis, Nathan Silberman, Dilip Krishnan, Dumitru Erhan
The cost of large scale data collection and annotation often makes the application of machine learning algorithms to new tasks or datasets prohibitively expensive. One approach circumventing this cost is training models on synthetic data where annotations are provided automatically. Despite their appeal, such models often fail to generalize from synthetic to real images, necessitating domain adaptation algorithms to manipulate these models before they can be successfully applied. Existing approaches focus either on mapping representations from one domain to the other, or on learning to extract features that are invariant to the domain from which they were extracted. However, by focusing only on creating a mapping or shared representation between the two domains, they ignore the individual characteristics of each domain. We suggest that explicitly modeling what is unique to each domain can improve a model's ability to extract domain-invariant features. Inspired by work on private-shared component analysis, we explicitly learn to extract image representations that are partitioned into two subspaces: one component which is private to each domain and one which is shared across domains. Our model is trained not only to perform the task we care about in the source domain, but also to use the partitioned representation to reconstruct the images from both domains. Our novel architecture results in a model that outperforms the state-of-the-art on a range of unsupervised domain adaptation scenarios and additionally produces visualizations of the private and shared representations enabling interpretation of the domain adaptation process.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1608.06019")
Code
Syntology Ran 5 of 14 code samples harvested from 3 repositories linked to this paper; 9 have no recorded run. Of those that ran: 2 ran · our draft was wrong; 3 ran · fixture could not drive it.
By repository: community (archive-listed): 14 samples from 3 repositories, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
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.
Code Syntology ran Syntology
14 samples harvested; 5 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 6 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
6fd1a214765e72ae · report
ff78cef5d3488545 · report
7cb4d00956da097a · report
77ccceb98cdee6c5 · report
fe1dbd8806085fe2 · report
8fba778a6f75c85d · report
3a61a354e5a70023 · report
7c7eaa1486a49223 · report
9304c4038bf8917c · report
5a45998cae0b9c38 · report
a6024e8116aa1f9a · report
805af20b689e601f · report
396cd1afb3640ed8 · report
69cebf606530314b · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Domain Adaptation | MNIST-to-MNIST-M | DSN (DANN) | Accuracy | 83.2 | #3 of 5 | Archive leaderboard | report |
| Domain Adaptation | SVNH-to-MNIST | DSN (DANN) | Accuracy | 82.7 | #7 of 9 | Archive leaderboard | report |
| Domain Adaptation | Synth Digits-to-SVHN | DSN (DANN) | Accuracy | 91.2 | #1 of 4 | Archive leaderboard | report |
| Domain Adaptation | Synth Objects-to-LINEMOD | DSN (DANN) | Classification Accuracy | 100 | #1 of 1 | Archive leaderboard | report |
| Domain Adaptation | Synth Objects-to-LINEMOD | DSN (DANN) | Mean Angle Error | 53.27 | #1 of 1 | Archive leaderboard | report |
| Domain Adaptation | Synth Signs-to-GTSRB | DSN (DANN) | Accuracy | 93.1 | #2 of 4 | Archive leaderboard | report |
| Domain Generalization | PACS | DSN (Alexnet) | Average Accuracy | 67.37 | #129 of 133 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
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