Papers › Self-ensembling for visual domain adaptation
Self-ensembling for visual domain adaptation
Geoffrey French, Michal Mackiewicz, Mark Fisher
This paper explores the use of self-ensembling for visual domain adaptation problems. Our technique is derived from the mean teacher variant (Tarvainen et al., 2017) of temporal ensembling (Laine et al;, 2017), a technique that achieved state of the art results in the area of semi-supervised learning. We introduce a number of modifications to their approach for challenging domain adaptation scenarios and evaluate its effectiveness. Our approach achieves state of the art results in a variety of benchmarks, including our winning entry in the VISDA-2017 visual domain adaptation challenge. In small image benchmarks, our algorithm not only outperforms prior art, but can also achieve accuracy that is close to that of a classifier trained in a supervised fashion.
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):
get_citation_path(paper_1="1706.05208", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1706.05208")
Code
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
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Domain Adaptation | MNIST-to-USPS | Mean teacher | Accuracy | 98.26 | #4 of 14 | Archive leaderboard | report |
| Domain Adaptation | SVHN-to-MNIST | Mean teacher | Accuracy | 99.18 | #1 of 14 | Archive leaderboard | report |
| Domain Adaptation | Synth Signs-to-GTSRB | Mean teacher | Accuracy | 98.66 | #1 of 4 | Archive leaderboard | report |
| Domain Adaptation | USPS-to-MNIST | Mean teacher | Accuracy | 98.07 | #6 of 14 | Archive leaderboard | report |
| Domain Adaptation | VisDA2017 | Mean teacher | Accuracy | 85.4 | #17 of 28 | 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