解决决策中标签不完整时的长期公平性问题
Long-term Fairness with Selective Labels

- 用观测数据和标签预测模型分解公平性度量
- 在半合成环境中达到与已知真实标签相当的公平性
- 适合需长期公平决策的招聘、贷款等场景
长期公平性算法旨在超越静态短时公平概念,考虑决策策略与群体行为之间的动态关系。以往方法通常基于可观测特征和完整标签评估性能与公平性,但在招聘或贷款等场景中,标签(如还款能力)是选择性标签——仅在正面决策后才可获得。本文研究选择性标签下的长期公平性,理论证明直接方法无法保证公平。为此,我们提出新框架,利用观测数据和标签预测模型,将真实公平性度量分解为可观测公平性和标签预测偏差。通过预测模型置信度,可从可观测量推导出满足真实公平性的充分条件。基于此理论,我们设计了一种新型强化学习算法,用于具有选择性标签的长期公平决策。在半合成环境中,该算法在公平性和性能上接近拥有真实标签信息的智能体。
原文摘要 · Abstract (English)
Long-term fairness algorithms aim to satisfy fairness beyond static and short-term notions by accounting for the dynamics between decision-making policies and population behavior. Most previous approaches evaluate performance and fairness measures from observable features and a label, which is assumed to be fully observed. However, in scenarios such as hiring or lending, the labels (e.g., ability to repay the loan) are selective labels as they are only revealed based on positive decisions (e.g., when a loan is granted). In this paper, we study long-term fairness in the selective labels setting and analytically show that naive solutions do not guarantee fairness. To address this gap, we then introduce a novel framework that leverages both the observed data and a label predictor model to estimate the true fairness measure value by decomposing it into the observed fairness and bias from label predictions. This allows us to derive sufficient conditions to satisfy true fairness from observable quantities by using the confidence in the predictor model. Finally, we rely on our theoretical results to propose a novel reinforcement learning algorithm for effective long-term fair decision-making with selective labels. In semisynthetic environments, the proposed algorithm reached comparable fairness and performance to an agent with oracle access to the true labels.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。