Moment-Based Domain Adaptation: Learning Bounds and Algorithms
This thesis contributes to the mathematical foundation of domain adaptation as emerging field in machine learning. In contrast to classical statistical learning, the framework of domain adaptation takes into account deviations between probability distributions in the training and application setting. Domain adaptation applies for a wider range of applications as future samples often follow a distribution that differs from the ones of the training samples. A decisive point is the generality of the assumptions about the similarity of the distributions. Therefore, in this thesis we study domain adaptation problems under as weak similarity assumptions as can be modelled by finitely many moments.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningDomain AdaptationSimilar Papers 제목 키워드 기반
On 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 BoundsDomain Adaptation: Learning Bounds and Algorithms
This paper addresses the general problem of domain adaptation which arises in a variety of applications where the distribution of the labeled sample available somewhat differs from that of the test data. Building on prev…
Domain AdaptationGeneralization BoundsConcentration bounds for linear Monge mapping estimation and optimal transport domain adaptation
This article investigates the quality of the estimator of the linear Monge mapping between distributions. We provide the first concentration result on the linear mapping operator and prove a sample complexity of $n^{-1/2…
Domain AdaptationAdversarial Multiple Source Domain Adaptation
While domain adaptation has been actively researched, most algorithms focus on the single-source-single-target adaptation setting. In this paper we propose new generalization bounds and algorithms under both classificati…
ClassificationDomain AdaptationGeneral ClassificationGeneralization Bounds+3Best-Effort Adaptation
We study a problem of best-effort adaptation motivated by several applications and considerations, which consists of determining an accurate predictor for a target domain, for which a moderate amount of labeled samples a…
Domain Adaptation