arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.08559cs.LGcs.CYstat.ML
收藏

低数据场景下的公平主动学习

Fair Active Learning in Low-Data Regimes

University of Washington(华盛顿大学)

Romain Camilleri, Andrew Wagenmaker, Jamie Morgenstern, Lalit Jain, Kevin Jamieson

AI总结:

针对数据稀缺环境下现有公平主动学习需大量标记数据、难满足总体公平约束的问题,提出结合后验采样式探索与公平分类子例程的框架,在低数据场景下实现高概率满足公平约束的同时提升准确率,性能优于现有最优方法。

摘要:

在关键的机器学习应用中,确保公平性对于避免加剧社会不平等至关重要。在本研究中,我们解决了数据稀缺环境下降低偏差并提升准确率的挑战——这类环境中,标记数据的收集成本过高,无法使用大规模标记数据集。在这类场景下,主动学习有望最大化少量标记数据带来的边际准确率增益。然而,现有的面向公平性的主动学习应用未能实现这一目标,它们通常需要大规模标记数据集,或者无法确保在总体分布上满足预期的公平性容差。\n为解决这些局限,我们提出了一种创新的主动学习框架,该框架将受后验采样启发的探索流程与公平分类子例程相结合。我们证明,该框架在数据极度稀缺的场景下表现出色,能够在高概率满足公平性约束的同时最大化准确率。我们使用成熟的真实基准数据集对所提方法进行评估,并与当前最优方法进行对比,证明了其在生成公平模型方面的有效性,以及相较现有方法的性能提升。

英文摘要:

In critical machine learning applications, ensuring fairness is essential to avoid perpetuating social inequities. In this work, we address the challenges of reducing bias and improving accuracy in data-scarce environments, where the cost of collecting labeled data prohibits the use of large, labeled datasets. In such settings, active learning promises to maximize marginal accuracy gains of small amounts of labeled data. However, existing applications of active learning for fairness fail to deliver on this, typically requiring large labeled datasets, or failing to ensure the desired fairness tolerance is met on the population distribution. To address such limitations, we introduce an innovative active learning framework that combines an exploration procedure inspired by posterior sampling with a fair classification subroutine. We demonstrate that this framework performs effectively in very data-scarce regimes, maximizing accuracy while satisfying fairness constraints with high probability. We evaluate our proposed approach using well-established real-world benchmark datasets and compare it against state-of-the-art methods, demonstrating its effectiveness in producing fair models, and improvement over existing methods.

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

↑