mlsanityData to 7 Oct 2026

Generalizing Importance Weighting to A Universal Solver for Distribution Shift Problems

arXiv 2305.14690 ↗First posted 24 May 2023cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Distribution shift (DS) may have two levels: the distribution itself changes, and the support (i.e., the set where the probability density is non-zero) also changes. When considering the support change between the training and test distributions, there can be four cases: (i) they exactly match; (ii) the training support is wider (and thus covers the test support); (iii) the test support is wider; (iv) they partially overlap. Existing methods are good at cases (i) and (ii), while cases (iii) and (iv) are more common nowadays but still under-explored. In this paper, we generalize importance weighting (IW), a golden solver for cases (i) and (ii), to a universal solver for all cases. Specifically, we first investigate why IW might fail in cases (iii) and (iv); based on the findings, we propose generalized IW (GIW) that could handle cases (iii) and (iv) and would reduce to IW in cases (i) and (ii). In GIW, the test support is split into an in-training (IT) part and an out-of-training (OOT) part, and the expected risk is decomposed into a weighted classification term over the IT part and a standard classification term over the OOT part, which guarantees the risk consistency of GIW. Then, the implementation of GIW consists of three components: (a) the split of validation data is carried out by the one-class support vector machine, (b) the first term of the empirical risk can be handled by any IW algorithm given training data and IT validation data, and (c) the second term just involves OOT validation data. Experiments demonstrate that GIW is a universal solver for DS problems, outperforming IW methods in cases (iii) and (iv).

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 15 of its 38 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

15 of 38 references.

References · 15

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  4. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  5. 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
  6. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
  7. 2017Unified Deep Supervised Domain Adaptation and Generalizationcited by 322
  8. 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
  9. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
  10. 2017Asymmetric Tri-training for Unsupervised Domain Adaptationcited by 152
  11. 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
  12. 2020Old is Gold: Redefining the Adversarially Learned One-Class Classifier Training Paradigmcited by 115
3 more
  1. 2020Rethinking Importance Weighting for Deep Learning under Distribution Shiftcited by 92
  2. 2020Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examplescited by 44
  3. 2021One-Class Classification: A Surveycited by 35

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 3; 2026: 3.

9 papers.