Moment-Based Domain Adaptation: Learning Bounds and Algorithms

Abstract

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.

Doctoral Thesis developed at the Department of Knowledge-Based Mathematical Systems at the Johannes Kepler University Linz under the supervision of Susanne Saminger-Platz and Bernhard Moser

References in corpus (16)

• Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks
• ADADELTA: An Adaptive Learning Rate Method
• Learning Transferable Features with Deep Adaptation Networks
• Deep Domain Confusion: Maximizing for Domain Invariance
• Unsupervised Domain Adaptation with Residual Transfer Networks
• Domain Separation Networks
• Domain Generalization via Invariant Feature Representation
• Marginalized Denoising Autoencoders for Domain Adaptation
• Domain Adaptation: Learning Bounds and Algorithms
• Robust Unsupervised Domain Adaptation for Neural Networks via Moment Alignment
• On integral probability metrics, ϕ-divergences and binary classification
• Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation
• Multiple Source Adaptation and the Renyi Divergence
• Complexity of Linear Regions in Deep Networks
• The multidimensional truncated Moment Problem: Atoms, Determinacy, and Core Variety
• On Quasi-Isometry of Threshold-Based Sampling