<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>ORCID:</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>When the Ideal Does Not Compute: Nonideal Theory and Fairness in Machine Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Otto Sahlgren</string-name>
          <email>otto.sahlgren@tuni.fi</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Tampere University</institution>
          ,
          <addr-line>Tampere</addr-line>
          ,
          <country country="FI">Finland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2009</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0001</lpage>
      <abstract>
        <p>Recent studies have identified numerous shortcomings in the dominant methodology for evaluating and implementing fairness in machine learning, which have been explicitly or implicitly attributed to the field's “ideal mode of theorizing”. Similarly to ideal theories of justice, fair machine learning methods have been alleged to be unsuitable or practically irrelevant as tools for evaluating and enhancing justice in circumstances characterized by structural injustice and feasibility constraints. This has been taken to indicate the need for a methodological turn in the field, similarly to the turn towards 'nonideal theory' in normative political philosophy. Drawing on philosophical literature on ideal and nonideal theory, this paper examines what a nonideal mode of theorizing in fair machine learning would look like in practice. The key contribution of the paper is an outline of six possible nonideal approaches which are connected to established conceptions of nonideal theory in political philosophy and illustrated with examples from recent research on fair machine learning. The paper then suggests that the dominant “ideal” approach and the six different kinds of “nonideal” alternatives are not fundamentally incompatible. They are grounded in diverging theoretical and practical aims and therefore address different kinds of questions, employ different kinds of idealizations. Still, they offer mutually complementary perspectives to evaluating and promoting fairness in (socio)technical machine learning systems. Overall, the paper contributes to current debates on fair machine learning methodology by bridging literatures in political philosophy and fair machine learning and by depicting a broader landscape of methodologies at the field's disposal. algorithmic fairness, fair machine learning, ideal theory, methodology, nonideal theory, political philosophy EWAF'24: European Workshop on Algorithmic Fairness, July 01-03 2024, Mainz, Germany.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        From domains such as medical care and finance to criminal justice and education, decision-makers
increasingly use predictive models trained with machine learning (ML) algorithms to generate
assessments and predictions, which often inform consequential decisions about individuals’ access to
important goods and opportunities. Predictive models may inherit and learn problematic biases from
their training data, including but not limited to biases that track past and present injustice,
introducing risks for unfair discrimination and inequitable outcomes in real-life prediction-based
decision-making [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Fair ML research (sometimes called algorithmic fairness) has sought to address
these issues, proposing numerous measures and methods for evaluating and implementing values
such as fairness, equality, and justice in predictive models and decision-making algorithms [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
However, critical studies have highlighted numerous problems that pertain to the application of
dominant fair ML methods as means to address unfairness and other algorithmic wrongs [
        <xref ref-type="bibr" rid="ref10 ref4 ref5 ref6 ref7 ref8 ref9">4–10</xref>
        ].
These problems raise important methodological questions about their relevance and usefulness in
assessing, preventing, and rectifying potential injustices in real-life settings. Following Sina
Fazelpour’s and Zachary Lipton’s [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] example, this paper situates these critiques and shortcomings
in debates surrounding ideal and nonideal modes of theorizing in normative political theory (see [11–
      </p>
      <p>2024 Copyright for this paper by its authors.
CEUR</p>
      <p>ceur-ws.org
13]). In particular, it provides an account of how nonideal modes of theorizing could be harnessed in
the fair ML, outlining six approaches and their connections to the philosophical literature on ideal
and nonideal theory.</p>
      <p>
        The paper is structured as follows. Section 2 begins with a brief overview of fairness criteria,
metrics, and debiasing techniques, and then proceeds to contextualize methodological debates in fair
ML against the backdrop of discussions surrounding non/ideal modes of theorizing in normative
political theory. There, I further bridge the fair ML and political theory literatures and their respective
debates, demonstrating connections between (i) the dominant methodologies in both fields, (ii) critical
arguments that have been advanced against those approaches, and (iii) proposals for methodological
reorientation in both fields. Section 2 concludes with the observation that, though numerous political
theorists have called for a methodological turn towards nonideal theory, little consensus has been
achieved on the exact nature of nonideal theory and its relation to ideal theory (see [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]). This
lack of consensus raises the corresponding “pragmatic question of what precisely a non-ideal
approach [to fair ML] might look like in practice” [4, p. 62; italics added]. Furthermore, it brings into
question the extent to which the theoretical resources (e.g., extant fairness criteria) and practical
prescriptions (e.g., bias mitigation strategies) offered by dominant fair ML approaches remain
relevant or applicable in nonideal decision-making settings (if at all). This paper answers both of these
questions. The primary contribution of this paper is found in Sections 3 and 4 where, drawing on
philosophical literature around non/ideal theory, I outline six different ways of doing ‘nonideal
theory’ in fair ML which correspond to existing conceptions regarding the nature and aims of
nonideal theory. I describe the motivations of each approach and illustrate them with examples from
the fair ML literature. The outlined approaches notably depart from the dominant fair ML
methodology in different ways. The three approaches described in Section 3 reimagine how the ideals
operationalized by fairness metrics are specified and employed to guide ML model evaluation and
fairness-enhancing intervention design. Three further approaches described in Section 4 theorize fair
ML from a “fact-sensitive” perspective, seeking to refrain from idealized modelling assumptions and
to address questions that arise in decision-making settings with nonmarginal noncompliance, for
instance. Section 5 draws on Alan Hamlin and Zofia Stemplowska’s account [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] to propose a
taxonomy of theory that clarifies the relationship between ideal and nonideal approaches to fair ML.
They are not fundamentally distinct but rather form a continuum of approaches to implementing
values (or ideals) in (socio)technical systems. Though different approaches are characterized by
different aims, they can complement one another. The final section summarizes the paper’s
contributions.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. The methods of fairness in nonideal circumstances</title>
      <p>Most work on fair ML follows a pattern which can characterized roughly as follows: First, a set of
criteria for fairness is adopted or proposed and operationalized into a corresponding set of fairness
metric(s) which the decision-maker then uses to evaluate available ML models. Second, if unfair bias
is identified according to the metric(s), the decision-maker implements a debiasing technique to
mitigate or eliminate that bias and, therefore, to secure the model’s fairness. Noting this pattern, Sina
Fazelpour and Zachary Lipton argue that there is “a connection between the recent literature on fair
machine learning and the ideal approach in political philosophy” and suggest that the shortcomings
of the dominant approaches, as documented in a number of critical examinations, “reflect broader
troubles faced by the ideal approach” [4, p. 57]. This paper further bridges the two literatures by
showing connections between (i) the methodologies of dominant approaches in both fields, (ii) critical
arguments advanced against those approaches, and (iii) calls for methodological reorientation in both
fields. This section will take first steps in this regard by introducing dominant approaches to fairness
in ML, the so-called non/ideal theory demarcation, related debates in political theory, and by briefly
outlining the previously mentioned connections. The shortcomings of ideal approaches are also
discussed in more detail in Sections 3 and 4.
2.1.</p>
    </sec>
    <sec id="sec-3">
      <title>Fairness in machine learning</title>
      <p>
        Research on fairness in ML has proposed numerous criteria for fairness which express conditions that
a predictive model should satisfy to meet some broader notion or principle of fairness (see [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ]). In
this literature, ‘fairness’ is often understood in terms of non-discrimination, but also in other terms
of other egalitarian notions and justice [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. For this reason, I will throughout this paper use the term
‘fairness’ as it is used in the fair ML literature, where the term encompasses a broad range of
normative egalitarian considerations. Fairness criteria are generally formalized as a property of the
joint distribution of the features included in the model (X), sensitive attributes such as ‘race’ or
‘gender’ (A), predictions viewed as numeric scores or classifications ( ̂), and the “ground truth” labels
(Y) representing the outcome, property, or behavior that is being predicted. Existing fairness criteria
come in different flavors, representative of different ways to model fairness in prediction settings.
Table 1 mentions three popular classes of fairness criteria and provides some examples of metrics for
binary classification tasks, where classifications are denoted with  ̂ = [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ], actual outcomes (“ground
truth”) with Y = [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ], sensitive attributes with A = [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ], and decision subjects with I.
Statistical Criteria. Fairness is defined as parity in a model performance statistic between a set of comparison
classes. The equalized performance metric depends on the definition.
      </p>
      <p>
        Statistical Parity [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]: The likelihood of receiving a positive prediction is probabilistically independent of
the value of A. Formally: P ( ̂ = 1 | A = 0) = P ( ̂ = 1 | A = 1).
      </p>
      <p>
        Predictive Parity [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]: The likelihood of receiving a true positive prediction is probabilistically independent
of the value of A. Formally: P ( ̂ = 1 | Y = 1, A = 0) = P ( ̂ = 1 | Y = 1, A = 1)
Equalized Odds [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]: The likelihood of receiving a false positive or false negative prediction is
probabilistically independent of the value of A. Formally: P ( ̂ = 1 | Y = 0, A = 0) = P (  ̂ = 1 | Y = 0, A = 1)
and P ( ̂ = 0 | Y = 1, A = 0) = P ( ̂ = 0 | Y = 1, A = 1).
      </p>
      <p>Counterfactual and Causal Criteria. Fairness is operationalized in terms of counterfactual expectations
or causal pathways between model features and the classification.
•</p>
      <p>
        Counterfactual Fairness [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]: The classification  ̂ should be insensitive to permuting the value of A.
      </p>
      <p>Formally:  ̂i (A = 0) =  ̂i (A = 1) for all individuals I.</p>
      <p>Similarity-based Criteria. Fairness is defined in terms similar decision subjects receiving similar
classifications.</p>
      <p>
        Fairness Through Awareness [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]: Individuals I who are similar in terms of a pre-defined set of model
features X (where X excludes A) receive similar classifications  ̂. Precise formalization depends on the
applied measure of similarity (or distance).
•
•
•
•
For instance, counterfactual and causal criteria define fairness in terms of (un)acceptable dependencies
between model features and the output. Statistical criteria, in turn, define fairness in terms of parity
between compared groups with respect to some statistical measure of model performance (see Table
2). Whereas the former class of criteria depicts an ideal set of causal relationships between input
features and the output that a fair predictive model should exhibit, the latter class operationalizes,
albeit in different ways, the notion that information about individuals’ sensitive attributes should not
affect their treatment, where treatment is understood in terms of the received (correct or incorrect)
classifications or predictions. In practice, the preferred set of formal fairness criteria is then further
specified into a set of fairness metrics which the decision-maker uses to evaluate, compare, and select
between available ML models. Unfair bias that is identified by employing the metric(s) is commonly
eliminated, or at least mitigated, with the help of debiasing techniques. Existing techniques can be
distinguished into three classes based on their points of intervention: (i) pre-processing techniques
balance or resample the model’s training data, (ii) in-processing techniques adjust or constrain the
learning algorithm, and (iii) post-processing methods intervene directly on the model outputs (see
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]).
A growing body of critical studies has documented various shortcomings related to the application
of fair ML methods as means to assess and secure non-discrimination, equality, and justice in
MLsupported decision-making [
        <xref ref-type="bibr" rid="ref10 ref4 ref5 ref6 ref7 ref8 ref9">4–10</xref>
        ]. In some critiques, the shortcomings are explicitly traced to the
ideal mode of theorizing employed by dominant approaches. For instance, Fazelpour and Lipton [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
argue that fair ML engages in “small-scale” ideal theorizing and Davis et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] argue that dominant
approaches operate under a misguided “algorithmic idealism”. To contextualize these claims and the
identified shortcomings of standard approaches, we need to take a detour into debates on non/ideal
theory in political philosophy.
2.2.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Non/ideal theory on larger and smaller scales</title>
      <p>
        John Rawls famously distinguishes the theory of justice into two complementary parts: The first one
is ideal theory which “assumes strict compliance and works out the principles that characterize a
well-ordered society under favorable circumstances” [19, p. 245]. If properly defined, the principles
constitutive of ‘perfect justice’, Rawls suggested, specify both a normative target towards which
societies should aspire and provide a set of evaluative standards in light of which current institutions
and social arrangements can be assessed (see also [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]). The second part, nonideal theory, starts from
more realistic assumptions (e.g., nonmarginal noncompliance to the principles) and assumes less
favorable societal conditions (e.g., historical injustice). It seeks to explain how actual (unjust) societies
could be made more just, proposing principles that should govern “adjustments to natural limitations
and historical contingencies” (e.g., accommodations for people with disabilities) and responses to
injustice (e.g., retributive justice, just warfare) [19, p. 246]. There is an order of primacy here, Rawls
suggests: once ideal theory fixes an ideal conception of justice that would regulate societal
arrangements in ideal circumstances, nonideal theory can devise justifiable principles for addressing
problems that occur in less ideal societies.
      </p>
      <p>Note that dominant approaches to fair ML conform primarily to the first, ideal part of the Rawlsian
demarcation. The adopted set of fairness criteria for predictive models are commonly treated as
specifying or operationalizing some broader ‘ideal’ (or general notion) of fairness, and therefore as
providing both (i) a yardstick for evaluating predictive models and their expected distributive patterns
(i.e., a fairness metric) and (ii) a normative target they should satisfy or at least approximate (i.e., a set
of fairness requirements). Upon evaluation, “[t]he magnitude of (dis)parity measured by a given
fairness metric is taken to denote the degree of divergence from the ideal for which that metric is
supposed to be a formal proxy” [4, p. 59]. If an unfair disparity is detected, a debiasing technique is
typically applied to produce a new ML model that maximizes overall model performance subject to
the satisfaction of the metric(s) [5, p. 48]. Deviations from the ‘ideal’ are, in other words, treated as
instances of pro tanto unfairness or injustice which can and should be addressed, at least in part, by
closing the discrepancy between the available predictive model and one that satisfies the preferred
metric(s).</p>
      <p>
        Rawls’ writings sprouted a number of parallel and ongoing debates regarding the non/ideal theory
demarcation as well as the relevance and practical usefulness of ideal theory for the purpose of
enhancing justice in the real world. Rawls’ demarcation has been subject to heated debate (see [
        <xref ref-type="bibr" rid="ref11 ref12">11,
12</xref>
        ]) and some theorists reject the idea that ideal theory is somehow theoretically primary in relation
to nonideal theory (e.g., [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]). For a large part, the following debates have revolved around claims
that ideal theory has restricted use in actual, nonideal circumstances, if at all. For instance, ideal
theory has been argued to distort our understanding of justice by misrepresenting actual injustices
such as racial oppression [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] and to provide misguided or unattainable prescriptions about how we
should secure justice when ‘perfect justice’ is infeasible [
        <xref ref-type="bibr" rid="ref20 ref23 ref24 ref25">20, 23–25</xref>
        ]. In addition, some argue that
knowing what constitutes ‘perfect justice’ is both unnecessary and insufficient for determining what
is (un)just in our actual circumstances [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. In response to these claims, many political theorists have
since called for a methodological turn towards political theory which would forego or somehow
depart from the central tenets of ideal approaches (e.g., [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]). In particular, theorists have proposed a
turn towards nonideal theory which would be “realistic” and “fact-sensitive”, action-guiding and
feasible to implement, and capable identifying and addressing past and present injustices (e.g., [
        <xref ref-type="bibr" rid="ref22 ref23">22,
23</xref>
        ] and see also [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]).
      </p>
      <p>
        Many of the concerns expressed in regard to standard fair ML methods align with the previously
mentioned problems that supposedly plague ideal modes of theorizing. The connection is explicit in
certain works which note that the characteristically ideal modes theorizing of fair ML research will
“always be inadequate in a context that is fundamentally unjust” [6, p. 2] and provide “ineffective
solutions to current injustices” [4, p. 58]. Further critical studies on fair ML do not explicitly reference
the non/ideal theory debate, but advance arguments which closely resemble ones that have been
directed against ideal theories of justice in the political domain. For instance, critiques of idealization
and unreasonable abstraction are commonly employed against paradigmatic theories of justice (see
[
        <xref ref-type="bibr" rid="ref11 ref12 ref22 ref23">11, 12, 22, 23</xref>
        ]) but also more recently against dominant approaches to fair ML [
        <xref ref-type="bibr" rid="ref10 ref4 ref6 ref8">4, 6, 8, 10</xref>
        ]. These
shortcomings and critical arguments will be discussed in detail in Sections 3 and 4. For now, it is
useful to also note parallels between political theorists’ proposals to shift the focus towards nonideal
theory and recent proposals seeking to reorient fair ML research and practice, though, again, the
latter proposals are not always explicitly advanced under the label of ‘nonideal theory’. Indeed, the
latter kinds of proposals are grounded in similar views as the former, suggesting that fair ML should
be approached from a “realistic” [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], “fact-sensitive” [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or “sociotechnical” perspective [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], on the
one hand, and stating that the methods employed to evaluate and design predictive models and
decision-making algorithms should be equipped to address injustices both past and present, on the
other [
        <xref ref-type="bibr" rid="ref4 ref6 ref9">4, 6, 9</xref>
        ].
2.3. The
challenges
methodological turn in fair
machine learning and its
Debates surrounding non/ideal theory are infamously obfuscated and lacking in consensus. Here, I
highlight two open questions that are relevant also for debates on the methodology of fair ML. On
the one hand, political theorists have struggled to specify what exactly distinguishes nonideal theory
from ideal theory, if anything. Nonideal theory has traditionally been defined negatively, as departing
from some particular defining feature(s) of ideal theory, but some argue that existing demarcations
do not capture the complexity of the surrounding debates and concerns (see [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]). Though extant
proposals to reorient fair ML methodology are not always explicitly motivated by nonideal theory,
most of them employ a similar strategy: they identify and seek to address some particular gap(s) or
shortcoming(s) of the dominant approach (e.g., infeasibility, incapacity to handle past and present
injustice). This strategy can be beneficial in and of itself, but it leaves open the “pragmatic question
of what precisely a non-ideal approach [to fair ML] might look like in practice” [4, p. 62]. On the other
hand, political theorists have not achieved consensus on whether nonideal theory requires or perhaps
even needs ideal theory (i.e., what is the relation between ideal and nonideal theory). Some argue that
nonideal theory is all there is (e.g., [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]). Others claim that ideal theory does not equip us with the
theoretical means to address injustice specifically in nonideal circumstances (e.g., [
        <xref ref-type="bibr" rid="ref20 ref22">20, 22</xref>
        ]). Still others
suggest that nonideal theory need not entirely dispense with ideals; rather, it must understand their
functions differently in such circumstances (e.g., [26, p. 5]). In particular, it might be that “we need to
interpret the ideal-theoretical principles in a context with nonideal circumstances” or instead
“develop a new set of nonideal principles of justice […] by adding layers of relevant facts from the
nonideal world to the ideal theory, using the ‘theoretical resources’ that are available in the ideal
theory” [27, p. 348]. Similarly, then, if fair ML is due a methodological turn, we must address the
question of whether and to what extent the theoretical resources (e.g., fairness notions and fairness
criteria) and practical prescriptions (e.g., bias mitigation strategies) offered by dominant approaches
are relevant or applicable in nonideal decision-making settings.
      </p>
      <p>
        In the remainder of this paper, I outline answers to both questions. Drawing on both critical
examinations of fair ML methods and philosophical literature on non/ideal theory, I describe four
general approaches to theorizing fair ML from a nonideal perspective (summarized in Table 3 below).
I contextualize their motivations, examine their central features, and demonstrate how they track
existing demarcations of non/ideal theory and justifications for nonideal theory in political
philosophy (see [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]). The first three options (Section 2) depart from the dominant ideal approach
in terms of how metrics for evaluating predictive models are specified and/or how they function in
the praxis of model evaluation and improvement. The fourth set of options centers on the modelling
assumptions employed upon evaluating and implementing fairness, aligning with the idea that
nonideal theory is “fact-sensitive” or “realistic” and thus contrasts with ideal approaches which
employ considerable methodological abstractions and idealizations. I will describe three possible and
mutually compatible ways in which an approach to fair ML might be considered ‘fact-sensitive’
(Section 4). There may be further conceptions of nonideal theory applicable to fair ML; I aim to only
provide a neutral and general description of some prominent ones. Furthermore, I do not claim that
the works on fair ML cited throughout the discussion actually advocate the discussed conceptions of
nonideal theory, though I will mention some works that do.
Positive approach: Negativist (or critical) approach:
Identifying and implementing requirements for Identifying and mitigating unfairness, inequality, or
fairness, equality, and justice (or related values). injustice (or related wrongs).
      </p>
      <p>Perfectionist / End-state approach:
Identifying the fairest possible model and
implementing it, often via a one-shot debiasing
intervention.</p>
      <p>Comparativist approach:
Identifying and implementing the comparatively fairest
model within the feasible set.</p>
      <p>Transitional approach:
Long-term improvement (or satisfaction) of fairness
metrics by identifying and implementing feasible that
satisfy transitional fairness requirements.</p>
      <p>Fact-insensitive approach:
Identifying and implementing fairness
requirements and fairness-enhancing interventions
under idealized assumptions and significant
abstractions (e.g., strict compliance, absence of
historical injustice).</p>
      <p>Fact-sensitive (or realist) approach:
Identifying and implementing fairness requirements
and fairness-enhancing interventions under less
idealized assumptions (e.g., past, present, or future
partial compliance) and informed by comprehensive
empirical models (e.g., sociotechnical context).</p>
    </sec>
    <sec id="sec-5">
      <title>3. The evaluative and normative function of the ideal</title>
      <p>
        Ideal theory has been attributed numerous labels ranging from ‘perfectionist’ or ‘utopian’ theory to
‘transcendental institutionalism’ and ‘end-state’ theory (see [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]). These labels underscore that
paradigmatic theories of justice seek to answer the question of what constitutes ‘perfect justice’,
usually by identifying the societal arrangement(s) that would realize justice so defined (e.g., [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]).
They are often also attributed two views: first, that principles constitutive of ‘perfect justice’ provide
the metric(s) for evaluating whether and to what extent social arrangements realize justice and,
second, that they specify a normative goal which should guide decisions between available
arrangements or justice-enhancing reforms (e.g., [
        <xref ref-type="bibr" rid="ref20 ref24">20, 24</xref>
        ]). Recall here that dominant fair ML
methodologies operate under similar understandings, often proposing or adopting some notion and
corresponding measure(s) of fairness which then functions as an evaluative standard and a target to
be achieved through debiasing (see [
        <xref ref-type="bibr" rid="ref28 ref4">4, 28</xref>
        ]). For these reasons, they are subject to similar shortcomings
as ideal theories of justice [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. For instance, just as implementing a perfectly just societal arrangement
can be infeasible given our current circumstances (e.g., [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]), satisfying the kinds of parity
requirements prescribed by most fairness criteria is oftentimes unattainable in realistic modelling
settings due to tradeoffs [
        <xref ref-type="bibr" rid="ref16 ref29">16, 29</xref>
        ]. ‘Perfectly fair’ models which satisfy all relevant metrics are often
simply beyond reach, in other words, and hence decision-makers lack actionable guidance for
determining which measures of fairness should give [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The following subsections describe three
ways of re-envisioning how evaluation metrics are specified and how they function qua regulative
‘small-scale ideals’ in nonideal settings of model evaluation, improvement, and selection. The
described methodologies for fair ML correspond to negativist, comparativist, and transitional
understandings of nonideal theory, respectively (Table 3).
3.1.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Negativism: Explaining and mitigating unfairness</title>
      <p>In political theory, the non/ideal theory distinction has been defined as a distinction between (a)
theories of justice that seek to identify and implement societal arrangement that realize full justice
and (b) theories which seek to explain and mitigate injustice, respectively. The latter conception
equates nonideal theory to negativist theory (or critical theory) grounded in the notion that we can
“recognize the existence of a problem before we have any idea of what would be best or most just”
[26, p, 3]. Nonideal theory so defined does not develop or seek to implement a positive ideal of justice
(or its constitutive principles), but instead seeks to explain and mitigate salient injustices, often
focusing on local as opposed to global improvements to justice [11, pp. 51–52].</p>
      <p>A corresponding negativist methodology for fair ML research and practice would omit positive
ideals (e.g., models of fairness in ML), including their supposed action-guiding functions in the
evaluation and design of ML models. Rather, it would rather seek to explain what constitutes
unfairness, injustice, or other algorithmic wrongs, and develop and implement effective approaches
to mitigating or eliminating them. A closest example along these lines comes from Hutchinson and
Mitchell who suggest that fair ML research should de-center efforts to formalize and achieve fairness
and instead prioritize the development of “methods to explain and reduce model unfairness by
focusing on the causes of unfairness” [30, p. 57].</p>
      <p>
        Proponents of the negativist methodology might find it compelling for two reasons. First,
negativist approaches are capable of producing actionable insights about how ML models could be
improved in terms of justice. Positive ideals (e.g., fairness criteria) are not required to identify and
correct unfair or unjust distributive patterns in predictions or otherwise wrongful model behaviors.
A negativist approach can make do with a theory which explains whether a particular disparity or
model behavior is unjustifiable, for instance, and why it warrants mitigation, accordingly. Second,
negativism also aligns with public discussions and activism around social justice which are often
centered on correcting particular injustices rather than realizing some comprehensive political ideal
[
        <xref ref-type="bibr" rid="ref27">27</xref>
        ].
3.2.
      </p>
    </sec>
    <sec id="sec-7">
      <title>Comparativism: Ranking feasible models</title>
      <p>
        The non/ideal theory distinction has also been considered to reside between (a) theory that seeks to
identify perfectly just societal arrangements and (b) theory that concentrates on ranking alternative
societal arrangements [11, pp. 51–52; 12]. The latter conception equates nonideal theory with theory
that applies the comparativist methodology originally proposed by Amartya Sen in response to two
shortcomings of what he calls “transcendental justice” [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. On the one hand, Sen argues that
knowing what constitutes ‘perfect justice’ is insufficient for evaluating and improving actual societies
in terms of justice because feasible societal arrangements may be equally far from that ideal but in
different respects2 [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. On the other hand, it is also unnecessary for making comparative assessments
of justice because we can rank feasible societal arrangements without identifying the fully just
societal arrangement(s) [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>
        The problems noted by Sen also arise in the context of designing fair ML models, albeit at a smaller
scale. For instance, empirical studies have demonstrated that any feasible ML model will in realistic
decision-making settings exhibit some kind of disparity that violates some plausible measure of
fairness [
        <xref ref-type="bibr" rid="ref16 ref29">16, 29</xref>
        ]. This means that “matching the ideal in some respect may only be possible at the
expense of widening gaps in others” and that decision-makers will require a further “basis for
deciding which among competing discrepancies to focus on” [4, p. 62]. Furthermore, the normative
targets expressed by most fairness criteria (e.g., “zero statistical disparity”) are not strictly speaking
required to rank the feasible models that decision-makers can build; the evaluator only needs some
metric for (un)fairness. In other words, knowing what constitutes an ideal distribution is unnecessary
for the purpose of comparing available models in terms of their respective disparities (see [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]).
      </p>
      <p>
        Sen’s solution [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] is a comparativist justice methodology where feasible societal arrangements
are compared pairwise to produce a ranking that can be used to identify the “second-best” option (see
also [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]). An analogical comparativist approach to fair ML would (i) omit the notion that fairness
criteria express strict normative targets that should guide the improvement and selection of models
and instead (ii) use some set of positive (or negative) metrics to compare feasible models in terms of
their (un)desirable distributive patterns or behaviors3. This kind of an approach has been defended by
Lee and Floridi who propose “a new methodology that views fairness as a trade-off of objectives—not
as an absolute mathematical condition—but in relation to an alternative decision-making process”
[28, p. 166]. This comparativist methodology is not premised on the goal of satisfying a set of fairness
criteria, in other words, but focuses on producing a model that is both feasible and “better on multiple
dimensions in relation to any existing process or model” [28, p. 188].
3.3.
      </p>
    </sec>
    <sec id="sec-8">
      <title>Transitional fairness: Fairness as a long-term target</title>
      <p>
        A third distinction that has been drawn defines ideal theory as end-state theory and nonideal theory
as transitional theory (see [12, pp. 660–662; 13]). This distinction has gained salience due to critiques
of ideal theory which observe that implementing a fully just societal arrangement under nonideal
background conditions is often infeasible and prone to produce negative externalities [20; 25]. The
conception of transitional theory qua nonideal theory aims to address these problems. It treats the
ideal specified by ideal theory as a stable long-term normative target which should be realized
eventually, even if doing so is currently not possible. The goal of transitional theory qua nonideal
theory, then, is “to create a world in which the ideal theory can be applied” [41, p. 487]. To achieve
this goal, it must explain what should be done here and now to improve justice relative to the ideal
specified by ideal theory. Here, transitional theory recognizes that “our feasibility sets for political
action are open to temporal variation” and that “what is not feasible now may become feasible in the
future if we take steps to expand our […] capabilities” [31, p. 47]. However, the justice-enhancing
improvements available to decision-makers at a given time will, in nonideal circumstances, involve
some unavoidable short- and long-term costs. Transitional theory must therefore identify feasible and
effective courses of action which are also permissible: they must strike an appropriate compromise
between the associated benefits and costs or balance them somehow [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. This comprises the crux of
transitional fairness.
      </p>
      <p>
        A transitional approach to fair ML would treat fairness criteria as expressing requirements that
ML models should ultimately satisfy or at least approximate, even if current models cannot. Here,
“debiasing” is no longer conceptualized as a one-shot intervention, but instead as a long-term project
consisting of a sequence of incremental (non-)computational interventions which improve fairness
2 This is the problem of the second-best: “if one of the background social conditions assumed when analyzing a political ideal does not obtain,
then the (normatively) best […] distributive profile does not necessarily satisfy the principles that characterize a fully just [one]” [25, p. 133].
3 Even a comparative approach requires some standard against which justice is evaluated (see [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]). However, a comparative approach can
proceed without a comprehensive and positive ideal of fairness or justice in its search for “second-best” options.
relative to the long-term target. This creates a need to assess available models’ effectiveness in terms
of contributing to the achievement of that target, on the one hand, but also to identify the short- and
long-term costs and benefits associated with deploying a particular model at a particular point in
time, on the other. Indeed, studies have observed that debiasing interventions that mitigate some
group-level disparity can in the long run harm the group that initially benefitted from those
interventions (e.g., [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]). A transitional approach must therefore consider whether interventions that
reduce injustice in the short run may decrease overall justice down the line (see also [27, p. 160] and
vice versa. Emerging work on “long-term” and “dynamic” fairness in ML in sequential
decisionmaking settings (e.g., [
        <xref ref-type="bibr" rid="ref32 ref5">5, 32</xref>
        ]) provides important resources for such purposes, including
computational tools for run-time fairness monitoring (e.g., [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]) which may prove useful in practice.
However, it serves to note that the respective short- and long-term impacts of particular models may
vary both synchronically (at a particular time t) and diachronically (through time t, … tn) due to
changes in the modelled population or the deployment setting, including due to the deployment of
the model [
        <xref ref-type="bibr" rid="ref10 ref5">5, 10</xref>
        ]. Transitional approaches must therefore also address substantive questions about
transitional fairness (e.g., what is justifiable configuration of short- and long-term impacts on different
groups) and incorporate novel methods (e.g., metrics) for evaluating the transitional fairness of
particular models as means to improve overall fairness relative to the long-term target.
4. “Fact-sensitive” and “realistic” fairness
In political philosophy, a large part of the debate around non/ideal theory revolves around the notions
of abstraction and idealization [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] which refer to (i) the bracketing of complexity and (ii) the
incorporation empirically false assumptions about the world or subject matter, respectively. Sure
enough, abstraction and idealization are common in both empirical and normative domains of theory.
Frictionless surfaces are found practically nowhere in the real world, for instance, but theoretical
physics models employ such idealizations for multiple theoretical and practical purposes.
Paradigmatic ideal theories employ considerable abstractions and idealized modeling assumptions –
such as the assumption that agents act according to the principles of justice presented in the theory
[11, p. 49; 19] – for similar purposes. Reasonable critics of ideal theory have no problem with
abstraction and idealization per se. Still, many of them argue that simplifying modeling assumptions
– whether false or not, empirically speaking – can leave us with normative theory that misrepresents
past or present injustices [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] and prescribes courses of action that prove ineffective or infeasible to
follow in realistic settings [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. Similar concerns have been expressed in critical studies on fair ML
methodology [
        <xref ref-type="bibr" rid="ref4 ref7 ref8">4, 7, 8</xref>
        ] which examine how excessive abstraction can lead to “ineffective, inaccurate,
and sometimes dangerously misguided” design prescriptions and technical debiasing interventions
[10, p. 59].
      </p>
      <p>
        The non/ideal theory distinction has been used to distinguish between fact-insensitive and
factsensitive theory, accordingly, as well as between utopian and realistic theory (see [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]). Recent
studies have similarly proposed that fair ML methodology should be reoriented towards fact-sensitive
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and realistic [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] directions. However, the distinction between abstraction and idealization has
proven murky and even misleading in many cases. The key question that requires attention is rather
whether specific kinds of simplifications and modelling assumptions are reasonable and appropriate
in a particular context of normative theorizing [11, pp. 50–51]. Indeed, political philosopher Laura
Valentini notes that, “[s]ince the relevant facts will vary on a case-by-case basis, it is almost
impossible to come up with a general rule prescribing what the correct level of idealization in
normative theorizing should be” [12, p. 660]. Critical studies on fair ML have argued in similar vein
that the field should further reflect on “what abstractions are reasonable, which simplifying
assumptions are justified, and what formalizations are appropriate” [4, p. 62]. I will not attempt to
provide a general rule for appropriate idealizations here. Instead, I will outline three potential
instantiations of fact-sensitive or realistic theorizing in fair ML, drawing on different kinds of
idealizations that have been criticized in the domain of political theory. Though I discuss these
approaches separately, they are not mutually incompatible and indeed may overlap in numerous
ways.
      </p>
    </sec>
    <sec id="sec-9">
      <title>Avoiding upstream idealization</title>
      <p>
        Charles Mills’ influential critique of ideal theory observes that theories of justice often neglect “actual
historic oppression and its legacy in the present, or current ongoing oppression” [22, p. 168]. If theory
starts from an ideal model of the world, Mills suggests, it ends up “abstracting away from realities
crucial to our comprehension of the actual workings of injustice in human interactions and social
institutions” [22, p. 170]. In these passages, Mills highlights that justice-enhancing interventions
informed not by an accurate description of the actual, nonideal world but instead by an idealized
world that could be can potentially reproduce the injustices and inequalities it seeks to address4.
Critical studies on fair ML notably observe similar problems. For instance, Herington [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
demonstrates that many standard measures of fairness can be satisfied even when model predictions
track historical injustice, and that they are oblivious to cases where a sensitive attribute has an effect
on model predictions via an unmodelled variable. In similar vein, Fazelpour and Lipton [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] note that
statistical measures of fairness are indifferent to the history and causes of specific group-level
disparities, and hence provide insufficient evidence for decision-makers to determine whether a given
disparity should be mitigated.
      </p>
      <p>
        The problems implicated here can be understood as resulting from so-called upstream idealization:
the bracketing or misrepresentation of (facts concerning) past injustice and its effects on the present
population and/or the observed data. The term ‘upstream’ is used to capture the notion that the
(potentially inappropriate) modelling assumptions in these cases concern factors that causally and/or
temporally precede the observed ML model. The problems identified with regard to upstream
idealization suggest the need for fact-sensitive fair ML understood specifically as an approach that
seeks to both recognize and correct past and present injustice and their continuing effects. In contrast
to many fair ML methods which may simply reproduce “structural and historical stratifications as
they manifest in computational code” [6, p. 4], this approach seeks to develop an empirically grounded
understanding of the causal pathways that produce the stratifications which manifest as disparities
at the level of model outputs [4, p. 62]. Furthermore, the prescribed debiasing interventions are in this
approach guided by the explicit aim of repairing past injustice and eliminating its influence on current
populations and, therefore, the predictions that are made based on models of those populations [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
4.2.
      </p>
    </sec>
    <sec id="sec-10">
      <title>Avoiding downstream idealization</title>
      <p>
        What can be called downstream idealization refers to the bracketing or misrepresentation of (facts
concerning) the factors that mediate the realization of the specified ideal. Downstream idealization is
notably characteristic to research on fair ML, where dominant approaches do not seek to “model the
entire system over which a social criterion, such as fairness, will be enforced” [10, p. 60] but rather
specify and implement the value(s) at the level of the technical (sub)systems (e.g., software) or their
underlying components (e.g., datasets and predictive models). This narrow focus may contribute to
an insufficient understanding of downstream factors which can affect the system’s effectiveness in
terms of realizing fairness in practice. For example, it is commonly assumed for purposes of
simplification that the predictions produced by a fair predictive model will also translate into fair
decisions or outcomes for decision subjects and other stakeholders. However, this assumption does not
necessarily hold since human users of ML systems can misinterpret system outputs or introduce novel
biases, for instance, creating a discrepancy between predictions and decisions [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ].
      </p>
      <p>
        One way to approach fair ML from a fact-sensitive or realistic perspective then is to minimize
potentially problematic downstream idealizations that might factor into models of fairness or the
practice of identifying the (expected) effects of ML models or particular fairness-enhancing
interventions. In other words, the level of abstraction is extended to ensure that ML models are
evaluated and (re)configured based on an empirically informed understanding of factors that affect
whether and how model outputs translate into concrete harms and benefits for decision subjects. The
extension of the abstraction boundary is recognized as crucial in particular because implementing
fairness (or other values) at the level of a technical system (e.g., securing fair predictions) is typically
4 This does not mean that the project of value implementation can or should be pursued without reference to ideals understood broadly as
normative or evaluative conceptions of what we ought to do in some general sense. The cited passages from Mills are explicitly directed
towards the empirical world-models on which normative theories are premised (see [22, p. 166]).
insufficient for realizing fairness at a broader level of practical significance (e.g., securing fair
decisions or outcomes for individuals, minimizing unfair group-level inequalities) [40]. Multiple
factors (e.g., user behaviors, incentive structures, and “chilling effects” created by system deployment)
are likely to mediate a predictive model’s actual impact in a given context, however, which means
that the relevant empirical facts to be taken into consideration depend partly on the social context of
the model’s use. Here, harnessing interdisciplinary perspectives and methodologies (e.g.,
humancomputer interaction, sociotechnical systems studies) becomes crucial to ensure that both the set of
feasible fairness-enhancing interventions (e.g., technological but also non-technological
interventions) as well as their expected impact can be properly identified and assessed (see also [
        <xref ref-type="bibr" rid="ref10 ref4 ref8">4, 8,
10</xref>
        ]). This idea aligns closely with an analogical position held by many nonideal political theorists:
“social science does not enter the picture after we have specified directive principles” but rather
“enters alongside moral theory to help with the specification of directive principles suited for nonideal
circumstances” [24, p. 445].
      </p>
    </sec>
    <sec id="sec-11">
      <title>4.2.1. Theorizing fairness under partial compliance</title>
      <p>
        A final but perhaps most common distinction is between ideal theory qua strict compliance theory
and nonideal theory qua partial compliance theory (e.g., [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]; cf. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]; see also [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]). In ideal theory,
the so-called strict compliance assumption is often defended on grounds that, unless we control for
noncompliance upon comparing alternative principles of justice, we cannot ascertain that those
principles actually contribute to the full and stable realization of justice [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. However, critics have
noted that justice-enhancing reforms or interventions which are designed without consideration of
non-compliant agents are liable to prove ineffective or misguided in actual, nonideal settings where
everyone cannot or simply do not act as they ought to [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. In addition, strict compliance theory does
not provide (sufficient) solutions to numerous challenges that arise solely in nonideal circumstances.
For instance, “what constitutes just punishment” or “what is a justifiable way of mitigating deep social
inequalities” are questions that simply do not arise under strict compliance. Yet in a nonideal world
where everyone does not do their fair share, it seems securing justice (or other values) may require
some agents to do more (or perhaps less) than their fair share5. Partial compliance theory qua nonideal
theory abandons the strict compliance assumption, meaning all relevant agents (e.g., citizens and
institutions) are not expected to adhere to the demands of justice qua normative content of the
proposed ideal theory, and asks how we can and should enhance justice given the expectation of
nonmarginal noncompliance.
      </p>
      <p>
        Dominant fair ML approaches align with strict compliance theory: they assume that the
satisfaction of the preferred fairness metrics provides an end-to-end guarantee of fairness in the
observed setting (see [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]). However, as noted above, fair predictions might be insufficient as means
to realize just outcomes in case accurate predictions track unjust structural inequalities or because
downstream factors (e.g., biased system users) skew the outcomes. Furthermore, noncompliance can
also have broader undesirable effects at the level of an observed population. For instance,
decisionmakers who implement unfair decision policies can obstruct the realization of an equitable
distribution of goods or opportunities between (sub)groups in a given population, even when other
decision-makers do their fair share in terms of implementing fairness constraints on their respective
models [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]. This underscores that coordinated and collective action is often necessary to ensure
desirable outcomes, but also raises the question of whether and to what extent compliant
decisionmakers (or other agents) are required to pick up the noncompliant decision-makers’ slack, as it were.
In other words, fair ML qua strict compliance theory can fail to provide achievable normative
prescriptions regarding in situations where noncompliance is expectable, and also fail “to delineate
the responsibilities of current decision-makers in a world where others fail to comply with their
responsibilities” [4, p. 60].
      </p>
      <p>
        Partial compliance theory provides a general framework for theorizing fair ML in nonideal
circumstances (e.g., [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]; see also [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]). Here, the evaluation and design of debiasing interventions is
5 For example, Richard North describes three general conceptions concerning distributive duties under partial compliance [35, pp. 81–86]: In
the first view, agent A’s failure to fulfill their duty towards a subject C does not impose extra demands on agent B who does their fair share
by fulfilling their duty towards C. In the second view, A’s failure to comply creates a duty for B to do A’s share in addition to their own. A
last view maintains that A’s failure to comply effectively cancels B’s duty to comply.
conducted under the expectation that some (socio)technical factor(s) such as noncompliant agent(s)
or malfunctioning technologies obstruct the realization of the desired outcomes in an observed
decision-making setting or population. This requires, first, identifying and anticipating (sources and
causes of) noncompliance ranging from technical problems (e.g., bugs and glitches) to user-level
problems (e.g., user-errors, cognitive bias, external attacks that affect ML models’ predictions) and
finally organizational problems (e.g., “fairness-washing”). Second, it requires formulating effective
and normatively justifiable responses to noncompliance and its expected effects. These responses can
similarly range across a number of technical and social levels. For instance, promoting compliance
among ML developers may require improving their access to evaluation benchmarks and technical
tools (e.g., suitable datasets), domain-expertise, and other resources required for the effective
detection and mitigation of unfair bias (e.g., [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]). On broader scales (e.g., multi-agent
decisionmaking contexts), it may instead become necessary to develop means to coordinate actions between
agents (e.g., decision-makers and regulators) so that unacceptable disparities can be mitigated even if
some decision-makers fail to do their fair share in this regard.
      </p>
    </sec>
    <sec id="sec-12">
      <title>5. Fairness in machine learning: A landscape of theory</title>
      <p>
        To answer the first question of this paper (see Section 2.3), I have outlined six general ways to
approach fairness in ML from a nonideal perspective. Though further approaches are possible, the
options outlined here capture central concerns that critical studies have expressed in relation to
mainstream fair ML methods and also align with established positions in philosophical debates on
non/ideal theory. Now, I turn to the second question: what is the relationship between ideal and
nonideal modes of theorizing in the context of fair ML? I argue there is no categorical distinction
between them, and that one’s reasons for favoring a particular approach to fair ML depend on one’s
aims and the question(s) one is seeking to answer. Different approaches have different kinds of
benefits and limitations, and there is room for both more and less ideal approaches. Here, I draw on
Alan Hamlin and Zofia Stemplowska’s account [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] which distinguishes between the so-called theory
of ideals and theory of institutional design and suggests that debates surrounding non/ideal theory
concern the latter domain which comprises a multi-dimensional continuum from ideal to nonideal
theories.
      </p>
      <p>
        Hamlin and Stemplowska [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] suggest that demarcations of non/ideal theory have been
unsuccessful for two reasons. First, debates on non/ideal theory often confuse two domains of theory:
(i) the theory of ideals which seeks to explain or describe some value(s) or ideal(s) and their
interrelations and (ii) the theory of institutional design which is concerned with the implementation of
some value(s) or ideal(s). Hamlin and Stemplowska suggest the debates on non/ideal theory concern
the latter domain, noting that criticisms of ideal theory are “often couched in terms of worries about
impracticability, and it is social arrangements rather than ideals that are subject to considerations of
practicality” [11, p. 53]. Indeed, it is obvious that any normative theory has to assume some general
notion of what is valuable (i.e., a theory of ideals) as its normative basis (e.g., for moral evaluation
and prescription). Even nonideal theory requires at least an incomplete conception in this regard (e.g.,
a partial theory of justice or injustice). A second reason for the lack of success in demarcating
non/ideal theory is that extant distinctions “focus on one (or a small number) of the set of relevant
dimensions” in which theories of institutional design can differ from one another [11, p. 60]. Hamlin
and Stemplowska suggest that no binary, categorical distinction can fully capture the complexity of
the debates and instead argue that “the ideal/non-ideal distinction is better construed as a
multidimensional continuum” [11, p. 52]. A given theory of institutional design is not exclusively ideal or
nonideal but rather more or less ideal, and its ‘idealness’ depends on numerous factors that have been
used to distinguish ideal theory from nonideal theory in the philosophical debates (e.g., assumed level
of compliance, fact-sensitivity). The individual factors that constitute this multi-dimensional
continuum are notably also continuous or gradient as opposed to simply binary. Fact-sensitivity, for
example, comes in degrees: a theory is more or less fact-sensitive depending on the number of
empirical facts that are incorporated as constraints in the proposed normative model or theory [11, p.
51]. The same thing can be said of other factors (or modeling assumptions) implicated in the non/ideal
theory debate, such as the assumed level of compliance which can range from full compliance to
widespread noncompliance.
      </p>
      <p>
        If idealness comes in degrees as measured along multiple gradient dimensions or factors, the
lingering question is: what level of idealness is appropriate in normative theory? Hamlin and
Stemplowska [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] note that there is no simple answer. Theories located at different ends of this
continuum have different kinds of aims, address somewhat different questions (e.g., justice under strict
versus partial compliance), and produce different theoretical resources. The practical import of a
particular theory depends on the kind of information it provides but also on the circumstances of the
theory’s application (e.g., a just versus unjust society). Broadly speaking, theories in the more ideal
end employ idealizations and considerable abstractions (e.g., assume fewer feasibility constraints)
because they seek to produce normative prescriptions that are highly consistent with the ideals they
are seeking to bring about. Strict compliance theory, for instance, idealizes agents’ expected behavior
in order to avoid baking in concessive bias towards a nonideal status quo where noncompliance is
common [12, pp. 656–660]. Theories in the less ideal end generally start from (more) realistic
assumptions to provide less-than-fully-just but actionable prescriptions and to address practical and
moral challenges that arise only in circumstances of infeasibility and injustice. Partial compliance
theory, for instance, assumes some realistic level of noncompliance among the relevant agents (e.g.,
decision-makers) precisely to identify what kinds of obstacles and tensions arise when everyone does
not do their fair share, and to produce normative prescriptions that are not oblivious to those
obstacles and tensions.
      </p>
      <p>
        In what follows, I use Hamlin and Stemplowska’s [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] taxonomy of normative theory to
classify different approaches to fairness in ML (broadly construed). I then explain how the
multidimensional continuum conception of the theory of institutional design clarifies the relationship
between standard approaches to fair ML and the alternatives described in this paper and also makes
room for the application of both more and less ideal modes of theorizing in the field.
5.1.
      </p>
    </sec>
    <sec id="sec-13">
      <title>Algorithmic fairness and fair machine learning</title>
      <p>
        Drawing on Hamlin and Stemplowska’s [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] taxonomy, I distinguish between two (sub)domains of
theory which I will call (i) algorithmic fairness qua subdomain of the theory of ideals and (ii) fair ML
qua a subdomain of the theory of institutional design, respectively.
      </p>
      <p>
        On the one hand, I understand algorithmic fairness as denoting a domain of theory that examines,
elucidates, and seeks to define values or ideals as they concern prediction-based decision-making
procedures (e.g., fairness notions but also other related values). This domain of theory is not directly
concerned with the practical implementation of the values, principles, and ideals it deals with. It is
rather concerned with the nature of those ideals (e.g., necessary and sufficient conditions), their moral
justifications (e.g., arguments for and against particular notions of fairness), and their inter-relations
(e.g., normative priorities, commensurability, conceptual compatibility). Current literature in this
domain deals primarily with what Rawls’ calls imperfect procedural justice [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] though it also
frequently draws from philosophical theories of non-discrimination, equality, distributive justice ([
        <xref ref-type="bibr" rid="ref14">14,
39, 40</xref>
        ]). Indeed, many philosophers conceptualize fairness criteria roughly as (approximations of)
normative requirements that regulate imperfect decision procedures in general (e.g., [38, 39]). Here,
predictive models are notably viewed only as instantiations of imperfect procedures; that is,
technological systems are of interest to theory in this domain because they inform or execute
prediction-based decisions. I emphasize this because, while a theory of algorithmic fairness might
discuss predictive models and software to make its point, as it were, it need not assume that fairness
in a broad sense is purely a property of the technical system itself [
        <xref ref-type="bibr" rid="ref10 ref8">8, 10</xref>
        ].
      </p>
      <p>
        On the other hand, I understand fair ML as circumscribing a subdomain of the theory of
institutional design which deals specifically with the (socio)technical implementation of algorithmic
fairness (as specified by some theory of algorithmic fairness qua theory of ideals). Work in this
subdomain does not seek to explain or elucidate algorithmic fairness. It is instead concerned with the
practical implementation of algorithmic fairness, purporting to guide and empirically test how it
could be implemented or realized in technical or sociotechnical systems. Literature in this area
explores a wide range of questions, including but not limited to how algorithmic fairness should be
operationalized in practical contexts [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], how debiasing interventions affect model predictions and
performance and what kinds of trade-offs arise as a result (e.g., [
        <xref ref-type="bibr" rid="ref15 ref16 ref29">15, 16, 29</xref>
        ]), how human users actually
use predictive models [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], and how developers use practical resources for fairness-sensitive design
[
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]. I argue that it is this subdomain of theory where we find a similar multi-dimensional continuum
as described by Hamlin and Stemplowska [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
5.2.
      </p>
    </sec>
    <sec id="sec-14">
      <title>The ideal–nonideal continuum of fair machine learning</title>
      <p>
        Fair ML as defined above forms a continuum spanning from more to less ideal approaches. Standard
approaches to fairness in ML often enforce some notion of algorithmic fairness in an available
predictive model. Most such approaches are arguably located at the more ideal end of the described
continuum. The guiding idea is that, “[i]deally, the sensitive attribute will have a causal connection
to neither the model variables, the classification, nor the target property” [9, p. 287] and an
intervention should be performed to ensure that the model’s predictions align with, or at least
approximate, this ideal pattern. This also highlights that standard approaches tend to focus primarily
on the technological implementation of values. Indeed, they typically employ considerable
abstractions to isolate the technological system from the broader sociotechnical context and rely on
idealized modeling assumptions concerning, for example, the population of interest (e.g., a lack of
background injustice), the technical system and its components (e.g., accurate training data), and the
system deployment setting (e.g., compliant decision-makers qua system users). This introduces
problems, as was discussed above, but it is crucial to note that idealization and abstraction are
important methodological tools which serve the highly specific aims of normative modeling in these
approaches. Abstractions and idealizations provide control over contingent and external factors that
characterize realistic, nonideal systems and settings (e.g., pervasive inequalities, data inaccuracies,
misuse of the predictive model). By focusing on an idealized and isolated system, these approaches
can produce theoretical resources (e.g., fairness metrics) and practical prescriptions (e.g., debiasing
strategies) that are more likely to be consistent with a notion of algorithmic fairness that is regulative
in a more ideal system or decision-making settings (cf. principles of justice that characterize a just
society [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]).
      </p>
      <p>
        The approaches described in Sections 3 and 4 are located in the less ideal end of the continuum.
They recognize that the theoretical resources and prescriptions produced by more ideal approaches
are not applicable (at least directly) in more realistic, nonideal (socio)technical systems. They seek to
provide guidance in settings with realistic constraints and complex dynamics, and where
decisionmakers encounter a wide array of moral conflicts and tradeoffs as a result. However, each of the
described approaches departs from the standard, more ideal approaches in a distinct way. Broadly
speaking, negativist, comparativist, and transitional approaches (Section 3) all start from the
assumption that, in a nonideal decision-making setting, a realistic model will exhibit some prima facie
undesirable inequalities (and therefore be less-than-fully just). But they also represent different
approaches to identifying a feasible “second-best” option (e.g., a predictive model, decision procedure,
or a distributive pattern that should be preferred when the ideal notion of algorithmic fairness cannot
be realized). Negativist approaches prioritize the elimination of salient instances of unfairness, for
instance, whereas transitional approaches seek permissible means to improve fairness relative to a
long-term target. The three fact-sensitive approaches, in turn, are unified in their focus on
incorporating more realistic empirical assumptions and constraints into their respective fairness
evaluations and prescriptions for intervention strategies. Still, each of them omits specific kinds of
idealizations and abstractions based on specific reasons. Some approaches explore fairness from a
sociotechnical perspective to produce evaluations and prescriptions that are desirable and feasible
even when social factors and complex causal dynamics of the real-life decision-making setting are
factored in qua constraints on value implementation. Other approaches omit idealizations instead to
identify and address moral and practical conflicts which simply do not arise in idealized
(socio)technical systems. Upstream fact-sensitive approaches theorize what is fair or just in a nonideal
world shaped by past injustice (e.g., [
        <xref ref-type="bibr" rid="ref4 ref6">4, 6</xref>
        ]), for instance, whereas partial compliance approaches
theorize what constitutes a fair or just decision procedure in a setting where group-level outcomes
are affected by the unjust or unfair actions of some decision-makers (e.g., [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]).
      </p>
      <p>
        ‘Ideal’ and ‘nonideal’ approaches to fair ML thus form a complex continuum, where a particular
approach operates at some fixed level of abstraction (e.g., technical–sociotechnical) and relies on some
theory of ideals. That theory may be positive (e.g., a theory of algorithmic fairness) or negative (e.g.,
a theory of algorithmic unfairness). It may have a broader or more restricted scope of application (e.g.,
it may apply universally or only to a particular domain) and it may be more or less complete (e.g., it
may include every relevant principle characterizing the ideal or only a subset of them) [27, p. 344].
But a particular approach is also likely to be more ideal in one sense and less ideal in another, and
combinations of different approaches are possible (e.g., transitional fairness under partial
compliance). I emphasize that I do not assume that critics of standard approaches to fair ML subscribe
to a binary view of the non/ideal theory demarcation. Rather, I suspect that some critiques of
mainstream methods in the field might be grounded in different conceptions about the theoretical
and practical aims of theorizing in this area. For example, Fazelpour and Lipton state in the beginning
of their insightful critique that “[t]he purpose of developing these [fair ML] tools is to ensure that
ML-based decision systems yield allocations that are just in a world that is plagued by systematic
injustices” [4, p. 57]. But this does not capture the diversity of theoretical and practical aims that drive
work in the field. For one, research on algorithmic fairness (qua theory of ideals) may simply seek to
explain what constitutes fairness in prediction without any immediate interest in matters of practical
implementation. But even studies that do seek to provide practical guidance in nonideal circumstances
can diverge in their more specific aims, research questions, methodologies, and abstractions and
idealizations. Furthermore, the choice between ideal and nonideal perspectives often hinges on the
relative weight assigned to desirability (or “perfection”) versus feasibility (or “realism”) and this choice
comes with tradeoffs [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. If we approach fairness from an ideal-theoretical perspective, the
produced theoretical resources, tools, and practical prescriptions may be consistent with ambitious
ideals that are worth pursuing. But they offer less guidance for present, nonideal circumstances where
such ideals are beyond reach. Nonideal approaches are better positioned to offer such guidance,
including by being sensitive to past and present patterns of inequality and injustice. Still, actionable
prescriptions can come at the cost of losing sight of the ideal. There is no guarantee that all
compromises and “second-best” solutions improve justice in the long term, or that such compromises
are even consistent with ideal-theoretical models of justice (see [
        <xref ref-type="bibr" rid="ref13 ref27">13, 27, 41</xref>
        ]).
      </p>
      <p>In light of these complex tradeoffs, I argue that “more ideal” methodologies for implementing
fairness in (socio)technical systems persist in their theoretical and practical relevance, but they should
be supplemented with different kinds of “less ideal” approaches which address their shortcomings
and limitations. Indeed, I maintain that the application of different perspectives and methodological
frameworks can be highly beneficial in practice. This would involve exploring different sets of
empirical modeling assumptions (e.g., levels of fact-sensitivity) and other factors, such as intervention
points (e.g., data, learning algorithm, user) and timeframes (e.g., short- versus long-term
improvement). By moving between (different kinds of) ideal and nonideal perspectives, one can
produce a more detailed picture of available fairness-enhancing interventions and the effects they
produce in different kinds of potential scenarios. For example, some interventions might mitigate
some particular unfair disparity quite robustly in numerous counterfactual scenarios, while others
might remove that disparity entirely but only in highly restricted cases [5, p. 13].</p>
    </sec>
    <sec id="sec-15">
      <title>6. Concluding remarks</title>
      <p>
        This paper continued a discussion initiated by Sina Fazelpour and Zachary Lipton’ insightful critique
of ideal modes of theorizing in fair ML [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], further exploring the connection between debates
concerning fair ML methodology and debates concerning non/ideal theory in political philosophy.
The primary contribution of the paper is an outline of six “nonideal” approaches to fair ML which
can be applied to evaluate and implement fairness in (socio)technical systems in nonideal
circumstances, where small-scale ideals of fairness in prediction “do not compute” due to feasibility
constraints, systemic noncompliance, or the presence of background injustice and pervasive
inequalities. Drawing on Hamlin and Stemplowska’s [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] account, I proposed a taxonomy of theory
that elucidates the relationship between ideal and nonideal approaches to fair ML. I argued, first, that
they are distinct from the theory of algorithmic fairness and, second, that they are not fundamentally
distinct but rather form a continuum. Different approaches can also complement one another in
practice. It can be beneficial to assess available fairness-enhancing interventions (technical and
sociotechnical) under different kinds of modeling assumptions and constraints, and in different
counterfactual scenarios. The depicted landscape of methodologies for evaluating and implementing
fairness in (socio)technical ML systems presents fruitful avenues for future research, including
research where different approaches are combined. The proposed account also highlights the need to
continue theorizing algorithmic fairness (and other values and ideals relating to prediction-based
decision-making) – no approach can operate without some theory of ideals. Currently, the field’s
operative ideals are, alas, often underspecified and/or underinclusive6. Still, such problems are not
addressed by doing more nonideal theory and less ideal theory – rather, they are addressed by doing
more and better theory.
6 Fairness notions are often rather vague in their content (e.g., formally defined) and thus lend themselves to diverging interpretations and
misapplication (e.g., “fairness-washing”) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. They also tend to capture certain justice-related concerns (e.g., non-discrimination) but neglect
others (e.g., structural injustice, non-comparative fairness) [
        <xref ref-type="bibr" rid="ref10 ref4 ref6">4 ,6, 10</xref>
        ]. These are genuine problems, but notably unrelated to the applied mode
of theorizing (cf. [
        <xref ref-type="bibr" rid="ref4 ref6">4, 6</xref>
        ]). Underspecification and under-inclusion are general problems that can arise even when dealing with nonideal theory
(e.g., a theory of justice in conditions of partial compliance can conceivably be highly abstract and fail to include important facets of justice).
CHI Conference on Human Factors in Computing Systems, Association for Computing
Machinery, New York, NY, USA, 2019, pp. 1–16. https://doi.org/10.1145/3290605.3300830.
[38] B. Hedden, On statistical criteria of algorithmic fairness, Philosophy &amp; Public Affairs, 49 (2021)
209–231. https://doi.org/10.1111/papa.12189.
[39] M. Loi, A. Herlitz, H. Heidari, Fair equality of chances for prediction-based decisions, Economics
&amp; Philosophy, (2021) 1–24. doi:10.1017/S0266267123000342.
[40] F. Beigang, On the advantages of distinguishing between predictive and allocative fairness in
algorithmic decision-making, Minds and Machines, 32 (2022) 655–
682. https://doi.org/10.1007/s11023-022-09615-9.
[41] R. S. Taylor. Rawlsian affirmative action, Ethics, 119(3) (2009) 476–506.
https://doi.org/10.1086/598170.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Fazelpour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Danks</surname>
          </string-name>
          , Algorithmic bias: Senses, sources, solutions, Philosophy Compass,
          <volume>16</volume>
          (
          <issue>8</issue>
          ) (
          <year>2021</year>
          ). https://doi.org/10.1111/phc3.
          <fpage>12760</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mehrabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Morstatter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Saxena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galstyan</surname>
          </string-name>
          ,
          <article-title>A survey on bias and fairness in machine learning</article-title>
          ,
          <source>ACM Computing Surveys (CSUR)</source>
          ,
          <volume>54</volume>
          (
          <issue>6</issue>
          ) (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          . https://doi.org/10.1145/3457607.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          , E. Potash,
          <string-name>
            <given-names>S.</given-names>
            <surname>Barocas</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. D'Amour</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lum</surname>
          </string-name>
          , Algorithmic fairness: Choices, assumptions, and definitions,
          <source>Annual Review of Statistics and Its Application</source>
          ,
          <volume>8</volume>
          (
          <year>2021</year>
          )
          <fpage>141</fpage>
          -
          <lpage>163</lpage>
          . https://doi.org/10.1146/annurev-statistics-
          <volume>042720</volume>
          -125902.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Fazelpour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. C.</given-names>
            ,
            <surname>Lipton</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z. C.</surname>
          </string-name>
          ,
          <article-title>Algorithmic fairness from a non-ideal perspective</article-title>
          ,
          <source>in: Proceedings of the AAAI/ACM Conference on AI</source>
          ,
          <string-name>
            <surname>Ethics</surname>
          </string-name>
          , and Society, Association for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , pp.
          <fpage>57</fpage>
          -
          <lpage>63</lpage>
          . https://doi.org/10.1145/3375627.3375828.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Fazelpour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. C.</given-names>
            <surname>Lipton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Danks</surname>
          </string-name>
          ,
          <article-title>Algorithmic fairness and the situated dynamics of justice</article-title>
          ,
          <source>Canadian Journal of Philosophy</source>
          ,
          <volume>52</volume>
          (
          <issue>1</issue>
          ) (
          <year>2022</year>
          )
          <fpage>44</fpage>
          -
          <lpage>60</lpage>
          . https://doi.org/10.1017/can.
          <year>2021</year>
          .
          <volume>24</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Yang</surname>
          </string-name>
          , Algorithmic reparation,
          <source>Big Data &amp; Society</source>
          ,
          <volume>8</volume>
          (
          <issue>2</issue>
          ) (
          <year>2021</year>
          ). https://doi.org/10.1177/20539517211044808.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Green</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. Hu,</surname>
          </string-name>
          <article-title>The myth in the methodology: Towards a recontextualization of fairness in machine learning</article-title>
          ,
          <source>in: Proceedings of Machine Learning: The Debates Workshop at the 35th International Conference on Machine Learning (ICML'18)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Green</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Viljoen</surname>
          </string-name>
          ,
          <article-title>Algorithmic realism: expanding the boundaries of algorithmic thought</article-title>
          ,
          <source>in: Proceedings of the 2020 conference on fairness, accountability, and transparency (FAT* '20)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>31</lpage>
          . https://doi.org/10.1145/3351095.3372840.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Herington</surname>
          </string-name>
          ,
          <source>Measuring Fairness in an Unfair World, in: Proceedings of the AAAI/ACM Conference on AI</source>
          ,
          <string-name>
            <surname>Ethics</surname>
          </string-name>
          , and Society, Association for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , pp.
          <fpage>286</fpage>
          -
          <lpage>292</lpage>
          . https://doi.org/10.1145/3375627.3375854.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>A. D. Selbst</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Boyd</surname>
            ,
            <given-names>S. A.</given-names>
          </string-name>
          <string-name>
            <surname>Friedler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Venkatasubramanian</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Vertesi</surname>
          </string-name>
          ,
          <article-title>Fairness and abstraction in sociotechnical systems</article-title>
          ,
          <source>in: Proceedings of the conference on fairness, accountability, and transparency (FAT* '19)</source>
          , January 29-31, Atlanta,
          <string-name>
            <surname>GA</surname>
          </string-name>
          , USA,
          <year>2019</year>
          , pp.
          <fpage>59</fpage>
          -
          <lpage>68</lpage>
          . https://doi.org/10.1145/3287560.3287598.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hamlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Stemplowska</surname>
          </string-name>
          ,
          <article-title>Theory, ideal theory and the theory of ideals</article-title>
          ,
          <source>Political Studies Review</source>
          ,
          <volume>10</volume>
          (
          <issue>1</issue>
          ) (
          <year>2012</year>
          )
          <fpage>48</fpage>
          -
          <lpage>62</lpage>
          . https://doi.org/10.1111/j.1478-
          <fpage>9302</fpage>
          .
          <year>2011</year>
          .
          <volume>00244</volume>
          .x.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>L.</given-names>
            <surname>Valentini</surname>
          </string-name>
          ,
          <article-title>Ideal vs. non‐ideal theory: A conceptual map</article-title>
          ,
          <source>Philosophy compass</source>
          ,
          <volume>7</volume>
          (
          <issue>9</issue>
          ) (
          <year>2012</year>
          )
          <fpage>654</fpage>
          -
          <lpage>664</lpage>
          . https://doi.org/10.1111/j.1747-
          <fpage>9991</fpage>
          .
          <year>2012</year>
          .
          <volume>00500</volume>
          .x.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Simmons</surname>
          </string-name>
          , Ideal and nonideal theory,
          <source>Philosophy &amp; Public Affairs</source>
          ,
          <volume>38</volume>
          (
          <issue>1</issue>
          ) (
          <year>2010</year>
          )
          <fpage>5</fpage>
          -
          <lpage>36</lpage>
          . https://www.jstor.org/stable/40468446.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Binns</surname>
          </string-name>
          ,
          <article-title>Fairness in machine learning: Lessons from political philosophy</article-title>
          , in: S. A.
          <string-name>
            <surname>Friedler</surname>
          </string-name>
          , C. Wilson (Eds.),
          <source>Proceedings of the 1st Conference on Fairness, Accountability and Transparency</source>
          , volume
          <volume>81</volume>
          <source>of Proceedings of Machine Learning Research</source>
          , PMLR, New York, NY, USA,
          <year>2018</year>
          , pp.
          <fpage>149</fpage>
          -
          <lpage>159</lpage>
          . URL: http://proceedings.mlr.press/v81/binns18a.html.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Pitassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Reingold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zemel</surname>
          </string-name>
          ,
          <article-title>Fairness through awareness, in: Proceedings of the 3rd innovations in theoretical computer science conference</article-title>
          ,
          <source>ITCS '12</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>226</lpage>
          .
          <article-title>Association for Computing Machinery</article-title>
          . https://doi.org/10.1145/2090236.2090255.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chouldechova</surname>
          </string-name>
          ,
          <article-title>Fair prediction with disparate impact: A study of bias in recidivism prediction instruments</article-title>
          ,
          <source>Big data</source>
          ,
          <volume>5</volume>
          (
          <issue>2</issue>
          ) (
          <year>2017</year>
          )
          <fpage>153</fpage>
          -
          <lpage>163</lpage>
          . https://doi.org/10.1089/big.
          <year>2016</year>
          .
          <volume>0047</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Srebro</surname>
          </string-name>
          ,
          <article-title>Equality of opportunity in supervised learning</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , vol.
          <volume>29</volume>
          ,
          <year>2016</year>
          , pp.
          <fpage>3315</fpage>
          -
          <lpage>3323</lpage>
          . http://papers.nips.cc/paper/6374-equality
          <article-title>-of-opportunity-in-supervised-learning</article-title>
          .
          <source>pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>M. J. Kusner</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Loftus</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Silva</surname>
          </string-name>
          , Counterfactual Fairness,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>30</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2017</year>
          . URL: https: //proceedings.neurips.cc/paper/2017/hash/a486cd07e4ac3d270571622f4f316ec5-Abstract. html.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Rawls</surname>
          </string-name>
          ,
          <source>A Theory of Justice</source>
          , 1st ed.
          <source>(reprint)</source>
          , Harvard University Press,
          <year>2005</year>
          /
          <year>1971</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A</given-names>
            ,
            <surname>Sen</surname>
          </string-name>
          , The Idea of Justice, Penguin Books,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>J. T. Levy</surname>
          </string-name>
          ,
          <article-title>There is no such thing as ideal theory</article-title>
          ,
          <source>Social Philosophy and Policy</source>
          ,
          <volume>33</volume>
          (
          <issue>1-2</issue>
          ) (
          <year>2016</year>
          )
          <fpage>312</fpage>
          -
          <lpage>333</lpage>
          . https://doi.org/10.1017/S026505251600025X.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>C. W.</given-names>
            <surname>Mills</surname>
          </string-name>
          , “
          <article-title>Ideal theory” as ideology</article-title>
          ,
          <source>Hypatia</source>
          ,
          <volume>20</volume>
          (
          <issue>3</issue>
          ) (
          <year>2005</year>
          )
          <fpage>165</fpage>
          -
          <lpage>183</lpage>
          . https://doi.org/10.1111/j.1527-
          <fpage>2001</fpage>
          .
          <year>2005</year>
          .tb00493.x.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>C.</given-names>
            <surname>Farrelly</surname>
          </string-name>
          , (
          <year>2007</year>
          ),
          <article-title>Justice in ideal theory: A refutation, Political studies</article-title>
          ,
          <volume>55</volume>
          (
          <issue>4</issue>
          ) (
          <year>2007</year>
          )
          <fpage>844</fpage>
          -
          <lpage>864</lpage>
          . https://doi.org/10.1111/j.1467-
          <fpage>9248</fpage>
          .
          <year>2007</year>
          .
          <volume>00656</volume>
          .x.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>D.</given-names>
            <surname>Wiens</surname>
          </string-name>
          , Against ideal guidance,
          <source>The Journal of Politics</source>
          ,
          <volume>77</volume>
          (
          <issue>2</issue>
          ) (
          <year>2015</year>
          )
          <fpage>433</fpage>
          -
          <lpage>446</lpage>
          . https://doi.org/10.1086/679495.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>D.</given-names>
            <surname>Wiens</surname>
          </string-name>
          ,
          <article-title>Assessing ideal theories: Lessons from the theory of second best</article-title>
          , Politics, Philosophy &amp; Economics,
          <volume>15</volume>
          (
          <issue>2</issue>
          ) (
          <year>2016</year>
          )
          <fpage>132</fpage>
          -
          <lpage>149</lpage>
          . https://doi.org/10.1177/1470594X15620343.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>E.</given-names>
            <surname>Anderson</surname>
          </string-name>
          , The imperative of integration, Princeton University Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>I. Robeyns</surname>
          </string-name>
          ,
          <article-title>Ideal theory in theory and practice</article-title>
          ,
          <source>Social Theory and Practice</source>
          ,
          <volume>34</volume>
          (
          <issue>3</issue>
          ) (
          <year>2008</year>
          )
          <fpage>341</fpage>
          -
          <lpage>362</lpage>
          . https://doi.org/10.5840/soctheorpract200834321.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>M. S. A.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Floridi</surname>
          </string-name>
          ,
          <article-title>Algorithmic fairness in mortgage lending: from absolute conditions to relational trade-offs</article-title>
          ,
          <source>Minds and Machines</source>
          ,
          <volume>31</volume>
          (
          <issue>1</issue>
          ) (
          <year>2021</year>
          )
          <fpage>165</fpage>
          -
          <lpage>191</lpage>
          . https://doi.org/10.1007/s11023- 020-09529-4.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mullainathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <article-title>Inherent trade-offs in the fair determination of risk scores</article-title>
          , in: C. Papadimitriou (ed.)
          <source>8th Innovations in Theoretical Computer Science Conference (ITCS</source>
          <year>2017</year>
          ),
          <source>Leibniz International Proceedings in Informatics (LIPIcs)</source>
          , vol.
          <volume>67</volume>
          ,
          <year>2017</year>
          , pp.
          <volume>43</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>43</lpage>
          :
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>B.</given-names>
            <surname>Hutchinson</surname>
          </string-name>
          , M. Mitchell,
          <article-title>50 years of test (un) fairness: Lessons for machine learning</article-title>
          ,
          <source>in: Proceedings of the conference on fairness, accountability, and transparency (FAT* '19)</source>
          ,
          <source>January 29-31</source>
          ,
          <year>2019</year>
          , Atlanta,
          <string-name>
            <surname>GA</surname>
          </string-name>
          , USA,
          <year>2019</year>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>58</lpage>
          . https://doi.org/10.1145/3287560.3287600.
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>P.</given-names>
            <surname>Gilabert</surname>
          </string-name>
          ,
          <article-title>Comparative assessments of justice, political feasibility, and ideal theory</article-title>
          ,
          <source>Ethical Theory and Moral Practice</source>
          ,
          <volume>15</volume>
          (
          <issue>1</issue>
          ) (
          <year>2012</year>
          )
          <fpage>39</fpage>
          -
          <lpage>56</lpage>
          . https://doi.org/10.1007/s10677-011-9279-6.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>L. T.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Simchowitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <article-title>Delayed impact of fair machine learning</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>3150</fpage>
          -
          <lpage>3158</lpage>
          . https://proceedings.mlr.press/v80/liu18c.html.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>A.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shanbhag</surname>
          </string-name>
          , C. Wilson, Faircanary:
          <article-title>Rapid continuous explainable fairness</article-title>
          ,
          <source>in: Proceedings of the 2022 AAAI/ACM Conference on AI, Ethics, and Society</source>
          , Oxford, United Kingdom,
          <year>2022</year>
          , pp.
          <fpage>307</fpage>
          -
          <lpage>316</lpage>
          . https://doi.org/10.1145/3514094.3534157.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>B.</given-names>
            <surname>Green</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Disparate interactions: An algorithm-in-the-loop analysis of fairness in risk assessments</article-title>
          ,
          <source>in: Proceedings of the conference on fairness, accountability, and transparency (FAT* '19)</source>
          , January 29-31, Atlanta,
          <string-name>
            <surname>GA</surname>
          </string-name>
          , USA,
          <year>2019</year>
          , pp.
          <fpage>90</fpage>
          -
          <lpage>99</lpage>
          . https://doi.org/10.1145/3287560.3287563.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>R.</given-names>
            <surname>North</surname>
          </string-name>
          ,
          <article-title>Principles as guides: The action-guiding role of justice in politics</article-title>
          ,
          <source>The Journal of Politics</source>
          <volume>79</volume>
          (
          <issue>1</issue>
          ) (
          <year>2017</year>
          )
          <fpage>75</fpage>
          -
          <lpage>88</lpage>
          . https://doi.org/10.1086/687286.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>J.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Fazelpour</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z. C. Lipton,</surname>
          </string-name>
          <article-title>Fair machine learning under partial compliance</article-title>
          ,
          <source>in: Proceedings of the 2021 AAAI/ACM Conference on AI</source>
          ,
          <string-name>
            <surname>Ethics</surname>
          </string-name>
          , and Society, May 19-21,
          <string-name>
            <surname>Virtual</surname>
            <given-names>Event</given-names>
          </string-name>
          , USA,
          <year>2021</year>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>65</lpage>
          . https://doi.org/10.1145/3461702.3462521.
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>K.</given-names>
            <surname>Holstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Wortmann</given-names>
            <surname>Vaughan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Daumé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dudik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wallach</surname>
          </string-name>
          ,
          <article-title>Improving fairness in machine learning systems: What do industry practitioners need?</article-title>
          ,
          <source>in: Proceedings of the 2019</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>