Nearest Neighbor Sampling for Covariate Shift Adaptation
Not on the map. Why?
Abstract (arXiv)
Many existing covariate shift adaptation methods estimate sample weights given to loss values to mitigate the gap between the source and the target distribution. However, estimating the optimal weights typically involves computationally expensive matrix inversion and hyper-parameter tuning. In this paper, we propose a new covariate shift adaptation method which avoids estimating the weights. The basic idea is to directly work on unlabeled target data, labeled according to the k-nearest neighbors in the source dataset. Our analysis reveals that setting k = 1 is an optimal choice. This property removes the necessity of tuning the only hyper-parameter k and leads to a running time quasi-linear in the sample size. Our results include sharp rates of convergence for our estimator, with a tight control of the mean square error and explicit constants. In particular, the variance of our estimators has the same rate of convergence as for standard parametric estimation despite their non-parametric nature. The proposed estimator shares similarities with some matching-based treatment effect estimators used, e.g., in biostatistics, econometrics, and epidemiology. Our experiments show that it achieves drastic reduction in the running time with remarkable accuracy.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 11 of its 48 references that are in the map. First posted on arXiv 15 Dec 2023.
Builds on
11 of 48 references.
References · 11
- 2014Fastfood: Approximate Kernel Expansions in Loglinear Timecited by 72
- 2018Marginal Singularity, and the Benefits of Labels in Covariate-Shiftcited by 65
- 2022Optimally tackling covariate shift in RKHS-based nonparametric regressioncited by 53
- 2016Efficient multivariate entropy estimation via k-nearest neighbour distancescited by 26
- 2020A One-step Approach to Covariate Shift Adaptationcited by 20
- 2022Estimating and Explaining Model Performance When Both Covariates and Labels Shiftcited by 19
- 2022An Information-theoretical Approach to Semi-supervised Learning under Covariate-shiftcited by 18
- 2017Local nearest neighbour classification with applications to semi-supervised learningcited by 17
- 2023Pseudo-Labeling for Kernel Ridge Regression under Covariate Shiftcited by 17
- 2021ADAPT : Awesome Domain Adaptation Python Toolboxcited by 13
- 2023When can Regression-Adjusted Control Variates Help? Rare Events, Sobolev Embedding and Minimax Optimalitycited by 4
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025Concentration and excess risk bounds for imbalanced classification with synthetic oversamplingcited by 3
- 2025Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Associationcited by 1
- 2026Minimum Wasserstein distance estimator under covariate shift: closed-form, super-efficiency and irregularitycited by 1
- 2026Target-Aware Linear Regression Under Distribution Shiftcited by 0
- 2026Local polynomial density ratio estimationcited by 0
- 2026Local polynomial density ratio estimation29 Sep 2026
- 2026Target-Aware Linear Regression Under Distribution Shift22 Jun 2026
- 2026Minimum Wasserstein distance estimator under covariate shift: closed-form, super-efficiency and irregularity12 Jan 2026
- 2025Concentration and excess risk bounds for imbalanced classification with synthetic oversampling23 Oct 2025
- 2025Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Association9 Feb 2025