LGMLJul 8, 2020

A One-step Approach to Covariate Shift Adaptation

arXiv:2007.04043v333 citations
AI Analysis

This addresses covariate shift, a common problem in real-world ML where training and test distributions differ, offering a more efficient alternative to existing two-step methods.

The paper tackles covariate shift adaptation by proposing a one-step approach that jointly learns the predictive model and importance weights, minimizing an upper bound of test risk, and demonstrates its effectiveness empirically.

A default assumption in many machine learning scenarios is that the training and test samples are drawn from the same probability distribution. However, such an assumption is often violated in the real world due to non-stationarity of the environment or bias in sample selection. In this work, we consider a prevalent setting called covariate shift, where the input distribution differs between the training and test stages while the conditional distribution of the output given the input remains unchanged. Most of the existing methods for covariate shift adaptation are two-step approaches, which first calculate the importance weights and then conduct importance-weighted empirical risk minimization. In this paper, we propose a novel one-step approach that jointly learns the predictive model and the associated weights in one optimization by minimizing an upper bound of the test risk. We theoretically analyze the proposed method and provide a generalization error bound. We also empirically demonstrate the effectiveness of the proposed method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes