Homogeneous Online Transfer Learning with Online Distribution Discrepancy Minimization
Transfer learning has been demonstrated to be successful and essential in diverse applications, which transfers knowledge from related but different source domains to the target domain. Online transfer learning(OTL) is a more challenging problem where the target data arrive in an online manner. Most OTL methods combine source classifier and target classifier directly by assigning a weight to each classifier, and adjust the weights constantly. However, these methods pay little attention to reducing the distribution discrepancy between domains. In this paper, we propose a novel online transfer learning method which seeks to find a new feature representation, so that the marginal distribution and conditional distribution discrepancy can be online reduced simultaneously. We focus on online transfer learning with multiple source domains and use the Hedge strategy to leverage knowledge from source domains. We analyze the theoretical properties of the proposed algorithm and provide an upper mistake bound. Comprehensive experiments on two real-world datasets show that our method outperforms state-of-the-art methods by a large margin.
Code (1)
Tasks
Transfer LearningSimilar Papers 제목 키워드 기반
Subdomain Adaptation with Manifolds Discrepancy Alignment
Reducing domain divergence is a key step in transfer learning problems. Existing works focus on the minimization of global domain divergence. However, two domains may consist of several shared subdomains, and differ from…
Subdomain adaptationTransfer LearningManifold Criterion Guided Transfer Learning via Intermediate Domain Generation
In many practical transfer learning scenarios, the feature distribution is different across the source and target domains (i.e. non-i.i.d.). Maximum mean discrepancy (MMD), as a domain discrepancy metric, has achieved pr…
Domain AdaptationTransfer LearningUnsupervised Domain AdaptationSmoothed Analysis with Adaptive Adversaries
We prove novel algorithmic guarantees for several online problems in the smoothed analysis model. In this model, at each time an adversary chooses an input distribution with density function bounded above by $\tfrac{1}{\…
Automatic Online Multi-Source Domain Adaptation
Knowledge transfer across several streaming processes remain challenging problem not only because of different distributions of each stream but also because of rapidly changing and never-ending environments of data strea…
DenoisingDomain AdaptationOnline Domain AdaptationTransfer LearningA Kernelised Stein Discrepancy for Assessing the Fit of Inhomogeneous Random Graph Models
Complex data are often represented as a graph, which in turn can often be viewed as a realisation of a random graph, such as of an inhomogeneous random graph model (IRG). For general fast goodness-of-fit tests in high di…