Delayed Impact of Fair Machine Learning

Lydia T. Liu, Sarah Dean, Esther Rolf, Max Simchowitz, Moritz Hardt

Introduction

Machine learning commonly considers static objectives defined on a snapshot of the population at one instant in time; consequential decisions, in contrast, reshape the population over time. Lending practices, for example, can shift the distribution of debt and wealth in the population. Job advertisements allocate opportunity. School admissions shape the level of education in a community.

Existing scholarship on fairness in automated decision-making criticizes unconstrained machine learning for its potential to harm historically underrepresented or disadvantaged groups in the population (Executive Office of the President, 2016; Barocas and Selbst, 2016). Consequently, a variety of fairness criteria have been proposed as constraints on standard learning objectives. Even though, in each case, these constraints are clearly intended to protect the disadvantaged group by an appeal to intuition, a rigorous argument to that effect is often lacking.

In this work, we formally examine under what circumstances fairness criteria do indeed promote the long-term well-being of disadvantaged groups measured in terms of a temporal variable of interest. Going beyond the standard classification setting, we introduce a one-step feedback model of decision-making that exposes how decisions change the underlying population over time.

Our running example is a hypothetical lending scenario. There are two groups in the population with features described by a summary statistic, such as a credit score, whose distribution differs between the two groups. The bank can choose thresholds for each group at which loans are offered. While group-dependent thresholds may face legal challenges (Ross and Yinger, 2006), they are generally inevitable for some of the criteria we examine. The impact of a lending decision has multiple facets. A default event not only diminishes profit for the bank, it also worsens the financial situation of the borrower as reflected in a subsequent decline in credit score. A successful lending outcome leads to profit for the bank and also to an increase in credit score for the borrower.

When thinking of one of the two groups as disadvantaged, it makes sense to ask what lending policies (choices of thresholds) lead to an expected improvement in the score distribution within that group. An unconstrained bank would maximize profit, choosing thresholds that meet a break-even point above which it is profitable to give out loans. One frequently proposed fairness criterion, sometimes called demographic parity, requires the bank to lend to both groups at an equal rate. Subject to this requirement the bank would continue to maximize profit to the extent possible. Another criterion, originally called equality of opportunity, equalizes the true positive rates between the two groups, thus requiring the bank to lend in both groups at an equal rate among individuals who repay their loan. Other criteria are natural, but for clarity we restrict our attention to these three.

Do these fairness criteria benefit the disadvantaged group? When do they show a clear advantage over unconstrained classification? Under what circumstances does profit maximization work in the interest of the individual? These are important questions that we begin to address in this work.

We introduce a one-step feedback model that allows us to quantify the long-term impact of classification on different groups in the population. We represent each of the two groups A\mathsf{A} and B\mathsf{B} by a score distribution πA\boldsymbol{\pi}_{\mathsf{A}} and πB,\boldsymbol{\pi}_{\mathsf{B}}, respectively. The support of these distributions is a finite set X\mathcal{X} corresponding to the possible values that the score can assume. We think of the score as highlighting one variable of interest in a specific domain such that higher score values correspond to a higher probability of a positive outcome. An institution chooses selection policies τA,τB ⁣:X\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{B}}\colon\mathcal{X}\to that assign to each value in X\mathcal{X} a number representing the rate of selection for that value. In our example, these policies specify the lending rate at a given credit score within a given group. The institution will always maximize their utility (defined formally later) subject to either (a) no constraint, or (b) equality of selection rates, or (c) equality of true positive rates.

Both fairness criteria (equal selection rates, equal true positive rates) can lead to all possible outcomes (improvement, stagnation, and decline) in natural parameter regimes. We provide a complete characterization of when each criterion leads to each outcome in Section 3.

There are a class of settings where equal selection rates cause decline, whereas equal true positive rates do not (Corollary 3.5),

Under a mild assumption, the institution’s optimal unconstrained selection policy can never lead to decline (Proposition 3.1).

We introduce the notion of an outcome curve (Figure 1) which succinctly describes the different regimes in which one criterion is preferable over the others.

We perform experiments on FICO credit score data from 2003 and show that under various models of bank utility and score change, the outcomes of applying fairness criteria are in line with our theoretical predictions.

We discuss how certain types of measurement error (e.g., the bank underestimating the repayment ability of the disadvantaged group) affect our comparison. We find that measurement error narrows the regime in which fairness criteria cause decline, suggesting that measurement should be a factor when motivating these criteria.

We consider alternatives to hard fairness constraints.

We evaluate the optimization problem where fairness criterion is a regularization term in the objective. Qualitatively, this leads to the same findings.

We discuss the possibility of optimizing for group score improvement Δμj\Delta\boldsymbol{\mu}_{\mathsf{j}} directly subject to institution utility constraints. The resulting solution provides an interesting possible alternative to existing fairness criteria.

We focus on the impact of a selection policy over a single epoch. The motivation is that the designer of a system usually has an understanding of the time horizon after which the system is evaluated and possibly redesigned. Formally, nothing prevents us from repeatedly applying our model and tracing changes over multiple epochs. In reality, however, it is plausible that over greater time periods, economic background variables might dominate the effect of selection.

Reflecting on our findings, we argue that careful temporal modeling is necessary in order to accurately evaluate the impact of different fairness criteria on the population. Moreover, an understanding of measurement error is important in assessing the advantages of fairness criteria relative to unconstrained selection. Finally, the nuances of our characterization underline how intuition may be a poor guide in judging the long-term impact of fairness constraints.

2 Related work

Recent work by Hu and Chen (2018) considers a model for long-term outcomes and fairness in the labor market. They propose imposing the demographic parity constraint in a temporary labor market in order to provably achieve an equitable long-term equilibrium in the permanent labor market, reminiscent of economic arguments for affirmative action (Foster and Vohra, 1992). The equilibrium analysis of the labor market dynamics model allows for specific conclusions relating fairness criteria to long term outcomes. Our general framework is complementary to this type of domain specific approach.

Fuster et al. (2017) consider the problem of fairness in credit markets from a different perspective. Their goal is to study the effect of machine learning on interest rates in different groups at an equilibrium, under a static model without feedback.

Ensign et al. (2017) consider feedback loops in predictive policing, where the police more heavily monitor high crime neighborhoods, thus further increasing the measured number of crimes in those neighborhoods. While the work addresses an important temporal phenomenon using the theory of urns, it is rather different from our one-step feedback model both conceptually and technically.

Demographic parity and its related formulations have been considered in numerous papers (e.g. Calders et al., 2009; Zafar et al., 2017). Hardt et al. (2016) introduced the equality of opportunity constraint that we consider and demonstrated limitations of a broad class of criteria. Kleinberg et al. (2017) and Chouldechova (2016) point out the tension between “calibration by group” and equal true/false positive rates. These trade-offs carry over to some extent to the case where we only equalize true positive rates (Pleiss et al., 2017).

A growing literature on fairness in the “bandits” setting of learning (see Joseph et al., 2016, et sequelae) deals with online decision making that ought not to be confused with our one-step feedback setting. Finally, there has been much work in the social sciences on analyzing the effect of affirmative action (see e.g., Keith et al., 1985; Kalev et al., 2006).

3 Discussion

In this paper, we advocate for a view toward long-term outcomes in the discussion of “fair” machine learning. We argue that without a careful model of delayed outcomes, we cannot foresee the impact a fairness criterion would have if enforced as a constraint on a classification system. However, if such an accurate outcome model is available, we show that there are more direct ways to optimize for positive outcomes than via existing fairness criteria. We outline such an outcome-based solution in Section 4.3. Specifically, in the credit setting, the outcome-based solution corresponds to giving out more loans to the protected group in a way that reduces profit for the bank compared to unconstrained profit maximization, but avoids loaning to those who are unlikely to benefit, resulting in a maximally improved group average credit score. The extent to which such a solution could form the basis of successful regulation depends on the accuracy of the available outcome model.

This raises the question if our model of outcomes is rich enough to faithfully capture realistic phenomena. By focusing on the impact that selection has on individuals at a given score, we model the effects for those not selected as zero-mean. For example, not getting a loan in our model has no negative effect on the credit score of an individual.In reality, a denied credit inquiry may lower one’s credit score, but the effect is small compared to a default event. This does not mean that wrongful rejection (i.e., a false negative) has no visible manifestation in our model. If a classifier has a higher false negative rate in one group than in another, we expect the classifier to increase the disparity between the two groups (under natural assumptions). In other words, in our outcome-based model, the harm of denied opportunity manifests as growing disparity between the groups. The cost of a false negative could also be incorporated directly into the outcome-based model by a simple modification (see Footnote 2). This may be fitting in some applications where the immediate impact of a false negative to the individual is not zero-mean, but significantly reduces their future success probability.

In essence, the formalism we propose requires us to understand the two-variable causal mechanism that translates decisions to outcomes. This can be seen as relaxing the requirements compared with recent work on avoiding discrimination through causal reasoning that often required stronger assumptions (Kusner et al., 2017; Nabi and Shpitser, 2017; Kilbertus et al., 2017). In particular, these works required knowledge of how sensitive attributes (such as gender, race, or proxies thereof) causally relate to various other variables in the data. Our model avoids the delicate modeling step involving the sensitive attribute, and instead focuses on an arguably more tangible economic mechanism. Nonetheless, depending on the application, such an understanding might necessitate greater domain knowledge and additional research into the specifics of the application. This is consistent with much scholarship that points to the context-sensitive nature of fairness in machine learning.

Problem Setting

We now introduce the specific domain of credit scores as a running example in the rest of the paper, after which we present two more examples showing the general applicability of our formulation to many domains.

In the setting of loans, scores x[C]x\in[C] represent credit scores, and the bank serves as the institution. The bank chooses to grant or refuse loans to individuals according to a policy τ\boldsymbol{\tau}. Both bank and personal utilities are given as functions of loan repayment, and therefore depend on the success probabilities ρ(x)\boldsymbol{\rho}(x), representing the probability that any individual with credit score xx can repay a loan within a fixed time frame. The expected utility to the bank is given by the expected return from a loan, which can be modeled as an affine function of ρ(x)\boldsymbol{\rho}(x): u(x)=u+ρ(x)+u(1ρ(x))\boldsymbol{u}(x)=u_{+}\boldsymbol{\rho}(x)+u_{-}(1-\boldsymbol{\rho}(x)), where u+u_{+} denotes the profit when loans are repaid and uu_{-} the loss when they are defaulted on. Individual outcomes of being granted a loan are based on whether or not an individual repays the loan, and a simple model for Δ(x)\boldsymbol{\Delta}(x) may also be affine in ρ(x)\boldsymbol{\rho}(x): Δ(x)=c+ρ(x)+c(1ρ(x))\boldsymbol{\Delta}(x)=c_{+}\boldsymbol{\rho}(x)+c_{-}(1-\boldsymbol{\rho}(x)), modified accordingly at boundary states. The constant c+c_{+} denotes the gain in credit score if loans are repaid and cc_{-} is the score penalty in case of default.

A second illustrative example is given by the case of advertising agencies making decisions about which groups to target. An individual with product interest score xx responds positively to an ad with probability ρ(x)\boldsymbol{\rho}(x). The ad agency experiences utility u(x)\boldsymbol{u}(x) related to click-through rates, which increases with ρ(x)\boldsymbol{\rho}(x). Individuals who see the ad but are uninterested may react negatively (becoming less interested in the product), and Δ(x)\boldsymbol{\Delta}(x) encodes the interest change. If the product is a positive good like education or employment opportunities, interest can correspond to well-being. Thus the advertising agency’s incentives to only show ads to individuals with extremely high interest may leave behind groups whose interest is lower on average. A related historical example occurred in advertisements for computers in the 1980s, where male consumers were targeted over female consumers, arguably contributing to the current gender gap in computing.

The scenario of college admissions or scholarship allotments can also be considered within our framework. Colleges may select certain applicants for acceptance according to a score xx, which could be thought encode a “college preparedness” measure. The students who are admitted might “succeed” (this could be interpreted as graduating, graduating with honors, finding a job placement, etc.) with some probability ρ(x)\boldsymbol{\rho}(x) depending on their preparedness. The college might experience a utility u(x)\boldsymbol{u}(x) corresponding to alumni donations, or positive rating when a student succeeds; they might also show a drop in rating or a loss of invested scholarship money when a student is unsuccessful. The student’s success in college will affect their later success, which could be modeled generally by Δ(x)\boldsymbol{\Delta}(x). In this scenario, it is challenging to ensure that a single summary statistic xx captures enough information about a student; it may be more appropriate to consider xx as a vector as well as more complex forms of ρ(x)\boldsymbol{\rho}(x).

While a variety of applications are modeled faithfully within our framework, there are limitations to the accuracy with which real-life phenomenon can be measured by strictly binary decisions and success probabilities. Such binary rules are necessary for the definition and execution of existing fairness criteria, (see Sec. 2.2) and as we will see, even modeling these facets of decision making as binary allows for complex and interesting behavior.

We now introduce important outcome regimes, stated in terms of the change in average group score. A policy (τA,τB)(\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{B}}) is said to cause active harm to group j\mathsf{j} if Δμj(τj)<0\Delta\boldsymbol{\mu}_{\mathsf{j}}(\boldsymbol{\tau}_{\mathsf{j}})<0, stagnation if Δμj(τj)=0\Delta\boldsymbol{\mu}_{\mathsf{j}}(\boldsymbol{\tau}_{\mathsf{j}})=0, and improvement if Δμj(τj)>0\Delta\boldsymbol{\mu}_{\mathsf{j}}(\boldsymbol{\tau}_{\mathsf{j}})>0. Under our model, MaxUtil\mathtt{MaxUtil} policies can be chosen in a standard fashion which applies the same threshold τMaxUtil\boldsymbol{\tau}^{\mathtt{MaxUtil}} for both groups, and is agnostic to the distributions πA\boldsymbol{\pi}_{\mathsf{A}} and πB\boldsymbol{\pi}_{\mathsf{B}}. Hence, if we define

we say that a policy causes relative harm to group j\mathsf{j} if Δμj(τj)<ΔμjMaxUtil\Delta\boldsymbol{\mu}_{\mathsf{j}}(\boldsymbol{\tau}_{\mathsf{j}})<\Delta\boldsymbol{\mu}_{\mathsf{j}}^{\mathtt{MaxUtil}}, and relative improvement if Δμj(τj)>ΔμjMaxUtil\Delta\boldsymbol{\mu}_{\mathsf{j}}(\boldsymbol{\tau}_{\mathsf{j}})>\Delta\boldsymbol{\mu}_{\mathsf{j}}^{\mathtt{MaxUtil}}. In particular, we focus on these outcomes for a disadvantaged group, and consider whether imposing a fairness constraint improves their outcomes relative to the MaxUtil\mathtt{MaxUtil} strategy. From this point forward, we take A\mathsf{A} to be disadvantaged or protected group.

Figure 1 displays the important outcome regimes in terms of selection rates βj:=xXπj(x)τj(x)\beta_{\mathsf{j}}:=\sum_{x\in\mathcal{X}}\boldsymbol{\pi}_{\mathsf{j}}(x)\boldsymbol{\tau}_{\mathsf{j}}(x). This succinct characterization is possible when considering decision rules based on (possibly randomized) score thresholding, in which all individuals with scores above a threshold are selected. In Section 5, we justify the restriction to such threshold policies by showing it preserves optimality. In Section 5.1, we show that the outcome curve is concave, thus implying that it takes the shape depicted in Figure 1. To explicitly connect selection rates to decision policies, we define the rate function rπ(τj)r_{\boldsymbol{\pi}}(\boldsymbol{\tau}_{\mathsf{j}}) which returns the proportion of group j\mathsf{j} selected by the policy. We show that this function is invertible for a suitable class of threshold policies, and in fact the outcome curve is precisely the graph of the map from selection rate to outcome βΔμA(rπA1(β))\beta\mapsto\Delta\boldsymbol{\mu}_{\mathsf{A}}(r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\beta)). Next, we define the values of β\beta that mark boundaries of the outcome regions.

Given the protected group A\mathsf{A}, the following selection rates are of interest in distinguishing between qualitatively different classes of outcomes (Figure 1). We define βMaxUtil\beta^{\mathtt{MaxUtil}} as the selection rate for A\mathsf{A} under MaxUtil\mathtt{MaxUtil}; β0\beta_{0} as the harm threshold, such that ΔμA(rπA1(β0)) = 0\Delta\boldsymbol{\mu}_{\mathsf{A}}(r^{-1}_{\boldsymbol{\pi}_{\mathsf{A}}}(\beta_{0}))~{}=~{}0; β\beta^{*} as the selection rate such that ΔμA\Delta\boldsymbol{\mu}_{\mathsf{A}} is maximized; β\overline{\beta} as the outcome-complement of the MaxUtil\mathtt{MaxUtil} selection rate, ΔμArπA1(β)) = ΔμA(rπA1(βMaxUtil))\Delta\boldsymbol{\mu}_{\mathsf{A}}r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\overline{\beta}))~{}=~{}\Delta\boldsymbol{\mu}_{\mathsf{A}}(r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\beta^{\mathtt{MaxUtil}})) with β > βMaxUtil\overline{\beta}~{}>~{}\beta^{\mathtt{MaxUtil}}.

2 Decision Rules and Fairness Criteria

Just as the expected outcome Δμ\Delta\boldsymbol{\mu} can be expressed in terms of selection rate for threshold policies, so can the total utility U\mathcal{U}. In the unconstrained cause, U\mathcal{U} varies independently over the selection rates for group A\mathsf{A} and B\mathsf{B}; however, in the presence of fairness constraints the selection rate for one group determines the allowable selection rate for the other. The selection rates must be equal for DemParity\mathtt{DemParity}, but for EqOpt\mathtt{EqOpt} we can define a transfer function, G(AB)G^{(\mathsf{A}\to\mathsf{B})}, which for every loan rate β\beta in group A\mathsf{A} gives the loan rate in group B\mathsf{B} that has the same true positive rate. Therefore, when considering threshold policies, decision rules amount to maximizing functions of single parameters. This idea is expressed in Figure 2, and underpins the results to follow.

Results

In order to clearly characterize the outcome of applying fairness constraints, we make the following assumption.

The institution’s individual utility function is more stringent than the expected score changes, u(x)>0    Δ(x)>0\boldsymbol{u}(x)>0\implies\boldsymbol{\Delta}(x)>0. (For the linear form presented in Example 2.1, uu+<cc+\frac{u_{-}}{u_{+}}<\frac{c_{-}}{c_{+}} is necessary and sufficient.)

This simplifying assumption quantifies the intuitive notion that institutions take a greater risk by accepting than the individual does by applying. For example, in the credit setting, a bank loses the amount loaned in the case of a default, but makes only interest in case of a payback. Using Assumption 1, we can restrict the position of MaxUtil\mathtt{MaxUtil} on the outcome curve in the following sense.

Under Assumption 1, 0ΔμMaxUtilΔμ0\leq\Delta\boldsymbol{\mu}^{\mathtt{MaxUtil}}\leq\Delta\boldsymbol{\mu}^{*}.

We direct the reader to Appendix C for the proof of the above proposition, and all subsequent results presented in this section. The results are corollaries to theorems presented in Section 6.

We begin by characterizing general settings under which fairness criteria act to improve outcomes over unconstrained MaxUtil\mathtt{MaxUtil} strategies. For this result, we will assume that group A\mathsf{A} is disadvantaged in the sense that the MaxUtil\mathtt{MaxUtil} acceptance rate for B\mathsf{B} is large compared to relevant acceptance rates for A\mathsf{A}.

(a) Under the assumption that βAMaxUtil<β\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}<\overline{\beta} and βBMaxUtil>βAMaxUtil\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}>\beta^{\mathtt{MaxUtil}}_{\mathsf{A}}, there exist population proportions g0<g1<1g_{0}<g_{1}<1 such that, for all gA[g0,g1]g_{\mathsf{A}}\in[g_{0},g_{1}], βAMaxUtil<βADemParity<β\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}<\beta_{\mathsf{A}}^{\mathtt{DemParity}}<\overline{\beta}. That is, DemParity\mathtt{DemParity} causes relative improvement.

(b) Under the assumption that there exist βAMaxUtil<β<β<β\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}<\beta<\beta^{\prime}<\overline{\beta} such that βBMaxUtil>G(AB)(β),G(AB)(β)\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}>G^{(\mathsf{A}\to\mathsf{B})}(\beta),G^{(\mathsf{A}\to\mathsf{B})}(\beta^{\prime}), there exist population proportions g2<g3<1g_{2}<g_{3}<1 such that, for all gA[g2,g3]g_{\mathsf{A}}\in[g_{2},g_{3}], βAMaxUtil<βAEqOpt<β\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}<\beta_{\mathsf{A}}^{\mathtt{EqOpt}}<\overline{\beta}. That is, EqOpt\mathtt{EqOpt} causes relative improvement.

This result gives the conditions under which we can guarantee the existence of settings in which fairness criteria cause improvement relative to MaxUtil\mathtt{MaxUtil}. Relying on machinery proved in Section 6, the result follows from comparing the position of optima on the utility curve to the outcome curve. Figure 2 displays a illustrative example of both the outcome curve and the institutions’ utility U\mathcal{U} as a function of the selection rates in group A\mathsf{A}. In the utility function (1), the contributions of each group are weighted by their population proportions gjg_{\mathsf{j}}, and thus the resulting selection rates are sensitive to these proportions.

As we see in the remainder of this section, fairness criteria can achieve nearly any position along the outcome curve under the right conditions. This fact comes from the potential mismatch between the outcomes, controlled by Δ\boldsymbol{\Delta}, and the institution’s utility u\boldsymbol{u}.

The next theorem implies that DemParity\mathtt{DemParity} can be bad for long term well-being of the protected group by being over-generous, under the mild assumption that ΔμA(βBMaxUtil) < 0\Delta\boldsymbol{\mu}_{\mathsf{A}}(\beta_{\mathsf{B}}^{\mathtt{MaxUtil}})~{}<~{}0:

Fix a selection rate β\beta. Assume that βBMaxUtil > β > βAMaxUtil\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}~{}>~{}\beta~{}>~{}\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}. Then, there exists a population proportion g0g_{0} such that, for all gA[0,g0]g_{\mathsf{A}}\in[0,g_{0}], βADemParity>β\beta_{\mathsf{A}}^{\mathtt{DemParity}}>\beta. In particular, when β=β0\beta=\beta_{0}, DemParity\mathtt{DemParity} causes active harm, and when β=β\beta=\overline{\beta}, DemParity\mathtt{DemParity} causes relative harm.

The assumption ΔμA(βBMaxUtil) < 0\Delta\boldsymbol{\mu}_{\mathsf{A}}(\beta_{\mathsf{B}}^{\mathtt{MaxUtil}})~{}<~{}0 implies that a policy which selects individuals from group A\mathsf{A} at the selection rate that MaxUtil\mathtt{MaxUtil} would have used for group B\mathsf{B} necessarily lowers average score in A\mathsf{A}. This is one natural notion of protected group A\mathsf{A}’s ‘disadvantage’ relative to group B\mathsf{B}. In this case, DemParity\mathtt{DemParity} penalizes the scores of group A\mathsf{A} even more than a naive MaxUtil\mathtt{MaxUtil} policy, as long as group proportion gAg_{\mathsf{A}} is small enough. Again, small gAg_{\mathsf{A}} is another notion of group disadvantage.

Using credit scores as an example, Corollary 3.3 tells us that an overly aggressive fairness criterion will give too many loans to people in a protected group who cannot pay them back, hurting the group’s credit scores on average. In the following theorem, we show that an analogous result holds for EqOpt\mathtt{EqOpt}.

Suppose that βBMaxUtil > G(AB)(β)\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}~{}>~{}G^{(\mathsf{A}\to\mathsf{B})}(\beta) and β > βAMaxUtil\beta~{}>~{}\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}. Then, there exists a population proportion g0g_{0} such that, for all gA[0,g0]g_{\mathsf{A}}\in[0,g_{0}], βAEqOpt > β\beta^{\mathtt{EqOpt}}_{\mathsf{A}}~{}>~{}\beta. In particular, when β = β0\beta~{}=~{}\beta_{0}, EqOpt\mathtt{EqOpt} causes active harm, and when β = β\beta~{}=~{}\overline{\beta}, EqOpt\mathtt{EqOpt} causes relative harm.

We remark that in Corollary 3.4, we rely on the transfer function, G(AB)G^{(\mathsf{A}\to\mathsf{B})}, which for every loan rate β\beta in group A\mathsf{A} gives the loan rate in group B\mathsf{B} that has the same true positive rate. Notice that if G(AB)G^{(\mathsf{A}\to\mathsf{B})} were the identity function, Corollary 3.3 and Corollary 3.4 would be exactly the same. Indeed, our framework (detailed in Section 6 and Appendix B) unifies the analyses for a large class of fairness constraints that includes DemParity\mathtt{DemParity} and EqOpt\mathtt{EqOpt} as specific cases, and allows us to derive results about impact on Δμ\Delta\boldsymbol{\mu} using general techniques. In the next section, we present further results that compare the fairness criteria, demonstrating the usefulness of our technical framework.

2 Comparing 𝙴𝚚𝙾𝚙𝚝𝙴𝚚𝙾𝚙𝚝\mathtt{EqOpt} and 𝙳𝚎𝚖𝙿𝚊𝚛𝚒𝚝𝚢𝙳𝚎𝚖𝙿𝚊𝚛𝚒𝚝𝚢\mathtt{DemParity}

Our analysis of the acceptance rates of EqOpt\mathtt{EqOpt} and DemParity\mathtt{DemParity} in Section 6 suggests that it is difficult to compare DemParity\mathtt{DemParity} and EqOpt\mathtt{EqOpt} without knowing the full distributions πA,πB\boldsymbol{\pi}_{\mathsf{A}},\boldsymbol{\pi}_{\mathsf{B}}, which is necessary to compute the transfer function G(AB)G^{(\mathsf{A}\to\mathsf{B})}. In fact, we have found that settings exist both in which DemParity\mathtt{DemParity} causes harm while EqOpt\mathtt{EqOpt} causes improvement and in which DemParity\mathtt{DemParity} causes improvement while EqOpt\mathtt{EqOpt} causes harm. There cannot be one general rule as to which fairness criteria provides better outcomes in all settings. We now present simple sufficient conditions on the geometry of the distributions for which EqOpt\mathtt{EqOpt} is always better than DemParity\mathtt{DemParity} in terms of ΔμA\Delta\boldsymbol{\mu}_{\mathsf{A}}.

Fix a selection rate β\beta. Suppose πA,πB\boldsymbol{\pi}_{\mathsf{A}},\boldsymbol{\pi}_{\mathsf{B}} are identical up to a translation with μA < μB\boldsymbol{\mu}_{\mathsf{A}}~{}<~{}\boldsymbol{\mu}_{\mathsf{B}}, i.e. πA(x) = πB(x+(μBμA))\boldsymbol{\pi}_{\mathsf{A}}(x)~{}=~{}\boldsymbol{\pi}_{\mathsf{B}}(x+(\boldsymbol{\mu}_{\mathsf{B}}-\boldsymbol{\mu}_{\mathsf{A}})). For simplicity, take ρ(x)\boldsymbol{\rho}(x) to be linear in xx. Suppose

Then there exists an interval [g1,g2]  [g_{1},g_{2}]~{}\subseteq~{}, such that gA > g1\forall g_{\mathsf{A}}~{}>~{}g_{1}, βEqOpt < β\beta^{\mathtt{EqOpt}}~{}<~{}\beta while gA < g2\forall g_{\mathsf{A}}~{}<~{}g_{2}, βDemParity > β\beta^{\mathtt{DemParity}}~{}>~{}\beta. In particular, when β = β0\beta~{}=~{}\beta_{0}, this implies DemParity\mathtt{DemParity} causes active harm but EqOpt\mathtt{EqOpt} causes improvement for gA  [g1,g2]g_{\mathsf{A}}~{}\in~{}[g_{1},g_{2}], but for any gAg_{\mathsf{A}} such that DemParity\mathtt{DemParity} causes improvement, EqOpt\mathtt{EqOpt} also causes improvement.

To interpret the conditions under which Corollary 3.5 holds, consider when we might have β0>x>μAπA\beta_{0}>\sum_{x>\boldsymbol{\mu}_{\mathsf{A}}}\boldsymbol{\pi}_{\mathsf{A}}. This is precisely when ΔμA(x>μAπA)>0\Delta\boldsymbol{\mu}_{\mathsf{A}}(\sum_{x>\boldsymbol{\mu}_{\mathsf{A}}}\boldsymbol{\pi}_{\mathsf{A}})>0, that is, ΔμA>0\Delta\boldsymbol{\mu}_{\mathsf{A}}>0 for a policy that selects every individual whose score is above the group A\mathsf{A} mean, which is reasonable in reality. Indeed, the converse would imply that group A\mathsf{A} has such low scores that even selecting all above average individuals in A\mathsf{A} would hurt the average score. In such a case, Corollary 3.5 suggests that EqOpt\mathtt{EqOpt} is better than DemParity\mathtt{DemParity} at avoiding active harm, because it is more conservative. A natural question then is: can EqOpt\mathtt{EqOpt} cause relative harm by being too stingy?

Then βAEqOpt < βAMaxUtil < βADemParity\beta_{\mathsf{A}}^{\mathtt{EqOpt}}~{}<~{}\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}~{}<~{}\beta_{\mathsf{A}}^{\mathtt{DemParity}}. That is, EqOpt\mathtt{EqOpt} causes relative harm by selecting at a rate lower than MaxUtil\mathtt{MaxUtil}.

The above theorem shows that DemParity\mathtt{DemParity} is never stingier than MaxUtil\mathtt{MaxUtil} to the protected group A\mathsf{A}, as long as a A\mathsf{A} is disadvantaged in the sense that MaxUtil\mathtt{MaxUtil} selects a larger proportion of B\mathsf{B} than A\mathsf{A}. On the other hand, EqOpt\mathtt{EqOpt} can select less of group A\mathsf{A} than MaxUtil\mathtt{MaxUtil}, and by definition, cause relative harm. This is a surprising result about EqOpt\mathtt{EqOpt}, and this phenomenon arises from high levels of in-group inequality for group A\mathsf{A}. Moreover, we show in Appendix C that there are parameter settings where the conditions in Corollary 3.6 are satisfied even under a stringent notion of disadvantage we call CDF domination, described therein.

Relaxations of Constrained Fairness

In many cases, it may be unrealistic for an institution to ensure that fairness constraints are met exactly. However, one can consider “soft” formulations of fairness constraints which either penalized the differences in acceptance rate (DemParity\mathtt{DemParity}) or the differences in TPR (EqOpt\mathtt{EqOpt}). In Appendix B, we formulate these soft constraints as regularized objectives. For example, a soft-DemParity\mathtt{DemParity} can be rendered as

where λ>0\lambda>0 is a regularization parameter, and Φ(t)\Phi(t) is a convex regularization function. We show that the solutions to these objectives are threshold policies, and can be fully characterized in terms of the group-wise selection rate. We also make rigorous the notion that policies which solve the soft-constraint objective interpolate between MaxUtil\mathtt{MaxUtil} policies at λ=0\lambda=0 and hard-constrained policies (DemParity\mathtt{DemParity} or EqOpt\mathtt{EqOpt}) as λ\lambda\to\infty. This fact is clearly demonstrated by the form of the solutions in the special case of the regularization function Φ(t)=t\Phi(t)=|t|, provided in the appendix.

2 Fairness Under Measurement Error

Next, consider the implications of an institution with imperfect knowledge of scores. Under a simple model in which the estimate of an individual’s score XπX\sim\boldsymbol{\pi} is prone to errors e(X)e(X) such that X + e(X):=X^  π^X~{}+~{}e(X):=\widehat{X}~{}\sim~{}\widehat{\boldsymbol{\pi}}. Constraining the error to be negative results in the setting that scores are systematically underestimated. In this setting, it is equivalent to consider the CDF of underestimated distribution π^\widehat{\boldsymbol{\pi}} to be dominated by the CDF true distribution π\boldsymbol{\pi}, that is xcπ^(x)xcπ(x)\sum_{x\geq c}\widehat{\boldsymbol{\pi}}(x)\leq\sum_{x\geq c}\boldsymbol{\pi}(x) for all c[C]c\in[C]. Then we can compare the institution’s behavior under this estimation to its behavior under the truth.

Fix the distribution of B\mathsf{B} as πB\boldsymbol{\pi}_{\mathsf{B}} and let β\beta be the acceptance rate of A\mathsf{A} when the institution makes the decision using perfect knowledge of the distribution πA\boldsymbol{\pi}_{\mathsf{A}}. Denote β^\widehat{\beta} as the acceptance rate when the group is instead taken as π^A\widehat{\boldsymbol{\pi}}_{\mathsf{A}}. Then βAMaxUtil > β^AMaxUtil\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}~{}>~{}\widehat{\beta}_{\mathsf{A}}^{\mathtt{MaxUtil}} and βADemParity>β^ADemParity\beta_{\mathsf{A}}^{\mathtt{DemParity}}>\widehat{\beta}_{\mathsf{A}}^{\mathtt{DemParity}}. If the errors are further such that the true TPR dominates the estimated TPR, it is also true that βAEqOpt > β^AEqOpt\beta_{\mathsf{A}}^{\mathtt{EqOpt}}~{}>~{}\widehat{\beta}_{\mathsf{A}}^{\mathtt{EqOpt}}.

Because fairness criteria encourage a higher selection rate for disadvantaged groups (Corollary 3.2), systematic underestimation widens the regime of their applicability. Furthermore, since the estimated MaxUtil\mathtt{MaxUtil} policy underloans, the region for relative improvement in the outcome curve (Figure 1) is larger, corresponding to more regimes under which fairness criteria can yield favorable outcomes. Thus the potential for measurement error should be a factor when motivating these criteria.

3 Outcome-based alternative

As explained in the preceding sections, fairness criteria may actively harm disadvantaged groups. It is thus natural to consider a modified decision rule which involves the explicit maximization of ΔμA\Delta\boldsymbol{\mu}_{\mathsf{A}}. In this case, imagine that the institution’s primary goal is to aid the disadvantaged group, subject to a limited profit loss compared to the maximum possible expected profit UMaxUtil\mathcal{U}^{\mathtt{MaxUtil}}. The corresponding problem is as follows.

Unlike the fairness constrained objective, this objective no longer depends on group B\mathsf{B} and instead depends on our model of the mean score change in group A\mathsf{A}, ΔμA\Delta\boldsymbol{\mu}_{\mathsf{A}}.

In the above setting, the optimal bank policy τA\boldsymbol{\tau}_{\mathsf{A}} is a threshold policy with selection rate β=min{β,βmax}\beta=\min\{\beta^{*},\beta^{\max}\}, where β\beta^{*} is the outcome-optimal loan rate and βmax\beta^{\max} is the maximum loan rate under the bank’s “budget”.

The above formulation’s advantage over fairness constraints is that it directly optimizes the outcome of A\mathsf{A} and can be approximately implemented given reasonable ability to predict outcomes. Importantly, this objective shifts the focus to outcome modeling, highlighting the importance of domain specific knowledge. Future work can consider strategies that are robust to outcome model errors.

Optimality of Threshold Policies

so that for τ=(τA,τB)\boldsymbol{\tau}=(\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{B}}), U(τ):=gAUA(τA)+gBUB(τB)\mathcal{U}(\boldsymbol{\tau}):=g_{\mathsf{A}}\mathcal{U}_{\mathsf{A}}(\boldsymbol{\tau}_{\mathsf{A}})+g_{\mathsf{B}}\mathcal{U}_{\mathsf{B}}(\boldsymbol{\tau}_{\mathsf{B}}).

First, we formally describe threshold policies, and rigorously justify why we may always assume without loss of generality that the institution adopts policies of this form.

A single group selection policy τC\boldsymbol{\tau}\in^{C} is called a threshold policy if it has the form of a randomized threshold on score:

As a technicality, if no members of a population have a given score xXx\in\mathcal{X}, there may be multiple threshold policies which yield equivalent selection rates for a given population. To avoid redundancy, we introduce the notation τjπjτj\boldsymbol{\tau}_{\mathsf{j}}\cong_{\boldsymbol{\pi}_{\mathsf{j}}}\boldsymbol{\tau}_{\mathsf{j}}^{\prime} to mean that the set of scores on which τj\boldsymbol{\tau}_{\mathsf{j}} and τj\boldsymbol{\tau}_{\mathsf{j}}^{\prime} differ has probability under πj\boldsymbol{\pi}_{\mathsf{j}}; formally, x:τj(x)τj(x)πj(x)=0\sum_{x:\boldsymbol{\tau}_{\mathsf{j}}(x)\neq\boldsymbol{\tau}_{\mathsf{j}}(x)}\boldsymbol{\pi}_{\mathsf{j}}(x)=0. For any distribution πj\boldsymbol{\pi}_{\mathsf{j}}, πj\cong_{\boldsymbol{\pi}_{\mathsf{j}}} is an equivalence relation. Moreover, we see that if τjπjτj\boldsymbol{\tau}_{\mathsf{j}}\cong_{\boldsymbol{\pi}_{\mathsf{j}}}\boldsymbol{\tau}_{\mathsf{j}}^{\prime}, then τj\boldsymbol{\tau}_{\mathsf{j}} and τj\boldsymbol{\tau}_{\mathsf{j}}^{\prime} both provide the same utility for the institution, induce the same outcomes for individuals in group j\mathsf{j}, and have the same selection and true positive rates. Hence, if (τA,τB)(\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{B}}) is an optimal solution to any of MaxUtil\mathtt{MaxUtil}, EqOpt\mathtt{EqOpt}, or DemParity\mathtt{DemParity}, so is any (τA,τB)(\boldsymbol{\tau}_{\mathsf{A}}^{\prime},\boldsymbol{\tau}_{\mathsf{B}}^{\prime}) for which τAπAτA\boldsymbol{\tau}_{\mathsf{A}}\cong_{\boldsymbol{\pi}_{\mathsf{A}}}\boldsymbol{\tau}_{\mathsf{A}}^{\prime} and τBπBτB\boldsymbol{\tau}_{\mathsf{B}}\cong_{\boldsymbol{\pi}_{\mathsf{B}}}\boldsymbol{\tau}_{\mathsf{B}}^{\prime}.

For threshold policies in particular, their equivalence class under πj\cong_{\boldsymbol{\pi}_{\mathsf{j}}} is uniquely determined by the selection rate function,

which denotes the fraction of group j\mathsf{j} which is selected. Indeed, we have the following lemma (proved in Appendix A.1):

It turns out the policies which arise in this away are always optimal in the sense that, for a given loan rate βj\beta_{j}, the threshold policy rπj1(βj)r_{\boldsymbol{\pi}_{\mathsf{j}}}^{-1}(\beta_{j}) is the (essentially unique) policy which maximizes both the institution’s utility and the utility of the group. Defining the group-wise utility,

The map τjrπj1(rπj(τj))\boldsymbol{\tau}_{\mathsf{j}}\mapsto r_{\boldsymbol{\pi}_{\mathsf{j}}}^{-1}(r_{\boldsymbol{\pi}_{\mathsf{j}}}(\boldsymbol{\tau}_{\mathsf{j}})) can be thought of transforming an arbitrary policy τj\boldsymbol{\tau}_{\mathsf{j}} into a threshold policy with the same selection rate. In this language, the above proposition states that this map never reduces institution utility or individual outcomes. We can also show that optimal MaxUtil\mathtt{MaxUtil} and DemParity\mathtt{DemParity} policies are threshold policies, as well as all EqOpt\mathtt{EqOpt} policies under an additional assumption:

Suppose that u(x)\boldsymbol{u}(x) is strictly increasing in xx. Then all optimal MaxUtil\mathtt{MaxUtil} policies (τA,τB)(\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{B}}) satisfy τjπjrπj1(rπj(τj))\boldsymbol{\tau}_{\mathsf{j}}\cong_{\boldsymbol{\pi}_{\mathsf{j}}}r_{\boldsymbol{\pi}_{\mathsf{j}}}^{-1}\left(r_{\boldsymbol{\pi}_{\mathsf{j}}}(\boldsymbol{\tau}_{\mathsf{j}})\right) for j{A,B}\mathsf{j}\in\{\mathsf{A},\mathsf{B}\}. The same holds for all optimal DemParity\mathtt{DemParity} policies, and if in addition u(x)/ρ(x)\boldsymbol{u}(x)/\boldsymbol{\rho}(x) is increasing, the same is true for all optimal EqOpt\mathtt{EqOpt} policies.

To prove proposition 5.1, we invoke the following general lemma which is proved using standard convex analysis arguments (in Appendix A.2):

We now argue Proposition 5.2 for MaxUtil\mathtt{MaxUtil}, as it is a straightforward application of Lemma 5.2. We will prove Proposition 5.2 for DemParity\mathtt{DemParity} and EqOpt\mathtt{EqOpt} separately in Sections 6.1 and 6.2.

MaxUtil\mathtt{MaxUtil} follows from lemma 5.2 with v(x)=u(x)\boldsymbol{v}(x)=\boldsymbol{u}(x), and t=0t=0 and w=0\boldsymbol{w}=\mathbf{0}.

To further our analysis, we now introduce left and right quantile functions, allowing us to specify thresholds in terms of both selection rate and score cutoffs.

For ff supported on [a,b][a,b], we say that ff is left- (resp. right-) differentiable if f(x)\partial_{-}f(x) exists for all x(a,b]x\in(a,b] (resp. +f(y)\partial_{+}f(y) exists for all y[a,b)y\in[a,b)). We now state the fundamental derivative computation which underpins the results to follow:

Let ex\boldsymbol{e}_{x} denote the vector such that ex(x)=1\boldsymbol{e}_{x}(x)=1, and ex(x)=0\boldsymbol{e}_{x}(x^{\prime})=0 for xxx^{\prime}\neq x. Then πjrπj1(β):C\boldsymbol{\pi}_{\mathsf{j}}\circ r_{\boldsymbol{\pi}_{\mathsf{j}}}^{-1}(\beta):\to^{C} is continuous, and has left and right derivatives

The above lemma is proved in Appendix A.3. Moreover, Lemma 5.3 implies that the outcome curve is concave under the assumption that Δ(x)\boldsymbol{\Delta}(x) is monotone:

Recall that a univariate function ff is concave (and finite) on [a,b][a,b] if and only (a) ff is left- and right-differentiable, (b) for all x(a,b)x\in(a,b), f(x)+f(x)\partial_{-}f(x)\geq\partial_{+}f(x) and (c) for any x>yx>y, f(x)+f(y)\partial_{-}f(x)\leq\partial_{+}f(y).

Proofs of Main Theorems

We are now ready to present and prove theorems that characterize the selection rates under fairness constraints, namely DemParity\mathtt{DemParity} and EqOpt\mathtt{EqOpt}. These characterizations are crucial for proving the results in Section 3. Our computations also generalize readily to other linear constraints, in a way that will become clear in Section 6.2.

In this section, we provide a theorem that gives an explicit characterization for the range of selection rates βA\beta_{\mathsf{A}} for A\mathsf{A} when the bank loans according to DemParity\mathtt{DemParity}. Observe that the DemParity\mathtt{DemParity} objective corresponds to solving the following linear program:

Let us introduce the auxiliary variable β:=πA,τA=πB,τB\beta:=\langle\boldsymbol{\pi}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{A}}\rangle=\langle\boldsymbol{\pi}_{\mathsf{B}},\boldsymbol{\tau}_{\mathsf{B}}\rangle corresponding to the selection rate which is held constant across groups, so that all feasible solutions lie on the green DP line in Figure 3. We can then express the following equivalent linear program:

This is equivalent because, for a given β\beta, Proposition 5.2 says that the utility maximizing policies are of the form τj=rπj1(β)\boldsymbol{\tau}_{\mathsf{j}}=r_{\boldsymbol{\pi}_{\mathsf{j}}}^{-1}(\beta). We now prove this:

Noting that rπj(τj)=πj,τjr_{\boldsymbol{\pi}_{\mathsf{j}}}(\boldsymbol{\tau}_{\mathsf{j}})=\langle\boldsymbol{\pi}_{\mathsf{j}},\boldsymbol{\tau}_{\mathsf{j}}\rangle, we see that, by Lemma 5.2, under the special case where v(x)=u(x)\boldsymbol{v}(x)=\boldsymbol{u}(x) and w(x)=1\boldsymbol{w}(x)=1, the optimal solution (τA(β),τB(β))(\boldsymbol{\tau}_{\mathsf{A}}^{*}(\beta),\boldsymbol{\tau}_{\mathsf{B}}^{*}(\beta)) for fixed rπA(τA)=rπB(τB)=βr_{\boldsymbol{\pi}_{\mathsf{A}}}(\boldsymbol{\tau}_{\mathsf{A}})=r_{\boldsymbol{\pi}_{\mathsf{B}}}(\boldsymbol{\tau}_{\mathsf{B}})=\beta can be chosen to coincide with the threshold policies. Optimizing over β\beta, the global optimal must coincide with thresholds.

Hence, any optimal policy is equivalent to the threshold policy τ=(rπA1(β),rπB1(β))\boldsymbol{\tau}=(r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\beta),r_{\boldsymbol{\pi}_{\mathsf{B}}}^{-1}(\beta)), where β\beta solves the following optimization:

We shall show that the above expression is in fact a concave function in β\beta, and hence the set of optimal selection rates can be characterized by first order conditions. This is presented formally in the following theorem:

The set of optimal selection rates β\beta^{*} satisfying (17) forms a continuous interval [βDemParity,βDemParity+][\beta_{\mathtt{DemParity}}^{-},\beta_{\mathtt{DemParity}}^{+}], such that for any β\beta\in, we have

Since u(x)\boldsymbol{u}(x) is non-decreasing in xx, Proposition 5.3 implies that βU((rπA1(β),rπB1(β)))\beta\mapsto\mathcal{U}\left(\left(r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\beta),r_{\boldsymbol{\pi}_{\mathsf{B}}}^{-1}(\beta)\right)\right) is concave in β\beta. Hence, all optimal selection rates β\beta^{*} lie in an interval [β,β+][\beta^{-},\beta^{+}]. To further characterize this interval, let us us compute left- and right-derivatives.

By concavity of U((rπA1(β),rπB1(β)))\mathcal{U}\left(\left(r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\beta),r_{\boldsymbol{\pi}_{\mathsf{B}}}^{-1}(\beta)\right)\right), a positive right derivative at β\beta implies that β<β\beta<\beta^{*} for all β\beta^{*} satisfying (17), and similarly, a negative left derivative at β\beta implies that β>β\beta>\beta^{*} for all β\beta^{*} satisfying (17).

With a result of the above form, we can now easily prove statements such as that in Corollary 3.3 (see appendix C for proofs), by fixing a selection rate of interest (e.g. β0\beta_{0}) and inverting the inequalities in Theorem 6.1 to find the exact population proportions under which, for example, DemParity\mathtt{DemParity} results in a higher selection rate than β0\beta_{0}.

2 𝙴𝚚𝙾𝚙𝚝𝙴𝚚𝙾𝚙𝚝\mathtt{EqOpt} and General Constraints

Next, we will provide a theorem that gives an explicit characterization for the range of selection rates βA\beta_{\mathsf{A}} for A\mathsf{A} when the bank loans according to EqOpt\mathtt{EqOpt}. Observe that the EqOpt\mathtt{EqOpt} objective corresponds to solving the following linear program:

where wj=ρρ,πj\boldsymbol{w}_{\mathsf{j}}=\frac{\boldsymbol{\rho}}{\langle\boldsymbol{\rho},\boldsymbol{\pi}_{\mathsf{j}}\rangle}. This problem is similar to the demographic parity optimization in (17), except for the fact that the constraint includes the weights. Whereas we parameterized demographic parity solutions in terms of the acceptance rate β\beta in equation (17), we will parameterize equation (18) in terms of the true positive rate (TPR), t:=wAπA,τAt:=\langle\boldsymbol{w}_{\mathsf{A}}\circ\boldsymbol{\pi}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{A}}\rangle. Thus, (18) becomes

where tmax=minj{A,B}{πj,wj}t_{\max}=\min_{\mathsf{j}\in\{\mathsf{A},\mathsf{B}\}}\{\langle\boldsymbol{\pi}_{\mathsf{j}},\boldsymbol{w}_{\mathsf{j}}\rangle\} is the largest possible TPR. The magenta EO curve in Figure 3 illustrates that feasible solutions to this optimization problem lie on a curve parametrized by tt. Note that the objective function decouples for j{A,B}\mathsf{j}\in\{\mathsf{A},\mathsf{B}\} for the inner optimization problem,

We apply Lemma 5.2 to the inner optimization in (20) with v(x)=u(x)\boldsymbol{v}(x)=\boldsymbol{u}(x) and w(x)=ρ(x)ρ,πj\boldsymbol{w}(x)=\frac{\boldsymbol{\rho}(x)}{\langle\boldsymbol{\rho},\boldsymbol{\pi}_{\mathsf{j}}\rangle}. The claim follows from the assumption that u(x)/ρ(x)\boldsymbol{u}(x)/\boldsymbol{\rho}(x) is increasing by optimizing over tt. ∎

This selection rate βj\beta_{\mathsf{j}} is uniquely determined by the TPR tt (proof appears in Appendix B.1):

Suppose that w(x)>0\boldsymbol{w}(x)>0 for all xx. Then the function

is a bijection from $toto[0,\langle\boldsymbol{\pi}_{\mathsf{j}},\boldsymbol{w}\rangle]$.

Hence, for any t[0,tmax]t\in[0,t_{\max}], the mapping from TPR to acceptance rate, Tj,wj1(t)T_{{}_{\mathsf{j}},\boldsymbol{w}_{\mathsf{j}}}^{-1}(t), is well defined and any solution to (20) is πj\boldsymbol{\pi}_{\mathsf{j}}-a.e. equal to the policy rπj1(Tj,wj1(t))r_{\boldsymbol{\pi}_{\mathsf{j}}}^{-1}(T_{{}_{\mathsf{j}},\boldsymbol{w}_{\mathsf{j}}}^{-1}(t)). Thus (19) reduces to

The above expression parametrizes the optimization problem in terms of a single variable. We shall show that the above expression is in fact a concave function in tt, and hence the set of optimal selection rates can be characterized by first order conditions. This is presented formally in the following theorem:

The set of optimal selection rates β\beta^{*} for group A\mathsf{A} satsifying (19) forms a continuous interval [βEqOpt,βEqOpt+][\beta_{\mathtt{EqOpt}}^{-},\beta_{\mathtt{EqOpt}}^{+}], such that for any β\beta\in, we have

Here, Gw(AB)(β):=TB,wB1(TA,wA1(β))G^{(\mathsf{A}\to\mathsf{B})}_{\boldsymbol{w}}(\beta):=T_{\mathsf{B},\boldsymbol{w}_{\mathsf{B}}}^{-1}(T_{\mathsf{A},\boldsymbol{w}_{\mathsf{A}}}^{-1}(\beta)) denotes the (well-defined) map from selection rates βA\beta_{\mathsf{A}} for A\mathsf{A} to the selection rate βB\beta_{\mathsf{B}} for B\mathsf{B} such that the policies τA:=rπA1(βA)\boldsymbol{\tau}_{\mathsf{A}}^{*}:=r_{\boldsymbol{\pi}_{\mathsf{A}}}^{-1}(\beta_{\mathsf{A}}) and τB:=rπB1(βB)\boldsymbol{\tau}_{\mathsf{B}}^{*}:=r_{\boldsymbol{\pi}_{\mathsf{B}}}^{-1}(\beta_{\mathsf{B}}) satisfy the constraint in (18).

Starting with the equivalent problem in (21), we use the concavity result of Lemma B.1. Because the objective function is the positive weighted sum of two concave functions, it is also concave. Hence, all optimal true positive rates tt^{*} lie in an interval [t,t+][t^{-},t^{+}]. To further characterize [t,t+][t^{-},t^{+}], we can compute left- and right-derivatives, again using the result of Lemma B.1.

By concavity, a positive right derivative at tt implies that t<tt<t^{*} for all tt^{*} satisfying (21), and similarly, a negative left derivative at tt implies that t>tt>t^{*} for all tt^{*} satisfying (21).

Finally, by Lemma 6.1, this interval in tt uniquely characterizes an interval of acceptance rates. Thus we translate directly into a statement about the selection rates β\beta for group A\mathsf{A} by seeing that TA,wA1(t)=βT_{{}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}}^{-1}(t)=\beta and TB,wB1(t)=Gw(AB)(β)T_{{}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}}^{-1}(t)=G^{(\mathsf{A}\to\mathsf{B})}_{\boldsymbol{w}}(\beta). ∎

Lastly, we remark that the results derived in this section go through verbatim for any linear constraint of the form w,πAτA=w,πBτB\langle\boldsymbol{w},\boldsymbol{\pi}_{\mathsf{A}}\circ\boldsymbol{\tau}_{\mathsf{A}}\rangle=\langle\boldsymbol{w},\boldsymbol{\pi}_{\mathsf{B}}\circ\boldsymbol{\tau}_{\mathsf{B}}\rangle, as long as u(x)/w(x)\boldsymbol{u}(x)/\boldsymbol{w}(x) is increasing in xx, and w(x)>0\boldsymbol{w}(x)>0.

Simulations

We examine the outcomes induced by fairness constraints in the context of FICO scores for two race groups. FICO scores are a proprietary classifier widely used in the United States to predict credit worthiness. Our FICO data is based on a sample of 301,536 TransUnion TransRisk scores from 2003 (US Federal Reserve, 2007), preprocessed by Hardt et al. (2016). These scores, corresponding to xx in our model, range from 300 to 850 and are meant to predict credit risk. Empirical data labeled by race allows us to estimate the distributions πj\pi_{\mathsf{j}}, where j\mathsf{j} represents race, which is restricted to two values: white non-Hispanic (labeled “white” in figures), and black. Using national demographic data, we set the population proportions to be 18%18\% and 82%82\%.

Individuals were labeled as defaulted if they failed to pay a debt for at least 90 days on at least one account in the ensuing 18-24 month period; we use this data to estimate the success probability given score, ρj(x)\boldsymbol{\rho}_{\mathsf{j}}(x), which we allow to vary by group to match the empirical data (see Figure 4). Our outcome curve framework allows for this relaxation; however, this discrepancy can also be attributed to group-dependent mismeasurement of score, and adjusting the scores accordingly would allow for a single ρ(x)\boldsymbol{\rho}(x). We use the success probabilities to define the affine utility and score change functions defined in Example 2.1. We model individual penalties as a score drop of c=150c_{-}=-150 in the case of a default, and in increase of c+=75c_{+}=75 in the case of successful repayment.

In Figure 5, we display the empirical CDFs along with selection rates resulting from different loaning strategies for two different settings of bank utilities. In the case that the bank experiences a loss/profit ratio of uu+=10\frac{u_{-}}{u_{+}}=-10, no fairness criteria surpass the active harm rate β0\beta_{0}; however, in the case of uu+=4\frac{u_{-}}{u_{+}}=-4, DemParity\mathtt{DemParity} overloans, in line with the statement in Corollary 3.3.

These results are further examined in Figure 6, which displays the normalized outcome curves and the utility curves for both the white and the black group. To plot the MaxUtil\mathtt{MaxUtil} utility curves, the group that is not on display has selection rate fixed at βMaxUtil\beta^{\mathtt{MaxUtil}}. In this figure, the top panel corresponds to the average change in credit scores for each group under different loaning rates β\beta; the bottom panels shows the corresponding total utility U\mathcal{U} (summed over both groups and weighted by group population sizes) for the bank.

Figure 6 highlights that the position of the utility optima in the lower panel determines the loan (selection) rates. In this specific instance, the utility and change ratios are fairly close, uu+=4\frac{u_{-}}{u_{+}}=-4, and cc+=2\frac{c_{-}}{c_{+}}=-2, meaning that the bank’s profit motivations align with individual outcomes to some extent. Here, we can see that EqOpt\mathtt{EqOpt} loans much closer to optimal than DemParity\mathtt{DemParity}, similar to the setting suggested by Corollary 3.2.

Although one might hope for decisions made under fairness constraints to positively affect the black group, we observe the opposite behavior. The MaxUtil\mathtt{MaxUtil} policy (solid orange line) and the EqOpt\mathtt{EqOpt} policy result in similar expected credit score change for the black group. However, DemParity\mathtt{DemParity} (dashed green line) causes a negative expected credit score change in the black group, corresponding to active harm. For the white group, the bank utility curve has almost the same shape under the fairness criteria as it does under MaxUtil\mathtt{MaxUtil}, the main difference being that fairness criteria lowers the total expected profit from this group.

This behavior stems from a discrepancy in the outcome and profit curves for each population. While incentives for the bank and positive results for individuals are somewhat aligned for the majority group, under fairness constraints, they are more heavily misaligned in the minority group, as seen in graphs (left) in Figure 6. We remark that in other settings where the unconstrained profit maximization is misaligned with individual outcomes (e.g., when uu+=10\frac{u_{-}}{u_{+}}=-10), fairness criteria may perform more favorably for the minority group by pulling the utility curve into a shape consistent with the outcome curve.

By analyzing the resulting affects of MaxUtil\mathtt{MaxUtil}, DemParity\mathtt{DemParity}, and EqOpt\mathtt{EqOpt} on actual credit score lending data, we show the applicability of our model to real-world applications. In particular, some results shown in Section 3 hold empirically for the FICO TransUnion TransRisk scores.

Conclusion and Future Work

We argue that without a careful model of delayed outcomes, we cannot foresee the impact a fairness criterion would have if enforced as a constraint on a classification system. However, if such an accurate outcome model is available, we show that there are more direct ways to optimize for positive outcomes than via existing fairness criteria.

Our formal framework exposes a concise, yet expressive way to model outcomes via the expected change in a variable of interest caused by an institutional decision. This leads to the natural concept of an outcome curve that allows us to interpret and compare solutions effectively. In essence, the formalism we propose requires us to understand the two-variable causal mechanism that translates decisions to outcomes. Depending on the application, such an understanding might necessitate greater domain knowledge and additional research into the specifics of the application. This is consistent with much scholarship that points to the context-sensitive nature of fairness in machine learning.

An interesting direction for future work is to consider other characteristics of impact beyond the change in population mean. Variance and individual-level outcomes are natural and important considerations. Moreover, it would be interesting to understand the robustness of outcome optimization to modeling and measurement errors.

Acknowledgements

We thank Lily Hu, Aaron Roth, and Cathy O’Neil for discussions and feedback on an earlier version of the manuscript. We thank the students of CS294: Fairness in Machine Learning (Fall 2017, University of California, Berkeley) for inspiring class discussions and comments on a presentation that was a precursor of this work. This material is based upon work supported by the National Science Foundation Graduate Research Fellowship under Grant No. DGE 1752814.

References

Appendix A Optimality of Threshold Policies

We begin with the first statement of the lemma. Suppose τjπjτj\boldsymbol{\tau}_{\mathsf{j}}\cong_{\boldsymbol{\pi}_{\mathsf{j}}}\boldsymbol{\tau}_{\mathsf{j}}^{\prime}. Then there exists a set SX\mathcal{S}\subset\mathcal{X} such that πj(x)=0\boldsymbol{\pi}_{\mathsf{j}}(x)=0 for all xSx\in\mathcal{S}, and for all xSx\notin\mathcal{S}, τj(x)=τj(x)\boldsymbol{\tau}_{\mathsf{j}}(x)=\boldsymbol{\tau}_{\mathsf{j}}^{\prime}(x). Thus,

Conversely, suppose that rπj(τj)=rπj(τj)r_{\boldsymbol{\pi}_{\mathsf{j}}}(\boldsymbol{\tau}_{\mathsf{j}})=r_{\boldsymbol{\pi}_{\mathsf{j}}}(\boldsymbol{\tau}_{\mathsf{j}}^{\prime}). Let τj=τc,γ\boldsymbol{\tau}_{\mathsf{j}}=\boldsymbol{\tau}_{c,\gamma} and τj=τc,γ\boldsymbol{\tau}_{\mathsf{j}}^{\prime}=\boldsymbol{\tau}_{c^{\prime},\gamma^{\prime}} as in Definition 5.1. We now have the following cases:

Case 1: c=cc=c^{\prime}. Then τj(x)=τj(x)\boldsymbol{\tau}_{\mathsf{j}}(x)=\boldsymbol{\tau}_{\mathsf{j}}^{\prime}(x) for all xX{c}x\in\mathcal{X}-\{c\}. Hence,

This implies that either τj(c)=τj(c)\boldsymbol{\tau}_{\mathsf{j}}(c)=\boldsymbol{\tau}_{\mathsf{j}}^{\prime}(c), and thus τj(x)=τj(x)\boldsymbol{\tau}_{\mathsf{j}}(x)=\boldsymbol{\tau}_{\mathsf{j}}^{\prime}(x) for all xXx\in\mathcal{X}, or otherwise π(c)=0\boldsymbol{\pi}(c)=0, in which case we still have τjπjτj\boldsymbol{\tau}_{\mathsf{j}}\cong_{\boldsymbol{\pi}_{\mathsf{j}}}\boldsymbol{\tau}_{\mathsf{j}}^{\prime} (since the two policies agree every outside the set {c}\{c\}).

Case 2: ccc\neq c^{\prime}. We assume assume without loss of generality that c<cCc^{\prime}<c\leq C. Since the policies τc,1\boldsymbol{\tau}_{c^{\prime},1} and τc+1,0\boldsymbol{\tau}_{c^{\prime}+1,0} are identity for c<Cc^{\prime}<C, we may also assume without loss of generality that γ[0,1)\gamma^{\prime}\in[0,1). Thus for all xS:={c,c+1,,C}x\in\mathcal{S}:=\{c^{\prime},c^{\prime}+1,\dots,C\}, we have τj(x)<τj(x)\boldsymbol{\tau}_{\mathsf{j}}^{\prime}(x)<\boldsymbol{\tau}_{\mathsf{j}}(x). This implies that

Since minxS(τj(c)τj(x))>0\min_{x\in\mathcal{S}}(\boldsymbol{\tau}_{\mathsf{j}}(c)-\boldsymbol{\tau}_{\mathsf{j}}^{\prime}(x))>0, it follows that xSπj(x)=0\sum_{x\in\mathcal{S}}\boldsymbol{\pi}_{\mathsf{j}}(x)=0, whence τjπjτj\boldsymbol{\tau}_{\mathsf{j}}\cong_{\boldsymbol{\pi}_{\mathsf{j}}}\boldsymbol{\tau}_{\mathsf{j}}^{\prime}.

A.2 Proof of Lemma 5.2

Now τ(x)\boldsymbol{\tau}_{*}(x) is not necessarily a threshold policy. To conclude the theorem, it suffices to exhibit a threshold policy τ~\widetilde{\boldsymbol{\tau}}_{*} such that τ(x)πτ~\boldsymbol{\tau}_{*}(x)\cong_{\boldsymbol{\pi}}\widetilde{\boldsymbol{\tau}}_{*}. (Note that τ~(x)\widetilde{\boldsymbol{\tau}}_{*}(x) will also be feasible for the constraint, and have the same objective value; hence τ~\widetilde{\boldsymbol{\tau}}_{*} will be optimal as well.)

Given τ\boldsymbol{\tau}_{*} and λ^\widehat{\lambda}, let c=min{cX:v(x)+λ^w(x)0}c_{*}=\min\{c\in\mathcal{X}:\boldsymbol{v}(x)+\widehat{\lambda}\boldsymbol{w}(x)\geq 0\}. If either (a) w(x)=0\boldsymbol{w}(x)=0 for all xXx\in\mathcal{X} and v(x)\boldsymbol{v}(x) is strictly increasing or (b) v(x)/w(x)\boldsymbol{v}(x)/\boldsymbol{w}(x) is strictly increasing, then the modified policy

is a threshold policy, and τ(x)πτ~\boldsymbol{\tau}_{*}(x)\cong_{\boldsymbol{\pi}}\widetilde{\boldsymbol{\tau}}_{*}. Moreover, w,τ~=w,τ~\langle\boldsymbol{w},\widetilde{\boldsymbol{\tau}}_{*}\rangle=\langle\boldsymbol{w},\widetilde{\boldsymbol{\tau}}_{*}\rangle and π,τ~=π,τ~\langle\boldsymbol{\pi},\widetilde{\boldsymbol{\tau}}_{*}\rangle=\langle\boldsymbol{\pi},\widetilde{\boldsymbol{\tau}}_{*}\rangle, which implies that τ~\widetilde{\boldsymbol{\tau}}_{*} is an optimal policy for the objective in Lemma 5.2.

A.3 Proof of Lemma 5.3

Appendix B Characterization of Fairness Solutions

In this section, we prove Lemma 6.1, which we recall below. See 6.1 We will prove Lemma 6.1 in tandem with the following derivative computation which we applied in the proof of Theorem 6.2.

is concave in tt and has left and right derivatives

B.2 Characterizations Under Soft Constraints

where wA\boldsymbol{w}_{\mathsf{A}} and wB\boldsymbol{w}_{\mathsf{B}} represent generic constraints. Again, we shall assume that for j{A,B}\mathsf{j}\in\{\mathsf{A},\mathsf{B}\}, u(x)/wj(x)\boldsymbol{u}(x)/\boldsymbol{w}_{\mathsf{j}}(x) is non-decreasing. Recall that for wj=(1,1,,1)\boldsymbol{w}_{\mathsf{j}}=(1,1,\dots,1), one recovers the soft version of DemParity\mathtt{DemParity}, whereas for wj=ρρ,πj\boldsymbol{w}_{\mathsf{j}}=\frac{\boldsymbol{\rho}}{\langle\boldsymbol{\rho},\boldsymbol{\pi}_{\mathsf{j}}\rangle}, one recovers the soft constrained version of EqOpt\mathtt{EqOpt}.

The same argument presented in Section 6.2 shows that the optimal policies are of the form

where (tA,tB)(t_{\mathsf{A}},t_{\mathsf{B}}) are solutions to the following optimization problem:

The following lemma gives us a first order characterization of these optimal TPRs, (tA,tB)(t_{\mathsf{A}},t_{\mathsf{B}}).

All optimal policies are equivalent to threshold policies with selection rate (βA,βB)(\beta_{\mathsf{A}},\beta_{\mathsf{B}}) which satisfy

where Δ=tAtB=TA,wA(βA)TB,wB(βB)\Delta=t_{\mathsf{A}}-t_{\mathsf{B}}=T_{{}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}}(\beta_{\mathsf{A}})-T_{{}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}}(\beta_{\mathsf{B}}).

Let ()\partial(\cdot) denote the super-gradient set of a concave function. Note that if FF is left-and-right differentiable and concave, then F(x)=[+F(x),F(x)]\partial F(x)=[\partial_{+}F(x),\partial_{-}F(x)]. By concavity of Uj\mathcal{U}_{\mathsf{j}} and convexity of Φ\Phi, we must have that

Substituting Δ=tAtB=TA,wA(βA)TB,wB(βB)\Delta=t_{\mathsf{A}}-t_{\mathsf{B}}=T_{{}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}}(\beta_{\mathsf{A}})-T_{{}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}}(\beta_{\mathsf{B}}) concludes the proof. ∎

In general, a closed form solution for the soft constrained problem may be difficult to state. However, for the case of Φ(t)=t\Phi(t)=|t|, we can state an explicit closed form solution:

Let Φ(t)=t\Phi(t)=|t|, fix λ\lambda, and let [βAλ,,βAλ,+][\beta_{\mathsf{A}}^{\lambda,-},\beta_{\mathsf{A}}^{\lambda,+}] denote the interval of optimal selection rates for Equation (27) with regularization λ\lambda. Finally, suppose that for any optimal MaxUtil\mathtt{MaxUtil} selection rates (βAMaxUtil,βBMaxUtil)(\beta_{\mathsf{A}}^{\mathtt{MaxUtil}},\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}), one has TA,wA(βAMaxUtil)<TB,wB(βBMaxUtil)T_{{}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}}(\beta_{\mathsf{A}}^{\mathtt{MaxUtil}})<T_{{}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}}(\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}). Let [βA,βA+][\beta_{\mathsf{A}}^{-},\beta_{\mathsf{A}}^{+}] denote the optimal loan rates in (27). Then there exists a λ\lambda_{*} such that, for λλ\lambda\geq\lambda_{*}, [βA,βA+][\beta_{\mathsf{A}}^{-},\beta_{\mathsf{A}}^{+}] coincides with the hard constrained solution. Moreover, for λ<λ\lambda<\lambda_{*}, any β\beta\in satifies

Given a set of optimal constraint values (tA,tB)=(TA,wA(βA),TB,wB(βB))(t_{\mathsf{A}},t_{\mathsf{B}})=(T_{{}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}}(\beta_{\mathsf{A}}),T_{{}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}}(\beta_{\mathsf{B}})) for optimal selection rates (βA,βB)(\beta_{\mathsf{A}},\beta_{\mathsf{B}}) for a given parameter λ\lambda. By Proposition B.2 below, it follows that if tA=tBt_{\mathsf{A}}=t_{\mathsf{B}} for all optimal solutions, then for all λλ\lambda^{\prime}\geq\lambda, all optimal solutions must also have tA=tBt_{\mathsf{A}}=t_{\mathsf{B}}.

Hence, it suffices to show that (a) there exists a finite λ\lambda such that all solutions must have tA=tBt_{\mathsf{A}}=t_{\mathsf{B}}, and (b) if tAtBt_{\mathsf{A}}\neq t_{\mathsf{B}}, then the display in (B.1) holds.

To prove (a) and (b), suppose tAtBt_{\mathsf{A}}\neq t_{\mathsf{B}}. By Proposition B.2 below and the fact that TA,wA(βMaxUtil)<TB,wB(βBMaxUtil)T_{{}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}}(\beta^{\mathtt{MaxUtil}})<T_{{}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}}(\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}), we have tA<tBt_{\mathsf{A}}<t_{\mathsf{B}}. Moreover we can compute that

it follows from the first order condition in Lemma B.2 that, if tAtBt_{\mathsf{A}}\neq t_{\mathsf{B}}

which immediately implies point (b). Point (a) follows from the above display by noting that, since wj(x)>0\boldsymbol{w}_{\mathsf{j}}(x)>0 and u(x)<\boldsymbol{u}(x)<\infty for all xx, where exists a λ\lambda sufficiently large such that (29) cannot hold for any βA\beta_{\mathsf{A}}. ∎

B.3 Qualitative Behavior of Soft Constraints

We now present a proposition which formalizes the intuition that soft constraints interpolate between MaxUtil\mathtt{MaxUtil} and the general hard constraint (18) in Section 6.2 (for arbitrary w\boldsymbol{w}, not just for EqOpt\mathtt{EqOpt}). Because optimal policies may not be unique, we define the solution sets

with the set P()\mathbf{P}(\infty) denoting the set of solutions to (18).

At a high level, we parameterize the soft constrained solution in terms of the value of the constraint tA=τA,wAπAt_{\mathsf{A}}=\langle\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}\circ\boldsymbol{\pi}_{\mathsf{A}}\rangle for A\mathsf{A} and the difference in constraint values Δ=τA,wAπAτB,wBπB\Delta=\langle\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{w}_{\mathsf{A}}\circ\boldsymbol{\pi}_{\mathsf{A}}\rangle-\langle\boldsymbol{\tau}_{\mathsf{B}},\boldsymbol{w}_{\mathsf{B}}\circ\boldsymbol{\pi}_{\mathsf{B}}\rangle, where (τA,τB)P(λ)(\boldsymbol{\tau}_{\mathsf{A}},\boldsymbol{\tau}_{\mathsf{B}})\in\mathbf{P}(\lambda). We show that tAt_{\mathsf{A}} interpolates between the value of the constraint on A\mathsf{A} at λ=0\lambda=0 and at λ=\lambda=\infty, and that Δ\Delta interpolates between the difference at λ=0\lambda=0 (MaxUtil\mathtt{MaxUtil}) and at Δ=0\Delta=0 at λ=\lambda=\infty. To be rigorous, we note that the possible values for tAt_{\mathsf{A}} and Δ\Delta for each λ\lambda are actually contiguous intervals. Hence, to make the interpolation precise, we define the following partial order on such intervals:

Let S1,S2\mathcal{S}_{1},\mathcal{S}_{2} be two intervals. We say that S1  S2\mathcal{S}_{1}~{}\prec~{}\mathcal{S}_{2} if max {xS1 }<min {xS2}\max~{}\{x\in\mathcal{S}_{1}~{}\}<\min~{}\{x\in\mathcal{S}_{2}\} and S1  S2\mathcal{S}_{1}~{}\preceq~{}\mathcal{S}_{2} if both max {xS1}  max {xS2}\max~{}\{x\in\mathcal{S}_{1}\}~{}\leq~{}\max~{}\{x\in\mathcal{S}_{2}\} and min{xS1}  min {xS2}\min\{x\in\mathcal{S}_{1}\}~{}\leq~{}\min~{}\{x\in\mathcal{S}_{2}\}. We say that an interval-valued function S(λ)\mathcal{S}(\lambda) is non-decreasing (resp. non increasing) in λ\lambda if S(λ)  S(λ)\mathcal{S}(\lambda)~{}\preceq~{}\mathcal{S}(\lambda^{\prime}) (resp S(λ)  S(λ)\mathcal{S}(\lambda^{\prime})~{}\preceq~{}\mathcal{S}(\lambda^{\prime}) for λ  λ\lambda~{}\leq~{}\lambda^{\prime}).

In these terms, the interpolation of the soft constraints can be stated as follows:

Let Φ(t)\Phi(t) be a convex, symmetric convex function with Φ(t)>0\Phi(t)>0 for t>0t>0. Then the sets

In all cases, limλmax{ΔD(λ)}=0\lim_{\lambda\to\infty}\max\{|\Delta|\in\mathcal{D}(\lambda)\}=0.

If 0D(λ)0\in\mathcal{D}(\lambda), then there exists a MaxUtil\mathtt{MaxUtil} solution satisfying (18). Thus, for all λ>0\lambda>0, P(λ)=P()\mathbf{P}(\lambda)=\mathbf{P}(\infty).

If D(λ){0}\mathcal{D}(\lambda)\prec\{0\}, then D(λ)\mathcal{D}(\lambda) and TA(λ)\mathcal{T}_{\mathsf{A}}(\lambda) are non-decreasing on λ(0,]\lambda\in(0,\infty], and vice versa if D(λ){0}\mathcal{D}(\lambda)\succ\{0\}.

If D(λ){0}\mathcal{D}(\lambda)\prec\{0\}, then {0}=D()D(λ){min:ΔD(0)}\{0\}=\mathcal{D}(\infty)\succeq\mathcal{D}(\lambda)\succeq\{\min:\Delta\in\mathcal{D}(0)\}, and TA()TA(λ){min:ΔTA(λ)}\mathcal{T}_{\mathsf{A}}(\infty)\succeq\mathcal{T}_{\mathsf{A}}(\lambda)\succeq\{\min:\Delta\in\mathcal{T}_{\mathsf{A}}(\lambda)\}, and vice versa if D(λ){0}\mathcal{D}(\lambda)\succ\{0\}.

Again, we parameterize all solutions to the soft-constrained problem as in correspondence with solutions (tA,tB)(t_{\mathsf{A}},t_{\mathsf{B}}) to

Letting Δ:=tBtA\Delta:=t_{\mathsf{B}}-t_{\mathsf{A}}, we can reparameterize the above as

Note then that D(λ)\mathcal{D}(\lambda) denotes the set of Δ\Delta which are partial maximimizers of the above display. If 0{D(λ)}0\in\{\mathcal{D}(\lambda)\}, this implies that there exists a MaxUtil\mathtt{MaxUtil} solution for which Δ=0\Delta=0, therefore, for all λ>0\lambda>0, all solutions will be MaxUtil\mathtt{MaxUtil} solutions for which D(λ)=0\mathcal{D}(\lambda)=0. Otherwise assume without loss of generality that D(λ)<{0}\mathcal{D}(\lambda)<\{0\}.

First, the statement {0}=D()D(λ){min:ΔD(0)}\{0\}=\mathcal{D}(\infty)\succeq\mathcal{D}(\lambda)\succeq\{\min:\Delta\in\mathcal{D}(0)\}, and TA()TA(λ){min:ΔTA(λ)}\mathcal{T}_{\mathsf{A}}(\infty)\succeq\mathcal{T}_{\mathsf{A}}(\lambda)\succeq\{\min:\Delta\in\mathcal{T}_{\mathsf{A}}(\lambda)\}, and vice versa if D(λ){0}\mathcal{D}(\lambda)\succ\{0\} can be solved by on a case-by-case basis. The strategy is to show that if any of these inequalities are violated, then the associated values of Δ\Delta and tAt_{\mathsf{A}} are not partial maximizers of the soft constraint objective. In particular, TA(λ)[T,T+]\mathcal{T}_{\mathsf{A}}(\lambda)\subset[T_{-},T_{+}] for some appropriate T,T+T_{-},T_{+}.

We now show that D(λ)\mathcal{D}(\lambda) and TA(λ)\mathcal{T}_{\mathsf{A}}(\lambda) are non-increasing and non-decreasing, respectively. We shall do so invoking the following technical lemma.

Let G1(t)G_{1}(t) be concave and let G2(t;λ)G_{2}(t;\lambda) be concave in tt. Let G2(t;λ)\partial G_{2}(t;\lambda) denote the super-gradient of G2G_{2}, that is

denotes the super-gradient set of the concave mapping tG2(t;λ)t\mapsto\partial G_{2}(t;\lambda).

Then if λG2(t;λ)\lambda\mapsto\partial G_{2}(t;\lambda) is non-increasing (resp. non-decreasing) in λ\lambda, the interval valued function defined below is non-increasing (resp. non-decreasing) in λ\lambda

For D(λ)\mathcal{D}(\lambda), one can write any partial maximizer Δ\Delta as

with G1(Δ)=maxtAgAUA(tA;wA)+gBUB(tA+Δ;wB)G_{1}(\Delta)=\max_{t_{\mathsf{A}}}g_{\mathsf{A}}\mathcal{U}_{\mathsf{A}}(t_{\mathsf{A}};\boldsymbol{w}_{\mathsf{A}})+g_{\mathsf{B}}\mathcal{U}_{\mathsf{B}}(t_{\mathsf{A}}+\Delta;\boldsymbol{w}_{\mathsf{B}}) and G2(Δ;λ)=λΦ(Δ)G_{2}(\Delta;\lambda)=\lambda\Phi(\Delta). Note that G1(Δ)G_{1}(\Delta) is concave, being the partial maximization of a concave function, and G2(Δ;λ)=tΦ(Δ)\partial G_{2}(\Delta;\lambda)=-t\partial\Phi(\Delta). Since Φ(Δ){0}\partial\Phi(\Delta)\succeq\{0\} for Δ0\Delta\geq 0 (by convexity of ϕ\phi) , we have that G2(Δ;λ)=tΦ(Δ)\partial G_{2}(\Delta;\lambda)=-t\partial\Phi(\Delta) is non-increasing in λ\lambda. Hence Lemma B.3 implies that interval valued function D(λ)\mathcal{D}(\lambda) is non-increasing.

To show that TA(λ)\mathcal{T}_{\mathsf{A}}(\lambda) is non-decreasing, we have that any maximizer tAt_{\mathsf{A}} can be written as

where G1(tA)=gAUA(tA;wA)G_{1}(t_{\mathsf{A}})=g_{\mathsf{A}}\mathcal{U}_{\mathsf{A}}(t_{\mathsf{A}};\boldsymbol{w}_{\mathsf{A}}) and G2(tA;λ)=maxΔ0gBUB(tA+Δ;wB)+λΦ(Δ)G_{2}(t_{\mathsf{A}};\lambda)=\max_{\Delta\geq 0}g_{\mathsf{B}}\mathcal{U}_{\mathsf{B}}(t_{\mathsf{A}}+\Delta;\boldsymbol{w}_{\mathsf{B}})+\lambda\Phi(\Delta). By Danskin’s theorem,

Note that {ΔargmaxG2(tA;λ)}\{\Delta\in\arg\max G_{2}(t_{\mathsf{A}};\lambda)\} is non-increasing in λ\lambda for a fixed tAt_{\mathsf{A}}, since the contribution of the regularizer increases. Since the sets UB(tA+Δ;wB)\partial\mathcal{U}_{\mathsf{B}}(t_{\mathsf{A}}+\Delta;\boldsymbol{w}_{\mathsf{B}}) are themselves non-increasing in Δ\Delta by concavity, we conclude that G2(tA;λ)\partial G_{2}(t_{\mathsf{A}};\lambda) is non-decreasing in λ\lambda. Hence, Lemma B.3 implies that TA(λ)\mathcal{T}_{\mathsf{A}}(\lambda) is non-decreasing in λ\lambda.

Finally, to show that max{Δ:ΔD(λ)}0\max\{|\Delta|:\Delta\in\mathcal{D}(\lambda)|\}\to 0, Note that the left and right derivatives of gAUA(t;wA)g_{\mathsf{A}}\mathcal{U}_{\mathsf{A}}(t;\boldsymbol{w}_{\mathsf{A}}) and gBUB(t;wB)g_{\mathsf{B}}\mathcal{U}_{\mathsf{B}}(t;\boldsymbol{w}_{\mathsf{B}}) are upper bounded by MM whereas, since Φ\Phi is strictly convex, we know that for every ϵ>0\epsilon>0, min{+Φ(Δ),Φ(Δ)}>m(ϵ)\min\{|\partial_{+}\Phi(\Delta)|,|\partial_{-}\Phi(\Delta)|\}>m(\epsilon) for all Δ:Δ>ϵ\Delta:|\Delta|>\epsilon. Hence, the first order optimality conditions cannot be satisfied for Δ>ϵ|\Delta|>\epsilon, and λ>Mm(ϵ)\lambda>\frac{M}{m(\epsilon)}, so as λ\lambda\to\infty, Δ0|\Delta|\to 0.

We prove the case where G2(t;λ)\partial G_{2}(t;\lambda) is non-increasing. The first order conditions requires that at an optimal tt, one has

By assumption, G2(t;λ)+0G2(t;λ)+\partial_{-}G_{2}(t;\lambda^{\prime})_{+}\leq\partial_{0}G_{2}(t;\lambda)_{+} , which implies

Appendix C Proofs of Main Results

We remark that the proofs in this section rely crucially on the characterizations of the optimal fairness-constrained policies developed in Section 6. We first define the notion of CDF domination, which is referred to in a few of the proofs. Intuitively, it means that for any score, the fraction of group B\mathsf{B} above this is higher than that for group A\mathsf{A}. It is realistic to assume this if we keep with our convention that group A\mathsf{A} is the disadvantaged group relative to group B\mathsf{B}.

πA\boldsymbol{\pi}_{\mathsf{A}} is said to be dominated by πB\boldsymbol{\pi}_{\mathsf{B}} if a1,x>aπA<x>aπB\forall a\geq 1,\sum_{x>a}\boldsymbol{\pi}_{\mathsf{A}}<\sum_{x>a}\boldsymbol{\pi}_{\mathsf{B}}. We denote this as πAπB\boldsymbol{\pi}_{\mathsf{A}}\prec\boldsymbol{\pi}_{\mathsf{B}}.

We remark that the \prec notation in this section is entirely unrelated to the the partial order on intervals from Section B.3. Frequently, we shall use the following lemma:

The MaxUtil\mathtt{MaxUtil} policy for group j\mathsf{j} solves the optimization

Computing left and right derivatives of this objective yields

By concavity, solutions β\beta^{*} satisfy

Therefore, we conclude that the MaxUtil\mathtt{MaxUtil} policy loans only to scores xx s.t. u(x)>0\boldsymbol{u}(x)>0, which implies Δ(x)>0\boldsymbol{\Delta}(x)>0 for all scores loaned to. Therefore we must have that 0ΔμMaxUtil0\leq\Delta\boldsymbol{\mu}^{\mathtt{MaxUtil}}. By definition ΔμMaxUtilΔμ\Delta\boldsymbol{\mu}^{\mathtt{MaxUtil}}\leq\Delta\boldsymbol{\mu}^{*}.

C.2 Proof of Corollary 3.2

We begin with proving part (a), which gives conditions under which DemParity\mathtt{DemParity} cases relative improvement. Recall that β\overline{\beta} is the largest selection rate for which U(β)=U(βAMaxUtil)\mathcal{U}(\overline{\beta})=\mathcal{U}(\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}). First, we derive a condition which bounds the selection rate βADemParity\beta^{\mathtt{DemParity}}_{\mathsf{A}} from below. Fix an acceptance rate β\beta such that βAMaxUtil<β<min{βBMaxUtil,β}\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}<\beta<\min\{\beta_{\mathsf{B}}^{\mathtt{MaxUtil}},\overline{\beta}\}. By Theorem 6.1, we have that DemParity\mathtt{DemParity} selects to group A\mathsf{A} with rate higher than β\beta as long as

Instead, in the case that βBMaxUtil>β\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}>\overline{\beta}, fix β\beta^{\prime} such that β<β<βBMaxUtil\overline{\beta}<\beta^{\prime}<\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}. Then DemParity\mathtt{DemParity} selects group A\mathsf{A} at a rate less than β\beta^{\prime} as long as

By (30) and the monotonicity of u\boldsymbol{u}, 0<g0<g10<g_{0}<g_{1}. Thus for gA[g0,g1]g_{\mathsf{A}}\in[g_{0},g_{1}], the DemParity\mathtt{DemParity} selection rate for group A\mathsf{A} is bounded between β\beta and β\beta^{\prime}, and thus DemParity\mathtt{DemParity} results in relative improvement.

Next, we prove part (b), which gives conditions under which EqOpt\mathtt{EqOpt} cases relative improvement. First, we derive a condition which bounds the selection rate βAEqOpt\beta^{\mathtt{EqOpt}}_{\mathsf{A}} from below. Fix an acceptance rate β\beta such that βAMaxUtil<β\beta_{\mathsf{A}}^{\mathtt{MaxUtil}}<\beta and βBMaxUtil>G(AB)(β)\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}>G^{(\mathsf{A}\to\mathsf{B})}(\beta). By Theorem 6.2, EqOpt\mathtt{EqOpt} selects group A\mathsf{A} at a rate higher than β\beta as long as

In the other case, fix β\beta^{\prime} such that β<β<β\beta<\beta^{\prime}<\overline{\beta} and βBMaxUtil>G(AB)(β)\beta_{\mathsf{B}}^{\mathtt{MaxUtil}}>G^{(\mathsf{A}\to\mathsf{B})}(\beta^{\prime}). By Theorem 6.2, EqOpt\mathtt{EqOpt} selects group A\mathsf{A} at a rate lower than β\beta^{\prime} as long as

By (30) and the monotonicity of u\boldsymbol{u}, 0<g2<g30<g_{2}<g_{3}. Thus for gA[g2,g3]g_{\mathsf{A}}\in[g_{2},g_{3}], the EqOpt\mathtt{EqOpt} selection rate for group A\mathsf{A} is bounded between β\beta and β\beta^{\prime}, and thus EqOpt\mathtt{EqOpt} results in relative improvement.

C.3 Proof of Corollary 3.3

C.4 Proof of Corollary 3.4

C.5 Proof of Corollary 3.5

It remains to check that g1<g2g_{1}<g_{2}. Since we assumed β>x>μAπA\beta>\sum_{x>\boldsymbol{\mu}_{\mathsf{A}}}\boldsymbol{\pi}_{\mathsf{A}}, we may apply Lemma C.2 to verify this.

Thus we indeed have sufficient conditions for βDemParity>β>βEqOpt\beta_{\mathtt{DemParity}}>\beta>\beta_{\mathtt{EqOpt}}. In particular, if β=β0\beta=\beta_{0}, then by the concavity of ΔμA\Delta\boldsymbol{\mu}_{\mathsf{A}}, we have that ΔμA(rπA1(βAEqOpt))>0\Delta\boldsymbol{\mu}_{\mathsf{A}}(r^{-1}_{\boldsymbol{\pi}_{\mathsf{A}}}(\beta^{\mathtt{EqOpt}}_{\mathsf{A}}))>0, that is, EqOpt\mathtt{EqOpt} causes improvement, and ΔμA(rπA1(βADemParity))<0\Delta\boldsymbol{\mu}_{\mathsf{A}}(r^{-1}_{\boldsymbol{\pi}_{\mathsf{A}}}(\beta^{\mathtt{DemParity}}_{\mathsf{A}}))<0, that is, DemParity\mathtt{DemParity} causes active harm.

Lastly, because βDemParity>βEqOpt\beta_{\mathtt{DemParity}}>\beta_{\mathtt{EqOpt}}, it is always true that ΔμA(rπA1(βADemParity))>0    ΔμA(rπA1(βAEqOpt))>0\Delta\boldsymbol{\mu}_{\mathsf{A}}(r^{-1}_{\boldsymbol{\pi}_{\mathsf{A}}}(\beta^{\mathtt{DemParity}}_{\mathsf{A}}))>0\implies\Delta\boldsymbol{\mu}_{\mathsf{A}}(r^{-1}_{\boldsymbol{\pi}_{\mathsf{A}}}(\beta^{\mathtt{EqOpt}}_{\mathsf{A}}))>0, using the concavity of the outcome curve.

Fix β\beta\in. Suppose πA,πB\boldsymbol{\pi}_{\mathsf{A}},\boldsymbol{\pi}_{\mathsf{B}} are identical up to a translation with μA<μB\boldsymbol{\mu}_{\mathsf{A}}<\boldsymbol{\mu}_{\mathsf{B}}. Also assume ρ(x)\boldsymbol{\rho}(x) is affine in xx. Denote κ=ρ,πBρ,πA\kappa=\frac{\langle\boldsymbol{\rho},\boldsymbol{\pi}_{\mathsf{B}}\rangle}{\langle\boldsymbol{\rho},\boldsymbol{\pi}_{\mathsf{A}}\rangle}. Then,

We use the following technical lemma in the proof of the above lemma.

If πA,πB\boldsymbol{\pi}_{\mathsf{A}},\boldsymbol{\pi}_{\mathsf{B}} that are identical up to a translation with μA<μB\boldsymbol{\mu}_{\mathsf{A}}<\boldsymbol{\mu}_{\mathsf{B}}, then

C.6 Proof of Corollary 3.6

Let C=6C=6, and let the utility function be such that u(4)=0\boldsymbol{u}(4)=0. Suppose πA(5)=12ϵ,πA(1)=2ϵ\boldsymbol{\pi}_{\mathsf{A}}(5)=1-2\epsilon,\boldsymbol{\pi}_{\mathsf{A}}(1)=2\epsilon and πB(5)=1ϵ,πB(3)=ϵ\boldsymbol{\pi}_{\mathsf{B}}(5)=1-\epsilon,\boldsymbol{\pi}_{\mathsf{B}}(3)=\epsilon.

C.7 Proof of Proposition 4.1

C.8 Proof of Proposition 4.2

By Proposition 5.3, β=argmaxβΔμA(β)\beta^{*}=\operatornamewithlimits{argmax}_{\beta}\Delta\boldsymbol{\mu}_{\mathsf{A}}(\beta) exists and is unique. β0=max{β[βAMaxUtil,1]:U(βAMaxUtil)UA(β)δ}\beta_{0}=\max\{\beta\in[\beta_{\mathsf{A}}^{\mathtt{MaxUtil}},1]:\mathcal{U}(\beta_{\mathsf{A}}^{\mathtt{MaxUtil}})-\mathcal{U}_{\mathsf{A}}(\beta)\leq\delta\} which exists and is unique, by the continuity of ΔμA\Delta\boldsymbol{\mu}_{\mathsf{A}} and Proposition 5.3.