SeA: Semantic Adversarial Augmentation for Last Layer Features from Unsupervised Representation Learning
Qi Qian, Yuanhong Xu, Juhua Hu
TL;DR
This work addresses learning with fixed deep features by introducing semantic adversarial augmentation (SeA) in feature space. SeA derives a semantic perturbation direction by projecting the gradient onto a subspace spanned by in batch real features, enabling effective augmentation of fixed representations for a linear classifier. Across 11 downstream tasks and four pre training models, SeA yields about a 2% average improvement over baselines and often matches fine tuning while being far more efficient. The method is further strengthened by an ensemble approach over multiple pre training objectives, and the authors provide thorough ablations and runtime analysis to establish practical applicability.
Abstract
Deep features extracted from certain layers of a pre-trained deep model show superior performance over the conventional hand-crafted features. Compared with fine-tuning or linear probing that can explore diverse augmentations, \eg, random crop/flipping, in the original input space, the appropriate augmentations for learning with fixed deep features are more challenging and have been less investigated, which degenerates the performance. To unleash the potential of fixed deep features, we propose a novel semantic adversarial augmentation (SeA) in the feature space for optimization. Concretely, the adversarial direction implied by the gradient will be projected to a subspace spanned by other examples to preserve the semantic information. Then, deep features will be perturbed with the semantic direction, and augmented features will be applied to learn the classifier. Experiments are conducted on $11$ benchmark downstream classification tasks with $4$ popular pre-trained models. Our method is $2\%$ better than the deep features without SeA on average. Moreover, compared to the expensive fine-tuning that is expected to give good performance, SeA shows a comparable performance on $6$ out of $11$ tasks, demonstrating the effectiveness of our proposal in addition to its efficiency. Code is available at \url{https://github.com/idstcv/SeA}.
