Adapting to Online Label Shift with Provable Guarantees
Yong Bai, Yu-Jie Zhang, Peng Zhao, Masashi Sugiyama, Zhi-Hua Zhou

TL;DR
This paper addresses online label shift in machine learning, proposing a new risk estimator and ensemble algorithms with provable guarantees, achieving optimal dynamic regret under changing label distributions.
Contribution
It introduces an unbiased risk estimator and novel online ensemble methods for online label shift, with theoretical guarantees and adaptive performance bounds.
Findings
Achieves optimal dynamic regret in online label shift scenarios.
Effectively adapts to label distribution changes over time.
Validated through extensive experiments supporting theoretical results.
Abstract
The standard supervised learning paradigm works effectively when training data shares the same distribution as the upcoming testing samples. However, this stationary assumption is often violated in real-world applications, especially when testing data appear in an online fashion. In this paper, we formulate and investigate the problem of \emph{online label shift} (OLaS): the learner trains an initial model from the labeled offline data and then deploys it to an unlabeled online environment where the underlying label distribution changes over time but the label-conditional density does not. The non-stationarity nature and the lack of supervision make the problem challenging to be tackled. To address the difficulty, we construct a new unbiased risk estimator that utilizes the unlabeled data, which exhibits many benign properties albeit with potential non-convexity. Building upon that, we…
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
Taxonomy
TopicsMachine Learning and Data Classification · Advanced Bandit Algorithms Research · Data Stream Mining Techniques
