A Short Survey on Importance Weighting for Machine Learning
Masanari Kimura, Hideitsu Hino
TL;DR
The paper surveys the use of importance weighting to address distribution shift and other ML challenges by leveraging density ratios $p_{te}(\mathbf{x})/p_{tr}(\mathbf{x})$. It covers foundational tools such as density ratio estimation, and applies them across covariate shift, target shift, sample selection bias, subpopulation and feedback shifts, as well as domain adaptation, DRO, active learning, calibration, PU learning, label noise, fairness, and deep learning. The main contribution is organizing a wide range of methods under the importance weighting framework, highlighting both theoretical guarantees (e.g., unbiasedness under covariate shift) and practical robustness considerations (AIWERM, RIWERM, DIW). This unified view clarifies when and how density ratios drive effective weighting, guiding methodological choices and future research for robust, fair, and scalable ML systems.
Abstract
Importance weighting is a fundamental procedure in statistics and machine learning that weights the objective function or probability distribution based on the importance of the instance in some sense. The simplicity and usefulness of the idea has led to many applications of importance weighting. For example, it is known that supervised learning under an assumption about the difference between the training and test distributions, called distribution shift, can guarantee statistically desirable properties through importance weighting by their density ratio. This survey summarizes the broad applications of importance weighting in machine learning and related research.
