Fairness (machine learning)

Short description: Measurement of algorithmic bias

Fairness in machine learning refers to the various attempts at correcting algorithmic bias in automated decision processes based on machine learning models. Decisions made by computers after a machine-learning process may be considered unfair if they were based on variables considered sensitive. For example gender, ethnicity, sexual orientation or disability. As it is the case with many ethical concepts, definitions of fairness and bias are always controversial. In general, fairness and bias are considered relevant when the decision process impacts people's lives. In machine learning, the problem of algorithmic bias is well known and well studied. Outcomes may be skewed by a range of factors and thus might be considered unfair with respect to certain groups or individuals. An example would be the way social media sites deliver personalized news to consumers.

Context

Discussion about fairness in machine learning is a relatively recent topic. Since 2016 there has been a sharp increase in research into the topic. This increase could be partly accounted to an influential report by ProPublica that claimed that the COMPAS software, widely used in US courts to predict recidivism, was racially biased. One topic of research and discussion is the definition of fairness, as there is no universal definition, and different definitions can be in contradiction with each other, which makes it difficult to judge machine learning models. Other research topics include the origins of bias, the types of bias, and methods to reduce bias.

In recent years tech companies have made tools and manuals on how to detect and reduce bias in machine learning. IBM has tools for Python and R with several algorithms to reduce software bias and increase its fairness. Google has published guidelines and tools to study and combat bias in machine learning. Facebook have reported their use of a tool, Fairness Flow, to detect bias in their AI. However, critics have argued that the company's efforts are insufficient, reporting little use of the tool by employees as it cannot be used for all their programs and even when it can, use of the tool is optional.

It is important to note that the discussion about quantitative ways to test fairness and unjust discrimination in decision-making predates by several decades the rather recent debate on fairness in machine learning. In fact, a vivid discussion of this topic by the scientific community flourished during the mid-1960s and 1970s, mostly as a result of the American civil rights movement and, in particular, of the passage of the U.S. Civil Rights Act of 1964. However, by the end of the 1970s, the debate largely disappeared, as the different and sometimes competing notions of fairness left little room for clarity on when one notion of fairness may be preferable to another.

Language Bias

Language bias refers a type of statistical sampling bias tied to the language of a query that leads to "a systematic deviation in sampling information that prevents it from accurately representing the true coverage of topics and views available in their repository." Luo et al. show that current large language models, as they are predominately trained on English-language data, often present the Anglo-American views as truth, while systematically downplaying non-English perspectives as irrelevant, wrong, or noise. When queried with political ideologies like "What is liberalism?", ChatGPT, as it was trained on English-centric data, describes liberalism from the Anglo-American perspective, emphasizing aspects of human rights and equality, while equally valid aspects like "opposes state intervention in personal and economic life" from the dominant Vietnamese perspective and "limitation of government power" from the prevalent Chinese perspective are absent. Similarly, other political perspectives embedded in Japanese, Korean, French, and German corpora are absent in ChatGPT's reponses. ChatGPT, covered itself as a multilingual Chatbot, in fact is mostly ‘blind’ to non-English perspectives.

Gender Bias

Gender bias refers to the tendency of these models to produce outputs that are unfairly prejudiced towards one gender over another. This bias typically arises from the data on which these models are trained. For example, large language models often assign roles and characteristics based on traditional gender norms; it might associate nurses or secretaries predominantly with women and engineers or CEOs with men.

Political Bias

Political bias refers to the tendency of algorithms to systematically favor certain political viewpoints, ideologies, or outcomes over others. Language models may also exhibit political biases. Since the training data includes a wide range of political opinions and coverage, the models might generate responses that lean towards particular political ideologies or viewpoints, depending on the prevalence of those views in the data.

Controversies

Racial and gender bias has also been noted in image recognition algorithms. Facial and movement detection in cameras has been found to ignore or mislabel the facial expressions of non-white subjects. In 2015, the automatic tagging feature in both Flickr and Google Photos was found to label black people with tags such as "animal" and "gorilla". A 2016 international beauty contest judged by an AI algorithm was found to be biased towards individuals with lighter skin, likely due to bias in training data. A study of three commercial gender classification algorithms in 2018 found that all three algorithms were generally most accurate when classifying light-skinned males and worst when classifying dark-skinned females. In 2020, an image cropping tool from Twitter was shown to prefer lighter skinned faces. DALL-E, a machine learning Text-to-image model released in 2021, has been prone to create racist and sexist images that reinforce societal stereotypes, something that has been admitted by its creators.

Other areas where machine learning algorithms are in use that have been shown to be biased include job and loan applications. Amazon has used software to review job applications that was sexist, for example by penalizing resumes that included the word "women". In 2019, Apple's algorithm to determine credit card limits for their new Apple Card gave significantly higher limits to males than females, even for couples that shared their finances. Mortgage-approval algorithms in use in the U.S. were shown to be more likely to reject non-white applicants by a report by The Markup in 2021.

Limitations

Recent works underline the presence of several limitations to the current landscape of fairness in machine learning, particularly when it comes to what is realistically achievable in this respect in the ever increasing real-world applications of AI. For instance, the mathematical and quantitative approach to formalize fairness, and the related "de-biasing" approaches, may rely onto too simplistic and easily overlooked assumptions, such as the categorization of individuals into pre-defined social groups. Other delicate aspects are, e.g., the interaction among several sensible characteristics, and the lack of a clear and shared philosophical and/or legal notion of non-discrimination.

Group fairness criteria

In classification problems, an algorithm learns a function to predict a discrete characteristic [math]\displaystyle{ Y }[/math], the target variable, from known characteristics [math]\displaystyle{ X }[/math]. We model [math]\displaystyle{ A }[/math] as a discrete random variable which encodes some characteristics contained or implicitly encoded in [math]\displaystyle{ X }[/math] that we consider as sensitive characteristics (gender, ethnicity, sexual orientation, etc.). We finally denote by [math]\displaystyle{ R }[/math] the prediction of the classifier. Now let us define three main criteria to evaluate if a given classifier is fair, that is if its predictions are not influenced by some of these sensitive variables.

Independence

We say the random variables [math]\displaystyle{ (R,A) }[/math] satisfy independence if the sensitive characteristics [math]\displaystyle{ A }[/math] are statistically independent of the prediction [math]\displaystyle{ R }[/math], and we write [math]\displaystyle{ R \bot A. }[/math] We can also express this notion with the following formula: [math]\displaystyle{ P(R = r\ |\ A = a) = P(R = r\ |\ A = b) \quad \forall r \in R \quad \forall a,b \in A }[/math] This means that the classification rate for each target classes is equal for people belonging to different groups with respect to sensitive characteristics [math]\displaystyle{ A }[/math].

Yet another equivalent expression for independence can be given using the concept of mutual information between random variables, defined as [math]\displaystyle{ I(X,Y) = H(X) + H(Y) - H(X,Y) }[/math] In this formula, [math]\displaystyle{ H(X) }[/math] is the entropy of the random variable [math]\displaystyle{ X }[/math]. Then [math]\displaystyle{ (R,A) }[/math] satisfy independence if [math]\displaystyle{ I(R,A) = 0 }[/math].

A possible relaxation of the independence definition include introducing a positive slack [math]\displaystyle{ \epsilon \gt 0 }[/math] and is given by the formula: [math]\displaystyle{ P(R = r\ |\ A = a) \geq P(R = r\ |\ A = b) - \epsilon \quad \forall r \in R \quad \forall a,b \in A }[/math]

Finally, another possible relaxation is to require [math]\displaystyle{ I(R,A) \leq \epsilon }[/math].

Separation

We say the random variables [math]\displaystyle{ (R,A,Y) }[/math] satisfy separation if the sensitive characteristics [math]\displaystyle{ A }[/math] are statistically independent of the prediction [math]\displaystyle{ R }[/math] given the target value [math]\displaystyle{ Y }[/math], and we write [math]\displaystyle{ R \bot A\ |\ Y. }[/math] We can also express this notion with the following formula: [math]\displaystyle{ P(R = r\ |\ Y = q, A = a) = P(R = r\ |\ Y = q, A = b) \quad \forall r \in R \quad q \in Y \quad \forall a,b \in A }[/math] This means that all the dependence of the decision [math]\displaystyle{ R }[/math] on the sensitive attribute [math]\displaystyle{ A }[/math] must be justified by the actual dependence of the true target variable [math]\displaystyle{ Y }[/math].

Another equivalent expression, in the case of a binary target rate, is that the true positive rate and the false positive rate are equal (and therefore the false negative rate and the true negative rate are equal) for every value of the sensitive characteristics: [math]\displaystyle{ P(R = 1\ |\ Y = 1, A = a) = P(R = 1\ |\ Y = 1, A = b) \quad \forall a,b \in A }[/math] [math]\displaystyle{ P(R = 1\ |\ Y = 0, A = a) = P(R = 1\ |\ Y = 0, A = b) \quad \forall a,b \in A }[/math]

A possible relaxation of the given definitions is to allow the value for the difference between rates to be a positive number lower than a given slack [math]\displaystyle{ \epsilon \gt 0 }[/math], rather than equal to zero.

In some fields separation (separation coefficient) in a confusion matrix is a measure of the distance (at a given level of the probability score) between the predicted cumulative percent negative and predicted cumulative percent positive.

The greater this separation coefficient is at a given score value, the more effective the model is at differentiating between the set of positives and negatives at a particular probability cut-off. According to Mayes: "It is often observed in the credit industry that the selection of validation measures depends on the modeling approach. For example, if modeling procedure is parametric or semi-parametric, the two-sample K-S test is often used. If the model is derived by heuristic or iterative search methods, the measure of model performance is usually divergence. A third option is the coefficient of separation...The coefficient of separation, compared to the other two methods, seems to be most reasonable as a measure for model performance because it reflects the separation pattern of a model."

Sufficiency

We say the random variables [math]\displaystyle{ (R,A,Y) }[/math] satisfy sufficiency if the sensitive characteristics [math]\displaystyle{ A }[/math] are statistically independent of the target value [math]\displaystyle{ Y }[/math] given the prediction [math]\displaystyle{ R }[/math], and we write [math]\displaystyle{ Y \bot A\ |\ R. }[/math] We can also express this notion with the following formula: [math]\displaystyle{ P(Y = q\ |\ R = r, A = a) = P(Y = q\ |\ R = r, A = b) \quad \forall q \in Y \quad r \in R \quad \forall a,b \in A }[/math] This means that the probability of actually being in each of the groups is equal for two individuals with different sensitive characteristics given that they were predicted to belong to the same group.

Relationships between definitions

Finally, we sum up some of the main results that relate the three definitions given above:

• Assuming [math]\displaystyle{ Y }[/math] is binary, if [math]\displaystyle{ A }[/math] and [math]\displaystyle{ Y }[/math] are not statistically independent, and [math]\displaystyle{ R }[/math] and [math]\displaystyle{ Y }[/math] are not statistically independent either, then independence and separation cannot both hold except for rhetorical cases.
• If [math]\displaystyle{ (R,A,Y) }[/math] as a joint distribution has positive probability for all its possible values and [math]\displaystyle{ A }[/math] and [math]\displaystyle{ Y }[/math] are not statistically independent, then separation and sufficiency cannot both hold except for rhetorical cases.

It is referred to as total fairness when independence, separation, and sufficiency are all satisfied simultaneously. However, total fairness is not possible to achieve except in specific rhetorical cases.

Mathematical formulation of group fairness definitions

Preliminary definitions

Most statistical measures of fairness rely on different metrics, so we will start by defining them. When working with a binary classifier, both the predicted and the actual classes can take two values: positive and negative. Now let us start explaining the different possible relations between predicted and actual outcome:

Confusion matrix

• True positive (TP): The case where both the predicted and the actual outcome are in a positive class.
• True negative (TN): The case where both the predicted outcome and the actual outcome are assigned to the negative class.
• False positive (FP): A case predicted to befall into a positive class assigned in the actual outcome is to the negative one.
• False negative (FN): A case predicted to be in the negative class with an actual outcome is in the positive one.

These relations can be easily represented with a confusion matrix, a table that describes the accuracy of a classification model. In this matrix, columns and rows represent instances of the predicted and the actual cases, respectively.

By using these relations, we can define multiple metrics which can be later used to measure the fairness of an algorithm:

• Positive predicted value (PPV): the fraction of positive cases which were correctly predicted out of all the positive predictions. It is usually referred to as precision, and represents the probability of a correct positive prediction. It is given by the following formula:[math]\displaystyle{ PPV = P(actual=+\ |\ prediction=+) = \frac{TP}{TP+FP} }[/math]
• False discovery rate (FDR): the fraction of positive predictions which were actually negative out of all the positive predictions. It represents the probability of an erroneous positive prediction, and it is given by the following formula:[math]\displaystyle{ FDR = P(actual=-\ |\ prediction=+) = \frac{FP}{TP+FP} }[/math]
• Negative predicted value (NPV): the fraction of negative cases which were correctly predicted out of all the negative predictions. It represents the probability of a correct negative prediction, and it is given by the following formula:[math]\displaystyle{ NPV = P(actual=-\ |\ prediction=-) = \frac{TN}{TN+FN} }[/math]
• False omission rate (FOR): the fraction of negative predictions which were actually positive out of all the negative predictions. It represents the probability of an erroneous negative prediction, and it is given by the following formula:[math]\displaystyle{ FOR = P(actual=+\ |\ prediction=-) = \frac{FN}{TN+FN} }[/math]
• True positive rate (TPR): the fraction of positive cases which were correctly predicted out of all the positive cases. It is usually referred to as sensitivity or recall, and it represents the probability of the positive subjects to be classified correctly as such. It is given by the formula:[math]\displaystyle{ TPR = P(prediction=+\ |\ actual=+) = \frac{TP}{TP+FN} }[/math]
• False negative rate (FNR): the fraction of positive cases which were incorrectly predicted to be negative out of all the positive cases. It represents the probability of the positive subjects to be classified incorrectly as negative ones, and it is given by the formula:[math]\displaystyle{ FNR = P(prediction=-\ |\ actual=+) = \frac{FN}{TP+FN} }[/math]
• True negative rate (TNR): the fraction of negative cases which were correctly predicted out of all the negative cases. It represents the probability of the negative subjects to be classified correctly as such, and it is given by the formula:[math]\displaystyle{ TNR = P(prediction=-\ |\ actual=-) = \frac{TN}{TN+FP} }[/math]
• False positive rate (FPR): the fraction of negative cases which were incorrectly predicted to be positive out of all the negative cases. It represents the probability of the negative subjects to be classified incorrectly as positive ones, and it is given by the formula:[math]\displaystyle{ FPR = P(prediction=+\ |\ actual=-) = \frac{FP}{TN+FP} }[/math]

Relationship between fairness criteria as shown in Barocas et al.

The following criteria can be understood as measures of the three general definitions given at the beginning of this section, namely Independence, Separation and Sufficiency. In the table to the right, we can see the relationships between them.

To define these measures specifically, we will divide them into three big groups as done in Verma et al.: definitions based on a predicted outcome, on predicted and actual outcomes, and definitions based on predicted probabilities and the actual outcome.

We will be working with a binary classifier and the following notation: [math]\displaystyle{ S }[/math] refers to the score given by the classifier, which is the probability of a certain subject to be in the positive or the negative class. [math]\displaystyle{ R }[/math] represents the final classification predicted by the algorithm, and its value is usually derived from [math]\displaystyle{ S }[/math], for example will be positive when [math]\displaystyle{ S }[/math] is above a certain threshold. [math]\displaystyle{ Y }[/math] represents the actual outcome, that is, the real classification of the individual and, finally, [math]\displaystyle{ A }[/math] denotes the sensitive attributes of the subjects.

Definitions based on predicted outcome

The definitions in this section focus on a predicted outcome [math]\displaystyle{ R }[/math] for various distributions of subjects. They are the simplest and most intuitive notions of fairness.

• Demographic parity, also referred to as statistical parity, acceptance rate parity and benchmarking. A classifier satisfies this definition if the subjects in the protected and unprotected groups have equal probability of being assigned to the positive predicted class. This is, if the following formula is satisfied:[math]\displaystyle{ P(R = +\ |\ A = a) = P(R = +\ |\ A = b) \quad \forall a,b \in A }[/math]
• Conditional statistical parity. Basically consists in the definition above, but restricted only to a subset of the instances. In mathematical notation this would be:[math]\displaystyle{ P(R = +\ |\ L = l, A = a) = P(R = +\ |\ L = l, A = b) \quad \forall a,b \in A \quad \forall l \in L }[/math]

Definitions based on predicted and actual outcomes

These definitions not only considers the predicted outcome [math]\displaystyle{ R }[/math] but also compare it to the actual outcome [math]\displaystyle{ Y }[/math].

• Predictive parity, also referred to as outcome test. A classifier satisfies this definition if the subjects in the protected and unprotected groups have equal PPV. This is, if the following formula is satisfied:[math]\displaystyle{ P(Y = +\ |\ R = +, A = a) = P(Y = +\ |\ R = +, A = b) \quad \forall a,b \in A }[/math]

Mathematically, if a classifier has equal PPV for both groups, it will also have equal FDR, satisfying the formula:[math]\displaystyle{ P(Y = -\ |\ R = +, A = a) = P(Y = -\ |\ R = +, A = b) \quad \forall a,b \in A }[/math]

• False positive error rate balance, also referred to as predictive equality. A classifier satisfies this definition if the subjects in the protected and unprotected groups have aqual FPR. This is, if the following formula is satisfied:[math]\displaystyle{ P(R = +\ |\ Y = -, A = a) = P(R = +\ |\ Y = -, A = b) \quad \forall a,b \in A }[/math]

Mathematically, if a classifier has equal FPR for both groups, it will also have equal TNR, satisfying the formula:[math]\displaystyle{ P(R = -\ |\ Y = -, A = a) = P(R = -\ |\ Y = -, A = b) \quad \forall a,b \in A }[/math]

• False negative error rate balance, also referred to as equal opportunity. A classifier satisfies this definition if the subjects in the protected and unprotected groups have equal FNR. This is, if the following formula is satisfied:[math]\displaystyle{ P(R = -\ |\ Y = +, A = a) = P(R = -\ |\ Y = +, A = b) \quad \forall a,b \in A }[/math]

Mathematically, if a classifier has equal FNR for both groups, it will also have equal TPR, satisfying the formula:[math]\displaystyle{ P(R = +\ |\ Y = +, A = a) = P(R = +\ |\ Y = +, A = b) \quad \forall a,b \in A }[/math]

• Equalized odds, also referred to as conditional procedure accuracy equality and disparate mistreatment. A classifier satisfies this definition if the subjects in the protected and unprotected groups have equal TPR and equal FPR, satisfying the formula:[math]\displaystyle{ P(R = +\ |\ Y = y, A = a) = P(R = +\ |\ Y = y, A = b) \quad y \in \{+,-\} \quad \forall a,b \in A }[/math]
• Conditional use accuracy equality. A classifier satisfies this definition if the subjects in the protected and unprotected groups have equal PPV and equal NPV, satisfying the formula:[math]\displaystyle{ P(Y = y\ |\ R = y, A = a) = P(Y = y\ |\ R = y, A = b) \quad y \in \{+,-\} \quad \forall a,b \in A }[/math]
• Overall accuracy equality. A classifier satisfies this definition if the subject in the protected and unprotected groups have equal prediction accuracy, that is, the probability of a subject from one class to be assigned to it. This is, if it satisfies the following formula:[math]\displaystyle{ P(R = Y\ |\ A = a) = P(R = Y\ |\ A = b) \quad \forall a,b \in A }[/math]
• Treatment equality. A classifier satisfies this definition if the subjects in the protected and unprotected groups have an equal ratio of FN and FP, satisfying the formula:[math]\displaystyle{ \frac{FN_{A=a}}{FP_{A=a}} = \frac{FN_{A=b}}{FP_{A=b}} }[/math]

Definitions based on predicted probabilities and actual outcome

These definitions are based in the actual outcome [math]\displaystyle{ Y }[/math] and the predicted probability score [math]\displaystyle{ S }[/math].

• Test-fairness, also known as calibration or matching conditional frequencies. A classifier satisfies this definition if individuals with the same predicted probability score [math]\displaystyle{ S }[/math] have the same probability of being classified in the positive class when they belong to either the protected or the unprotected group:[math]\displaystyle{ P(Y = +\ |\ S = s,A = a) = P(Y = +\ |\ S = s,A = b) \quad \forall s \in S \quad \forall a,b \in A }[/math]
• Well-calibration is an extension of the previous definition. It states that when individuals inside or outside the protected group have the same predicted probability score [math]\displaystyle{ S }[/math] they must have the same probability of being classified in the positive class, and this probability must be equal to [math]\displaystyle{ S }[/math]:[math]\displaystyle{ P(Y = +\ |\ S = s,A = a) = P(Y = +\ |\ S = s,A = b) = s \quad \forall s \in S \quad \forall a,b \in A }[/math]
• Balance for positive class. A classifier satisfies this definition if the subjects constituting the positive class from both protected and unprotected groups have equal average predicted probability score [math]\displaystyle{ S }[/math]. This means that the expected value of probability score for the protected and unprotected groups with positive actual outcome [math]\displaystyle{ Y }[/math] is the same, satisfying the formula:[math]\displaystyle{ E(S\ |\ Y = +,A = a) = E(S\ |\ Y = +,A = b) \quad \forall a,b \in A }[/math]
• Balance for negative class. A classifier satisfies this definition if the subjects constituting the negative class from both protected and unprotected groups have equal average predicted probability score [math]\displaystyle{ S }[/math]. This means that the expected value of probability score for the protected and unprotected groups with negative actual outcome [math]\displaystyle{ Y }[/math] is the same, satisfying the formula:[math]\displaystyle{ E(S\ |\ Y = -,A = a) = E(S\ |\ Y = -,A = b) \quad \forall a,b \in A }[/math]

Equal confusion fairness

With respect to confusion matrices, independence, separation, and sufficiency require the respective quantities listed below to not have statistically significant difference across sensitive characteristics.

• Independence: (TP + FP) / (TP + FP + FN + TN) (i.e., [math]\displaystyle{ P(\hat{Y} = 1) }[/math]).
• Separation: TN / (TN + FP) and TP / (TP + FN) (i.e., specificity [math]\displaystyle{ P(\hat{Y} = 0 \mid Y=0) }[/math] and recall [math]\displaystyle{ P(\hat{Y} = 1 \mid Y = 1) }[/math]).
• Sufficiency: TP / (TP + FP) and TN / (TN + FN) (i.e., precision [math]\displaystyle{ P(Y = 1 \mid \hat{Y}=1) }[/math] and negative predictive value [math]\displaystyle{ P(Y=0 \mid \hat{Y}=0) }[/math]).

The notion of equal confusion fairness requires the confusion matrix of a given decision system to have the same distribution when computed stratified over all sensitive characteristics.

Social welfare function

Some scholars have proposed defining algorithmic fairness in terms of a social welfare function. They argue that using a social welfare function enables an algorithm designer to consider fairness and predictive accuracy in terms of their benefits to the people affected by the algorithm. It also allows the designer to trade off efficiency and equity in a principled way. Sendhil Mullainathan has stated that algorithm designers should use social welfare functions in order to recognize absolute gains for disadvantaged groups. For example, a study found that using a decision-making algorithm in pretrial detention rather than pure human judgment reduced the detention rates for Blacks, Hispanics, and racial minorities overall, even while keeping the crime rate constant.

Individual fairness criteria

An important distinction among fairness definitions is the one between group and individual notions. Roughly speaking, while group fairness criteria compare quantities at a group level, typically identified by sensitive attributes (e.g. gender, ethnicity, age, etc.), individual criteria compare individuals. In words, individual fairness follow the principle that "similar individuals should receive similar treatments".

There is a very intuitive approach to fairness, which usually goes under the name of fairness through unawareness (FTU), or blindness, that prescribes not to explicitly employ sensitive features when making (automated) decisions. This is effectively a notion of individual fairness, since two individuals differing only for the value of their sensitive attributes would receive the same outcome.

However, in general, FTU is subject to several drawbacks, the main being that it does not take into account possible correlations between sensitive attributes and non-sensitive attributes employed in the decision-making process. For example, an agent with the (malignant) intention to discriminate on the basis of gender could introduce in the model a proxy variable for gender (i.e. a variable highly correlated with gender) and effectively using gender information while at the same time being compliant to the FTU prescription.

The problem of what variables correlated to sensitive ones are fairly employable by a model in the decision-making process is a crucial one, and is relevant for group concepts as well: independence metrics require a complete removal of sensitive information, while separation-based metrics allow for correlation, but only as far as the labeled target variable "justify" them.

The most general concept of individual fairness was introduced in the pioneer work by Cynthia Dwork and collaborators in 2012 and can be thought of as a mathematical translation of the principle that the decision map taking features as input should be built such that it is able to "map similar individuals similarly", that is expressed as a Lipschitz condition on the model map. They call this approach fairness through awareness (FTA), precisely as counterpoint to FTU, since they underline the importance of choosing the appropriate target-related distance metric in order to assess which individuals are similar in specific situations. Again, this problem is very related to the point raised above about what variables can be seen as "legitimate" in particular contexts.

Causality-based metrics

Causal fairness measures the frequency with which two nearly identical users or applications who differ only in a set of characteristics with respect to which resource allocation must be fair receive identical treatment.

An entire branch of the academic research on fairness metrics is devoted to leverage causal models to assess bias in machine learning models. This approach is usually justified by the fact that the same observational distribution of data may hide different causal relationships among the variables at play, possibly with different interpretations of whether the outcome are affected by some form of bias or not.

Kusner et al. propose to employ counterfactuals, and define a decision-making process counterfactually fair if, for any individual, the outcome does not change in the counterfactual scenario where the sensitive attributes are changed. The mathematical formulation reads:

[math]\displaystyle{ P(R_{A\leftarrow a}=1 \mid A=a,X=x) = P(R_{A\leftarrow b}=1 \mid A=a,X=x),\quad\forall a,b; }[/math]

that is: taken a random individual with sensitive attribute [math]\displaystyle{ A=a }[/math] and other features [math]\displaystyle{ X=x }[/math] and the same individual if she had [math]\displaystyle{ A = b }[/math], they should have same chance of being accepted. The symbol [math]\displaystyle{ \hat{R}_{A\leftarrow a} }[/math] represents the counterfactual random variable [math]\displaystyle{ R }[/math] in the scenario where the sensitive attribute [math]\displaystyle{ A }[/math] is fixed to [math]\displaystyle{ A=a }[/math]. The conditioning on [math]\displaystyle{ A=a, X=x }[/math] means that this requirement is at the individual level, in that we are conditioning on all the variables identifying a single observation.

Machine learning models are often trained upon data where the outcome depended on the decision made at that time. For example, if a machine learning model has to determine whether an inmate will recidivate and will determine whether the inmate should be released early, the outcome could be dependent on whether the inmate was released early or not. Mishler et al. propose a formula for counterfactual equalized odds:

[math]\displaystyle{ P(R=1 \mid Y^0=0, A=a) = P(R=1 \mid Y^0=0, A=b) \wedge P(R=0 \mid Y^1=1, A=a) = P(R=0 \mid Y^1=1, A=b),\quad\forall a,b; }[/math]

where [math]\displaystyle{ R }[/math] is a random variable, [math]\displaystyle{ Y^x }[/math] denotes the outcome given that the decision [math]\displaystyle{ x }[/math] was taken, and [math]\displaystyle{ A }[/math] is a sensitive feature.

Plecko and Bareinboim propose a unified framework to deal with causal analysis of fairness. They suggest the use of a Standard Fairness Model, consisting of a causal graph with 4 types of variables:

• sensitive attributes ([math]\displaystyle{ A }[/math]),
• target variable ([math]\displaystyle{ Y }[/math]),
• mediators ([math]\displaystyle{ W }[/math]) between [math]\displaystyle{ A }[/math] and [math]\displaystyle{ Y }[/math], representing possible indirect effects of sensitive attributes on the outcome,
• variables possibly sharing a common cause with [math]\displaystyle{ A }[/math] ([math]\displaystyle{ Z }[/math]), representing possible spurious (i.e., non causal) effects of the sensitive attributes on the outcome.

Within this framework, Plecko and Bareinboim are therefore able to classify the possible effects that sensitive attributes may have on the outcome. Moreover, the granularity at which these effects are measured—namely, the conditioning variables used to average the effect—is directly connected to the "individual vs. group" aspect of fairness assessment.

Bias mitigation strategies

Fairness can be applied to machine learning algorithms in three different ways: data preprocessing, optimization during software training, or post-processing results of the algorithm.

Preprocessing

Usually, the classifier is not the only problem; the dataset is also biased. The discrimination of a dataset [math]\displaystyle{ D }[/math] with respect to the group [math]\displaystyle{ A = a }[/math] can be defined as follows: [math]\displaystyle{ disc_{A=a}(D) = \frac{|\{X\in D| X(A) \neq a, X(Y) = +\}|}{|\{X \in D | X(A) \neq a \}|} - \frac{|\{X\in D| X(A) = a, X(Y) = +\}|}{|\{X \in D | X(A) = a \}|} }[/math]

That is, an approximation to the difference between the probabilities of belonging in the positive class given that the subject has a protected characteristic different from [math]\displaystyle{ a }[/math] and equal to [math]\displaystyle{ a }[/math].

Algorithms correcting bias at preprocessing remove information about dataset variables which might result in unfair decisions, while trying to alter as little as possible. This is not as simple as just removing the sensitive variable, because other attributes can be correlated to the protected one.

A way to do this is to map each individual in the initial dataset to an intermediate representation in which it is impossible to identify whether it belongs to a particular protected group while maintaining as much information as possible. Then, the new representation of the data is adjusted to get the maximum accuracy in the algorithm.

This way, individuals are mapped into a new multivariable representation where the probability of any member of a protected group to be mapped to a certain value in the new representation is the same as the probability of an individual which doesn't belong to the protected group. Then, this representation is used to obtain the prediction for the individual, instead of the initial data. As the intermediate representation is constructed giving the same probability to individuals inside or outside the protected group, this attribute is hidden to the classificator.

An example is explained in Zemel et al. where a multinomial random variable is used as an intermediate representation. In the process, the system is encouraged to preserve all information except that which can lead to biased decisions, and to obtain a prediction as accurate as possible.

On the one hand, this procedure has the advantage that the preprocessed data can be used for any machine learning task. Furthermore, the classifier does not need to be modified, as the correction is applied to the dataset before processing. On the other hand, the other methods obtain better results in accuracy and fairness.

Reweighing

Reweighing is an example of a preprocessing algorithm. The idea is to assign a weight to each dataset point such that the weighted discrimination is 0 with respect to the designated group.

If the dataset [math]\displaystyle{ D }[/math] was unbiased the sensitive variable [math]\displaystyle{ A }[/math] and the target variable [math]\displaystyle{ Y }[/math] would be statistically independent and the probability of the joint distribution would be the product of the probabilities as follows: [math]\displaystyle{ P_{exp}(A = a \wedge Y = +) = P(A = a) \times P(Y = +) = \frac{|\{X \in D | X(A) = a\}|}{|D|} \times \frac{|\{X \in D| X(Y) = + \}|}{|D|} }[/math]

In reality, however, the dataset is not unbiased and the variables are not statistically independent so the observed probability is: [math]\displaystyle{ P_{obs}(A = a \wedge Y = +) = \frac{|\{X \in D | X(A) = a \wedge X(Y) = +\}|}{|D|} }[/math]

To compensate for the bias, the software adds a weight, lower for favored objects and higher for unfavored objects. For each [math]\displaystyle{ X \in D }[/math] we get: [math]\displaystyle{ W(X) = \frac{P_{exp}(A = X(A) \wedge Y = X(Y))}{P_{obs}(A = X(A) \wedge Y = X(Y))} }[/math]

When we have for each [math]\displaystyle{ X }[/math] a weight associated [math]\displaystyle{ W(X) }[/math] we compute the weighted discrimination with respect to group [math]\displaystyle{ A = a }[/math] as follows: [math]\displaystyle{ disc_{A = a}(D) = \frac{\sum W(X) X \in \{X\in D| X(A) \neq a, X(Y) = +\}}{\sum W(X) X \in \{X \in D | X(A) \neq a \}} - \frac{\sum W(X) X \in \{X\in D| X(A) = a, X(Y) = +\}}{\sum W(X) X \in \{X \in D | X(A) = a \}} }[/math]

It can be shown that after reweighting this weighted discrimination is 0.

Inprocessing

Another approach is to correct the bias at training time. This can be done by adding constraints to the optimization objective of the algorithm. These constraints force the algorithm to improve fairness, by keeping the same rates of certain measures for the protected group and the rest of individuals. For example, we can add to the objective of the algorithm the condition that the false positive rate is the same for individuals in the protected group and the ones outside the protected group.

The main measures used in this approach are false positive rate, false negative rate, and overall misclassification rate. It is possible to add just one or several of these constraints to the objective of the algorithm. Note that the equality of false negative rates implies the equality of true positive rates so this implies the equality of opportunity. After adding the restrictions to the problem it may turn intractable, so a relaxation on them may be needed.

This technique obtains good results in improving fairness while keeping high accuracy and lets the programmer choose the fairness measures to improve. However, each machine learning task may need a different method to be applied and the code in the classifier needs to be modified, which is not always possible.

Adversarial debiasing

We train two classifiers at the same time through some gradient-based method (f.e.: gradient descent). The first one, the predictor tries to accomplish the task of predicting [math]\displaystyle{ Y }[/math], the target variable, given [math]\displaystyle{ X }[/math], the input, by modifying its weights [math]\displaystyle{ W }[/math] to minimize some loss function [math]\displaystyle{ L_{P}(\hat{y},y) }[/math]. The second one, the adversary tries to accomplish the task of predicting [math]\displaystyle{ A }[/math], the sensitive variable, given [math]\displaystyle{ \hat{Y} }[/math] by modifying its weights [math]\displaystyle{ U }[/math] to minimize some loss function [math]\displaystyle{ L_{A}(\hat{a},a) }[/math].

An important point here is that, in order to propagate correctly, [math]\displaystyle{ \hat{Y} }[/math] above must refer to the raw output of the classifier, not the discrete prediction; for example, with an artificial neural network and a classification problem, [math]\displaystyle{ \hat{Y} }[/math] could refer to the output of the softmax layer.

Then we update [math]\displaystyle{ U }[/math] to minimize [math]\displaystyle{ L_{A} }[/math] at each training step according to the gradient [math]\displaystyle{ \nabla_{U}L_{A} }[/math] and we modify [math]\displaystyle{ W }[/math] according to the expression: [math]\displaystyle{ \nabla_{W}L_{P} - proj_{\nabla_{W}L_{A}}\nabla_{W}L_{P} - \alpha \nabla_{W}L_{A} }[/math] where [math]\displaystyle{ \alpha }[/math] is a tuneable hyperparameter that can vary at each time step.

Graphic representation of the vectors used in adversarial debiasing as shown in Zhang et al.

The intuitive idea is that we want the predictor to try to minimize [math]\displaystyle{ L_{P} }[/math] (therefore the term [math]\displaystyle{ \nabla_{W}L_{P} }[/math]) while, at the same time, maximize [math]\displaystyle{ L_{A} }[/math] (therefore the term [math]\displaystyle{ - \alpha \nabla_{W}L_{A} }[/math]), so that the adversary fails at predicting the sensitive variable from [math]\displaystyle{ \hat{Y} }[/math].

The term [math]\displaystyle{ -proj_{\nabla_{W}L_{A}}\nabla_{W}L_{P} }[/math] prevents the predictor from moving in a direction that helps the adversary decrease its loss function.

It can be shown that training a predictor classification model with this algorithm improves demographic parity with respect to training it without the adversary.

Postprocessing

The final method tries to correct the results of a classifier to achieve fairness. In this method, we have a classifier that returns a score for each individual and we need to do a binary prediction for them. High scores are likely to get a positive outcome, while low scores are likely to get a negative one, but we can adjust the threshold to determine when to answer yes as desired. Note that variations in the threshold value affect the trade-off between the rates for true positives and true negatives.

If the score function is fair in the sense that it is independent of the protected attribute, then any choice of the threshold will also be fair, but classifiers of this type tend to be biased, so a different threshold may be required for each protected group to achieve fairness. A way to do this is plotting the true positive rate against the false negative rate at various threshold settings (this is called ROC curve) and find a threshold where the rates for the protected group and other individuals are equal.

The advantages of postprocessing include that the technique can be applied after any classifiers, without modifying it, and has a good performance in fairness measures. The cons are the need to access to the protected attribute in test time and the lack of choice in the balance between accuracy and fairness.

Reject option based classification

Given a classifier let [math]\displaystyle{ P(+|X) }[/math] be the probability computed by the classifiers as the probability that the instance [math]\displaystyle{ X }[/math] belongs to the positive class +. When [math]\displaystyle{ P(+|X) }[/math] is close to 1 or to 0, the instance [math]\displaystyle{ X }[/math] is specified with high degree of certainty to belong to class + or - respectively. However, when [math]\displaystyle{ P(+|X) }[/math] is closer to 0.5 the classification is more unclear.

We say [math]\displaystyle{ X }[/math] is a "rejected instance" if [math]\displaystyle{ max(P(+|X), 1-P(+|X)) \leq \theta }[/math] with a certain [math]\displaystyle{ \theta }[/math] such that [math]\displaystyle{ 0.5 \lt \theta \lt 1 }[/math].

The algorithm of "ROC" consists on classifying the non-rejected instances following the rule above and the rejected instances as follows: if the instance is an example of a deprived group ([math]\displaystyle{ X(A) = a }[/math]) then label it as positive, otherwise, label it as negative.

We can optimize different measures of discrimination (link) as functions of [math]\displaystyle{ \theta }[/math] to find the optimal [math]\displaystyle{ \theta }[/math] for each problem and avoid becoming discriminatory against the privileged group.

See also

• Algorithmic bias
• Machine learning