Robust unsupervised domain adaptation for neural networks via moment alignment

DOI10.1016/J.INS.2019.01.025zbMATH Open1448.68383arXiv1711.06114OpenAlexW2770501762MaRDI QIDQ2212554FDOQ2212554

Thomas Grubinger, Werner Zellinger, Thomas Natschläger, Edwin Lughofer, Susanne Saminger-Platz, Bernhard A. Moser

Publication date: 24 November 2020

Published in: Information Sciences (Search for Journal in Brave)

Abstract: A novel approach for unsupervised domain adaptation for neural networks is proposed. It relies on metric-based regularization of the learning process. The metric-based regularization aims at domain-invariant latent feature representations by means of maximizing the similarity between domain-specific activation distributions. The proposed metric results from modifying an integral probability metric such that it becomes less translation-sensitive on a polynomial function space. The metric has an intuitive interpretation in the dual space as the sum of differences of higher order central moments of the corresponding activation distributions. Under appropriate assumptions on the input distributions, error minimization is proven for the continuous case. As demonstrated by an analysis of standard benchmark experiments for sentiment analysis, object recognition and digit recognition, the outlined approach is robust regarding parameter changes and achieves higher classification accuracies than comparable approaches. The source code is available at https://github.com/wzell/mann.

Full work available at URL: https://arxiv.org/abs/1711.06114

zbMATH Keywords

transfer learningneural networksdomain adaptationmoment distanceintegral probability metric

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integral Probability Metrics and Their Generating Classes of Functions
• Real Analysis and Probability
• Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
• The Methods of Distances in the Theory of Probability and Statistics
• A theory of learning from different domains
• Domain adaptation and sample bias correction theory and algorithm for regression
• MMD GAN

Cited In (6)

• Convergent Newton method and neural network for the electric energy usage prediction
• Finding robust transfer features for unsupervised domain adaptation
• A deep multi-task representation learning method for time series classification and retrieval
• On generalization in moment-based domain adaptation
• Learning smooth representations with generalized softmax for unsupervised domain adaptation
• MapFlow: latent transition via normalizing flow for unsupervised domain adaptation

Uses Software

• ImageNet
• AdaGrad
• Adam
• i-RevNet
• AlexNet
• MMD GAN

This page was built for publication: Robust unsupervised domain adaptation for neural networks via moment alignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212554)