Introduction
Deep learning models frequently encounter performance degradation when deployed in target domains that differ from their source training data. This challenge is compounded in Universal Domain Adaptation (UniDA), where the target domain may contain entirely new "private" categories or lack certain source categories. With increasing privacy concerns, Source-free UniDA (SF-UniDA) has emerged, requiring adaptation without access to original source data. The primary hurdle in SF-UniDA is "knowing what you don't know": distinguishing between known classes under covariate shift and entirely new, unknown categories.
Methodology: Learning Decomposition (LEAD)
The proposed LEArning Decomposition (LEAD) framework addresses SF-UniDA through a geometric lens rather than relying on computationally expensive iterative clustering or brittle hand-crafted thresholds.
Orthogonal Feature Decomposition
LEAD leverages the observation that a source classifier's weights ($W_{cls}$) define a "source-known" subspace. Using Singular Value Decomposition (SVD), the authors identify the orthogonal complement—the "source-unknown" space. Target-private (unknown) samples are hypothesized to project more strongly into this unknown space than common samples.
Identification and Adaptation
- Unknown Indicator: A two-component Gaussian Mixture Model (GMM) is applied to these projections to model the distribution and separate common classes from private ones.
- Adaptive Decision Boundaries: Instead of static global thresholds, LEAD employs instance-level adaptive boundaries based on a "common score," calculated using distances to target prototypes and source anchors. This allows flexibility across categories with varying levels of domain shift.
- Optimization: The model is optimized using cross-entropy on pseudo-labels, alongside feature decomposition and consensus regularizers to sharpen class distinctions and ensure local feature consistency.
Experimental Evaluation
LEAD was tested on major benchmarks including Office-31, Office-Home, VisDA, and DomainNet across various scenarios like Open-Partial (OPDA), Open-Set (OSDA), and Partial-Set (PDA).
Key Results and Insights
LEAD demonstrates significant improvements in both accuracy and efficiency. In the challenging VisDA OPDA scenario, it outperformed the previous state-of-the-art (GLC) by 3.5% in H-score (a metric balancing accuracy on common and private classes).
Efficiency and Versatility
A standout feature of LEAD is its computational efficiency. On the massive DomainNet dataset, LEAD determined decision boundaries in just 0.29 seconds, a reduction of over 99.9% compared to the clustering-based GLC (897.65 seconds). Furthermore, LEAD acts as a "plug-and-play" module; integrating it with the UMAD framework on Office-Home increased the H-score from 70.1% to 78.0%, demonstrating its robustness as a refined unknown detector.
Conclusion
By utilizing the "null space" of source classifier weights, LEAD provides an elegant and highly efficient solution for identifying unknown categories in source-free environments. Its ability to complement existing frameworks while bypassing the curse of dimensionality makes it a powerful tool for privacy-preserving domain adaptation.
Summary updated