arXiv:2602.14952cs.LGmath.OC2026-02

提出自适应多目标学习方法,应对数据分布变化时的预测偏差问题。

Locally Adaptive Multi-Objective Learning

  • 用在线自适应算法替代原方法中固定部分,实现局部动态调整。
  • 在能源预测和公平性数据集上,显著降低子群体偏差并保持鲁棒性。
  • 适合需要实时响应分布变化的场景,如在线推荐与金融风控。

我们研究同时满足多个学习目标的预测器构建问题,涵盖校准、后悔和多精度等具体目标。在数据分布可能任意变化的在线设定下,现有方法通常以最坏情况最小化全局目标,实践中难以适应分布漂移。先前工作尝试通过引入局部子区间保证来缓解此问题,但实证评估不足。本文提出一种新方法:将多目标学习中的一部分替换为自适应在线算法,从而实现局部自适应。在能源预测与算法公平性数据集上的实验表明,该方法优于现有方案,在子群体上实现无偏预测,且在分布变化下仍具鲁棒性。

原文摘要 · Abstract (English)

We consider the general problem of learning a predictor that satisfies multiple objectives of interest simultaneously, a broad framework that captures a range of specific learning goals including calibration, regret, and multiaccuracy. We work in an online setting where the data distribution can change arbitrarily over time. Existing approaches to this problem aim to minimize the set of objectives over the entire time horizon in a worst-case sense, and in practice they do not necessarily adapt to distribution shifts. Earlier work has aimed to alleviate this problem by incorporating additional objectives that target local guarantees over contiguous subintervals. Empirical evaluation of these proposals is, however, scarce. In this article, we consider an alternative procedure that achieves local adaptivity by replacing one part of the multi-objective learning method with an adaptive online algorithm. Empirical evaluations on datasets from energy forecasting and algorithmic fairness show that our proposed method improves upon existing approaches and achieves unbiased predictions over subgroups, while remaining robust under distribution shift.

多目标学习在线学习自适应公平性

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