arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14952cs.LGmath.OCstat.MEstat.ML
收藏

局部自适应多目标学习

Locally Adaptive Multi-Objective Learning

University of California, Berkeley(加州大学伯克利分校);Inria(法国国家信息与自动化研究所)

Jivat Neet Kaur, Isaac Gibbs, Michael I. Jordan

AI总结:

本文提出一种局部自适应多目标学习方法,通过替换部分算法提升预测的公平性和鲁棒性。

摘要:

我们考虑学习一个满足多个目标的预测器的一般问题,这是一个广泛的框架,涵盖了包括校准、遗憾和多准确性在内的多种具体学习目标。我们处于一个在线环境中,其中数据分布可以随时间任意变化。现有方法旨在在时间范围内以最坏情况最小化目标集,在实践中它们不一定适应分布变化。早期的工作试图通过引入额外的目标来缓解这个问题,这些目标针对连续子区间内的局部保证。然而,这些提议的实证评估却相当有限。在本文中,我们考虑了一种替代方法,通过将多目标学习方法的一部分替换为适应性在线算法来实现局部适应性。在能源预测和算法公平性数据集上的实证评估显示,我们的方法在现有方法上有所改进,并在子群体上实现了无偏预测,同时在分布变化下保持稳健。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑