Generalization Bounds for Representative Domain Adaptation
In this paper, we propose a novel framework to analyze the theoretical properties of the learning process for a representative type of domain adaptation, which combines data from multiple sources and one target (or briefly called representative domain adaptation). In particular, we use the integral probability metric to measure the difference between the distributions of two domains and meanwhile compare it with the H-divergence and the discrepancy distance. We develop the Hoeffding-type, the Bennett-type and the McDiarmid-type deviation inequalities for multiple domains respectively, and then present the symmetrization inequality for representative domain adaptation. Next, we use the derived inequalities to obtain the Hoeffding-type and the Bennett-type generalization bounds respectively, both of which are based on the uniform entropy number. Moreover, we present the generalization bounds based on the Rademacher complexity. Finally, we analyze the asymptotic convergence and the rate of convergence of the learning process for representative domain adaptation. We discuss the factors that affect the asymptotic behavior of the learning process and the numerical experiments support our theoretical findings as well. Meanwhile, we give a comparison with the existing results of domain adaptation and the classical results under the same-distribution assumption.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationGeneralization BoundsVocal Bursts Type PredictionSimilar Papers 제목 키워드 기반
Generalization Bounds for Domain Adaptation
In this paper, we provide a new framework to obtain the generalization bounds of the learning process for domain adaptation, and then apply the derived bounds to analyze the asymptotical convergence of the learning proce…
Domain AdaptationGeneralization BoundsOn generalization in moment-based domain adaptation
Domain adaptation algorithms are designed to minimize the misclassification risk of a discriminative model for a target domain with little training data by adapting a model from a source domain with a large amount of tra…
Domain AdaptationGeneralization BoundsInformation-Theoretic Analysis of Unsupervised Domain Adaptation
This paper uses information-theoretic tools to analyze the generalization error in unsupervised domain adaptation (UDA). We present novel upper bounds for two notions of generalization errors. The first notion measures t…
Domain AdaptationUnsupervised Domain AdaptationPracticality of generalization guarantees for unsupervised domain adaptation with neural networks
Understanding generalization is crucial to confidently engineer and deploy machine learning models, especially when deployment implies a shift in the data domain. For such domain adaptation problems, we seek generalizati…
Domain AdaptationGeneralization Boundsimage-classificationImage Classification+1PAC-Bayesian Domain Adaptation Bounds for Multi-view learning
This paper presents a series of new results for domain adaptation in the multi-view learning setting. The incorporation of multiple views in the domain adaptation was paid little attention in the previous studies. In thi…
Domain AdaptationGeneralization BoundsMULTI-VIEW LEARNING