A Multi-stage Framework with Mean Subspace Computation and Recursive Feedback for Online Unsupervised Domain Adaptation
Jihoon Moon, Debasmit Das, C. S. George Lee

TL;DR
This paper introduces a multi-stage framework for online unsupervised domain adaptation that uses mean subspace computation and recursive feedback to improve classification accuracy in real-time scenarios.
Contribution
It proposes a novel Incremental Computation of Mean-Subspace method and a recursive-feedback mechanism for better alignment of target data in online domain adaptation.
Findings
Outperforms previous methods in classification accuracy.
Demonstrates computational efficiency on six datasets.
Applicable to various learning models, including neural networks.
Abstract
In this paper, we address the Online Unsupervised Domain Adaptation (OUDA) problem and propose a novel multi-stage framework to solve real-world situations when the target data are unlabeled and arriving online sequentially in batches. To project the data from the source and the target domains to a common subspace and manipulate the projected data in real-time, our proposed framework institutes a novel method, called an Incremental Computation of Mean-Subspace (ICMS) technique, which computes an approximation of mean-target subspace on a Grassmann manifold and is proven to be a close approximate to the Karcher mean. Furthermore, the transformation matrix computed from the mean-target subspace is applied to the next target data in the recursive-feedback stage, aligning the target data closer to the source domain. The computation of transformation matrix and the prediction of next-target…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
