Knothe-Rosenblatt transport for Unsupervised Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Unsupervised domain adaptation (UDA) aims at exploiting related but different data sources to tackle a common task in a target domain. UDA remains a central yet challenging problem in machine learning. In this paper, we present an approach tailored to moderate-dimensional tabular problems which are hugely important in industrial applications and less well-served by the plethora of methods designed for image and language data. Knothe-Rosenblatt Domain Adaptation (KRDA) is based on the Knothe-Rosenblatt transport: we exploit autoregressive density estimation algorithms to accurately model the different sources by an autoregressive model using a mixture of Gaussians. KRDA then takes advantage of the triangularity of the autoregressive models to build an explicit mapping of the source samples into the target domain. We show that the transfer map built by KRDA preserves each component quantiles of the observations, hence aligning the representations of the different data sets in the same target domain. Finally, we show that KRDA has state-of-the-art performance on both synthetic and real world UDA problems.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 52 references that are in the map. First posted on arXiv 6 Oct 2021.
Builds on
21 of 52 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2015Variational Inference with Normalizing Flowscited by 2,161
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2019A Comprehensive Survey on Transfer Learningcited by 1,154
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2016Pixel Recurrent Neural Networkscited by 814
- 2015Image-based Recommendations on Styles and Substitutescited by 702
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 682
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2019Semi-supervised Domain Adaptation via Minimax Entropycited by 333
9 more
- 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 258
- 2018A DIRT-T Approach to Unsupervised Domain Adaptationcited by 215
- 2019A review of domain adaptation without target labelscited by 154
- 2013RNADE: The real-valued neural autoregressive density-estimatorcited by 65
- 2016Parameterized Machine Learning for High-Energy Physicscited by 33
- 2019Subspace Detours: Building Transport Plans that are Optimal on Subspace Projectionscited by 19
- 2021Model-based micro-data reinforcement learning: what are the crucial model properties and which model to choose?cited by 11
- 2019Evolution of transfer learning in natural language processingcited by 8
- 2020Artificial Intelligence for 5G Wireless Systems: Opportunities, Challenges, and Future Research Directionscited by 3
Built on by
Not cited yet.