Addressing the problem of fairness is crucial to safely use machine learning algorithms to support decisions with a critical impact on people's lives such as job hiring, child maltreatment, disease diagnosis, loan granting, etc. Several notions of fairness have been defined and examined in the past decade, such as, statistical parity and equalized odds. The most recent fairness notions, however, are causal-based and reflect the now widely accepted idea that using causality is necessary to appropriately address the problem of fairness. This paper examines an exhaustive list of causal-based fairness notions, in particular their applicability in real-world scenarios. As the majority of causal-based fairness notions are defined in terms of non-observable quantities (e.g. interventions and counterfactuals), their applicability depends heavily on the identifiability of those quantities from observational data. In this paper, we compile the most relevant identifiability criteria for the problem of fairness from the extensive literature on identifiability theory. These criteria are then used to decide about the applicability of causal-based fairness notions in concrete discrimination scenarios.
翻译:解决公平问题对于安全地使用机算法支持对人民生活有重大影响的决策至关重要,如雇用工作、虐待儿童、疾病诊断、贷款等。过去十年中,界定和审查了若干公平概念,例如统计均等和机会均等。但是,最近的公平概念基于因果关系,反映了目前广泛接受的关于必须使用因果关系来适当解决公平问题的观点。本文件审查了基于因果关系的公平概念的详尽清单,特别是它们在现实世界中的适用性。由于大多数基于因果关系的公平概念是以不可观察的数量(例如干预和反事实)界定的,因此其适用性在很大程度上取决于观察数据中这些数量的可识别性。在本文件中,我们汇编了从关于可识别性理论的广泛文献中得出的关于公平问题的最相关的可识别性标准。这些标准随后被用来决定基于因果关系的公平概念在具体歧视情景中的可适用性。