Latent-Space Importance Weighting under Covariate Shift
Not on the map. Why?
Abstract (arXiv)
In this work, we propose a transfer learning algorithm for covariate shift, integrating sample reweighting with representation learning. A key feature of our approach is the use of a lower-dimensional latent space for modeling, in contrast to conventional methods that operate directly in the high-dimensional ambient space. Our method estimates the density ratio of learned latent features for downstream weighted prediction. We establish explicit target-domain excess-risk rates with independent data folds for strictly sufficient learned representations with regular learned-space prediction scores and density ratios. We give dimension comparisons under stated smoothness conditions and a variance comparison for true weights and a fixed predictor. General finite-sample inequalities retain representation-quality errors. Experiments on simulated and real-world datasets demonstrate gains from combining learned representations and latent weighting, and reveal sensitivity to initialization and domain choice.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 78 references that are in the map. First posted on arXiv 11 Oct 2026.
Builds on
25 of 78 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
- 2014How transferable are features in deep neural networks?cited by 1,225
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 683
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 612
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
- 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 179
- 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 166
- 2020Deep Network Approximation for Smooth Functionscited by 164
- 2019Deep Network Approximation Characterized by Number of Neuronscited by 122
13 more
- 2020Rethinking Importance Weighting for Deep Learning under Distribution Shiftcited by 93
- 2019The phase diagram of approximation rates for deep neural networkscited by 88
- 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 81
- 2020Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimationcited by 45
- 2019Nonlinear Approximation via Compositionscited by 38
- 2020A One-step Approach to Covariate Shift Adaptationcited by 21
- 2021A Theoretical Analysis on Independence-driven Importance Weighting for Covariate-shift Generalizationcited by 19
- 2019Robust Importance Weighting for Covariate Shiftcited by 15
- 2020Deep Dimension Reduction for Supervised Representation Learningcited by 15
- 2014Fast Computing for Distance Covariancecited by 14
- 2022Doubly Robust Augmented Model Accuracy Transfer Inference with High Dimensional Featurescited by 13
- 2023Towards a Unified Analysis of Kernel-based Methods Under Covariate Shiftcited by 13
- 2023Double-Weighting for Covariate Shift Adaptationcited by 8
Built on by
Not cited yet.