arXiv:2604.01651cs.LG2026-04被引 5

提出一种增量更新先验的标签分布估计方法,提升实际场景下的模型适应性。

Label Shift Estimation With Incremental Prior Update

  • 通过逐样本增量更新先验,优化后验估计精度
  • 在CIFAR-10和MNIST上优于现有最大似然方法
  • 适用于任意黑盒概率分类器,对校准要求更低

监督学习常假设训练集与测试集具有相同的标签分布,但现实场景中这一假设极少成立。例如医疗诊断结果随时间与地域变化,欺诈检测需应对行为模式转移,社交媒体内容类别受热点话题与用户群体影响而动态改变。标签分布估计任务的目标是在不发生概念漂移(即条件概率 $p(x|y)$ 不变)的前提下,估计测试集中的标签分布 $p_t(y)$。本文提出一种新的事后标签分布估计方法,不同于以往依赖验证集混淆矩阵进行矩匹配或使用期望最大化算法最大化新数据似然的方法。该方法基于现代概率分类器普遍成立的直观假设,通过逐样本增量更新先验,调整后验以获得更精确的标签分布估计。所提方法对校准的要求弱于其他方法。作为通用的事后估计框架,可应用于任意黑盒概率分类器。在CIFAR-10和MNIST上的实验表明,该方法在不同校准条件和不同标签偏移强度下均持续优于当前最优的最大似然方法。

原文摘要 · Abstract (English)

An assumption often made in supervised learning is that the training and testing sets have the same label distribution. However, in real-life scenarios, this assumption rarely holds. For example, medical diagnosis result distributions change over time and across locations; fraud detection models must adapt as patterns of fraudulent activity shift; the category distribution of social media posts changes based on trending topics and user demographics. In the task of label shift estimation, the goal is to estimate the changing label distribution $p_t(y)$ in the testing set, assuming the likelihood $p(x|y)$ does not change, implying no concept drift. In this paper, we propose a new approach for post-hoc label shift estimation, unlike previous methods that perform moment matching with confusion matrix estimated from a validation set or maximize the likelihood of the new data with an expectation-maximization algorithm. We aim to incrementally update the prior on each sample, adjusting each posterior for more accurate label shift estimation. The proposed method is based on intuitive assumptions on classifiers that are generally true for modern probabilistic classifiers. The proposed method relies on a weaker notion of calibration compared to other methods. As a post-hoc approach for label shift estimation, the proposed method is versatile and can be applied to any black-box probabilistic classifier. Experiments on CIFAR-10 and MNIST show that the proposed method consistently outperforms the current state-of-the-art maximum likelihood-based methods under different calibrations and varying intensities of label shift.

标签偏移概率校准增量学习分类器泛化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。