Papers › Transferability vs. Discriminability: Batch Spectral Penalization for Adversarial...

Transferability vs. Discriminability: Batch Spectral Penalization for Adversarial Domain Adaptation

1 Jun 2019International Conference on Machine Learning 2019 6archive 2025-07-28

Xinyang Chen, Sinan Wang, Mingsheng Long, Jianmin Wang

Adversarial domain adaptation has made remarkable advances in learning transferable representations for knowledge transfer across domains. While adversarial learning strengthens the feature transferability which the community focuses on, its impact on the feature discriminability has not been fully explored. In this paper, a series of experiments based on spectral analysis of the feature representations have been conducted, revealing an unexpected deterioration of the discriminability while learning transferable features adversarially. Our key finding is that the eigenvectors with the largest singular values will dominate the feature transferability. As a consequence, the transferability is enhanced at the expense of over penalization of other eigenvectors that embody rich structures crucial for discriminability. Towards this problem, we present Batch Spectral Penalization (BSP), a general approach to penalizing the largest singular values so that other eigenvectors can be relatively strengthened to boost the feature discriminability. Experiments show that the approach significantly improves upon representative adversarial domain adaptation methods to yield state of the art results.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

thuml/Batch-Spectral-Penalization officialmentioned in paperpytorchSyntology: not harvested 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 AdaptationTransfer Learning

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