Generalization Bounds for Domain Adaptation

2013-04-04 · NeurIPS 2012 12 · Chao Zhang, Lei Zhang, Jieping Ye

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 process. Without loss of generality, we consider two kinds of representative domain adaptation: one is with multiple sources and the other is combining source and target data. In particular, we use the integral probability metric to measure the difference between two domains. For either kind of domain adaptation, we develop a related Hoeffding-type deviation inequality and a symmetrization inequality to achieve the corresponding generalization bound based on the uniform entropy number. We also generalized the classical McDiarmid's inequality to a more general setting where independent random variables can take values from different domains. By using this inequality, we then obtain generalization bounds based on the Rademacher complexity. Afterwards, we analyze the asymptotic convergence and the rate of convergence of the learning process for such kind of domain adaptation. Meanwhile, we discuss the factors that affect the asymptotic behavior of the learning process and the numerical experiments support our theoretical findings as well.

📄 PDF Abstract BibTeX arXiv:1304.1574

Code (0)

등록된 구현이 없습니다.

Tasks

Domain AdaptationGeneralization Bounds

On generalization in moment-based domain adaptation

2020-02-19 · Werner Zellinger, Bernhard A. Moser, Susanne Saminger-Platz

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 Adaptation Generalization Bounds

Information-Theoretic Analysis of Unsupervised Domain Adaptation

2022-10-03 · Ziqiao Wang, Yongyi Mao

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 Adaptation Unsupervised Domain Adaptation

Practicality of generalization guarantees for unsupervised domain adaptation with neural networks

2023-03-15 · Adam Breitholtz, Fredrik D. Johansson

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 Adaptation Generalization Bounds image-classification Image Classification+1

PAC-Bayesian Domain Adaptation Bounds for Multi-view learning

2024-01-02 · Mehdi Hennequin, Khalid Benabdeslem, Haytham Elghazel

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 Adaptation Generalization Bounds MULTI-VIEW LEARNING

Generalization Bounds for Representative Domain Adaptation

2014-01-02 · Chao Zhang, Lei Zhang, Wei Fan, Jieping Ye

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 brief…

Domain Adaptation Generalization Bounds Vocal Bursts Type Prediction