When Invariant Representation Learning Meets Label Shift: Insufficiency and Theoretical Insights
You-Wei Luo, Chuan-Xian Ren

TL;DR
This paper investigates the limitations of invariant representation learning under label shift, introduces theoretical bounds and a kernel embedding correction algorithm, demonstrating the importance of generalized label shift correction for robust generalization.
Contribution
It provides new theoretical insights into GLS, proves the insufficiency of invariant learning alone, and proposes a novel KECA algorithm for effective shift correction.
Findings
Invariant representation learning is insufficient under GLS.
GLS correction is necessary and sufficient for better generalization.
The proposed KECA algorithm outperforms existing methods in experiments.
Abstract
As a crucial step toward real-world learning scenarios with changing environments, dataset shift theory and invariant representation learning algorithm have been extensively studied to relax the identical distribution assumption in classical learning setting. Among the different assumptions on the essential of shifting distributions, generalized label shift (GLS) is the latest developed one which shows great potential to deal with the complex factors within the shift. In this paper, we aim to explore the limitations of current dataset shift theory and algorithm, and further provide new insights by presenting a comprehensive understanding of GLS. From theoretical aspect, two informative generalization bounds are derived, and the GLS learner is proved to be sufficiently close to optimal target model from the Bayesian perspective. The main results show the insufficiency of invariant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
