Robust unsupervised domain adaptation for neural networks via moment alignment
From MaRDI portal
Publication:2212554
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.
Recommendations
- Domain-adversarial training of neural networks
- Distribution-matching embedding for visual domain adaptation
- Learning kernels for unsupervised domain adaptation with applications to visual object recognition
- Asymmetric and category invariant feature transformations for domain adaptation
- Learning smooth representations with generalized softmax for unsupervised domain adaptation
Cites work
- scientific article; zbMATH DE number 3812614 (Why is no real title available?)
- scientific article; zbMATH DE number 6151747 (Why is no real title available?)
- A theory of learning from different domains
- Adaptive subgradient methods for online learning and stochastic optimization
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Domain adaptation and sample bias correction theory and algorithm for regression
- Integral Probability Metrics and Their Generating Classes of Functions
- MMD GAN
- Real Analysis and Probability
- The methods of distances in the theory of probability and statistics.
Cited in
(13)- A two-branch symmetric domain adaptation neural network based on Ulam stability theory
- MapFlow: latent transition via normalizing flow for unsupervised domain adaptation
- Convergent Newton method and neural network for the electric energy usage prediction
- Conditional variance penalties and domain shift robustness
- Finding robust transfer features for unsupervised domain adaptation
- Unsupervised domain adaptation in the wild via disentangling representation learning
- A deep multi-task representation learning method for time series classification and retrieval
- Domain-adversarial training of neural networks
- On generalization in moment-based domain adaptation
- Asymmetric and category invariant feature transformations for domain adaptation
- Learning smooth representations with generalized softmax for unsupervised domain adaptation
- Distribution-matching embedding for visual domain adaptation
- Subdomain adaptation capsule network for unsupervised mechanical fault diagnosis
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)
