# Difference between revisions of "Fairness Without Demographics in Repeated Loss Minimization"

Jump to: navigation, search

This page contains the summary of the paper "Fairness Without Demographics in Repeated Loss Minimization" by Hashimoto, T. B., Srivastava, M., Namkoong, H., & Liang, P. which was published at the International Conference of Machine Learning (ICML) in 2018. In the following, an

# Introduction

Usually, machine learning models aim to minimize their average loss in order to achieve high overall accuracy. While this works well for the majority, minority groups suffer high error rates because they contribute less data to the model. This phenomenon is known as representation disparity and has been observed in many models that, for instance, recognize faces, or identify language. This disparity even increases as minority users suffer higher error rates, and therefore, are less likely to use the system in the future. This retention of users from minority groups from the system shrinks these groups further, and provide less data to the system. With less data the disparity becomes even worse - a phenomenon referred to as disparity amplification.

In this paper, Hashimoto et al. first show that empirical risk minimization (ERM) does not control the loss of minority groups, and thus causes representation disparity even if the model has been fair before. Second, the researchers try to mitigate representation disparity and its amplification by proposing the use of distributionally robust optimization (DRO). Indeed Hashimoto et al. are able to show that DRO can bound the loss for minority groups and is fair on models that ERM turns unfair.

### Fairness

Hashimoto et al. follow the difference principle to achieve and measure fairness. It is defined as the maximization of the welfare of the worst-off group rather than the whole group (cf. utilitarianism).

# Representation Disparity

If a user makes a query $Z \sim P$, the model $\theta \in \Theta$ makes a prediction, and the user experiences loss $\ell (\theta; Z)$. The expected loss of of a model $\theta$ is denoted as the risk $\mathcal{R}(\theta) = \mathbb{E}_{Z \sim P} [\ell (\theta; Z)]$. While the queries (i.e. provide data to the model) are made by users from $K$ latent groups such that $Z \sim P := \sum_{k \in [k]} \alpha_kP_k$, neither the actual population proportions $\{\alpha_k\}$ nor the group distributions $\{P_k\}$ are known. Therefore, Hashimoto et al.'s goal is to control the worst-case risk over all groups $K$:

\begin{align} \mathcal{R}_{max}(\theta) := \underset{k \in [k]}{max} \mathcal{R}_k(\theta), \qquad \mathcal{R}_k(\theta) := \mathbb{E}_{P_k} [\ell (\theta; Z)] \end{align}

We say there is high representation disparity if the expected loss of the model $\mathcal{R}(\theta)$ is low, but the worst-case risk $\mathcal{R}_{max}(\theta)$ of one group is high. That is why Hashimot et al. try to minimize $\mathcal{R}_{max}(\theta)$ in the following.

# Disparity Amplification

Representation disparity can amplify as time passes and loss gets minimized. Specifically, over $t = 1, 2, ..., T$ minimization rounds the group proportions $\alpha_k^{(t)}$ vary dependent on past losses. At each round the expected number of users $\lambda_k^{(t+1)}$ from group $k$ is determined by

\begin{align} \lambda_k^{(t+1)} := \lambda_k^{(t)} \nu(\mathcal{R}_k(\theta^{(t)})) + b_k \end{align}

where $\lambda_k^{(t)} \nu(\mathcal{R}_k(\theta^{(t)}))$ describes the fraction of retained users from the previous optimization and $b_k$ is the number of new users of group $k$. To put simply, the number of expected users of a group depend on the number of new users of that group, and the fraction of users that continue to use the system from the previous optimization step. Without the knowledge of population proportions $\alpha_k^{(t)}$, the new user rate $b_k$, and the retention function $\nu$ in practice it is hard, however, to control the worst-case risk over all time periods $\mathcal{R}_{max}^T$ for all groups.

## Empirical Risk Minimization

Since the aforementioned variables are unknown in practice, the standard approach to fit a sequence of models $\theta^{(t)}$ is to empirically approximate them. Using ERM, for instance, the optimal model is approached by minimizing the loss of the model:

\begin{align} \theta^{(t)} = arg min_{\theta \in \Theta} \sum_i \ell(\theta; Z_i^{(t)}) \end{align}

# Distributonally Robust Optimization (DRO)

At this point our goal is to minimize the worst-case group risk over a single time-step $\mathcal{R}_{max} (\theta^{(t)})$. As previously mentioned, this is difficult to do because neither the population proportions $\{\alpha_k\}$ nor group distributions $\{P_k\}$ are known. Therefore, Hashimoto et al. developed an optimization technique that is robust "against all directions around the data generating distribution". This refers to the notion that DRO is robust to any group distribution $P_k$ whose loss other optimization techniques such as ERM might try to optimize. To create this distributionally robustness, the optimizations risk function $\mathcal{R}_{dro}$ has to "up-weigh" data $Z$ that cause high loss $\ell(\theta, Z)$. In other words, the risk function has to over-represent mixture components (i.e. group distributions $\{P_k\}$) in relation to their original mixture weights (i.e. the population proportions $\{\alpha_k\}$) for groups that suffer high loss.

To do this we need to consider the worst-case loss (i.e. the highest risk) over all perturbations $P_k$ around $P$ within a certain limit. This limit is described by the $\chi^2$-divergence (i.e. the distance, roughly speaking) between probability distributions. For two distributions $P$ and $Q$ the divergence is defined as $D_{\chi^2} (P || Q):= \int (\frac{dP}{dQ} - 1)^2$. With the help of the $\chi^2$-divergence, Hashimoto et al. define the chi-squared ball $\mathcal{B}(P,r)$ around the probability distribution P. This ball is defined so that $\mathcal{B}(P,r) := \{Q \ll P : D_{\chi^2} (Q || P) \leq r \}$. It is exactly this ball that gives us the opportunity to consider the worst-case loss (i.e. the highest risk) over all perturbations $P_k$ that lie inside the ball (i.e. within reasonable range) around the probability distribution $P$. This loss is given by

\begin{align} \mathcal{R}_{dro}(\theta, r) := \underset{Q \in \mathcal{B}(P,r)}{sup} \mathbb{E}_Q [\ell(\theta;Z)] \end{align}

which for $P:= \sum_{k \in [K]} \alpha_k P_k$ for all models $\theta \in \Theta$ where $r_k := (1/a_k -1)^2$ bounds the risk $\mathcal{R}_k(\theta) \leq \mathcal{R}_{dro} (\theta; r_k)$ for each group with risk $\mathcal{R}_k(\theta)$. Furthermore, if we specify a lower bound on the group proportions $\alpha_{min} \leq min_{k \in [K]} \alpha_k$, and define $r_{max} := (1/\alpha_{min} -1)^2$, the worst-case risk $\mathcal{R}_{max} (\theta)$ can be controlled by $\mathcal{R}_{dro} (\theta; r_{max})$ by forming an upper bound that can be minimized.

## Optimization of DRO

To minimize $\mathcal{R}_{dro}(\theta, r) := \underset{Q \in \mathcal{B}(P,r)}{sup} \mathbb{E}_Q [\ell(\theta;Z)]$ Hashimoto et al. look at the dual of this maximization problem (i.e. every maximization problem can become transformed into a minimization problem and vice-versa). This dual is given by the minimization problem

\begin{align} \mathcal{R}_{dro}(\theta, r) = \underset{\eta \in \mathbb{R}}{inf} \left\{ F(\theta; \eta):= C\left(\mathbb{E}_P \left[ [\ell(\theta;Z) - \eta]_+^2 \right] \right)^\frac{1}{2} + \eta \right\} \end{align}

with $C = (2(1/a_{min} - 1)^2 + 1)^{1/2}$. $\eta$ describes the dual variable (i.e. the variable that appears in creating the dual). Since $F(\theta; \eta)$ involves an expectation $\mathbb{E}_P$ over the data generating distribution $P$, $F(\theta; \eta)$ can be directly minimized. For convex losses $\ell(\theta;Z)$, $F(\theta; \eta)$ is convex, and can be minimized by performing a binary search over $\eta$. In their paper, Hashimoto et al. further show that optimizing $\mathcal{R}_{dro}(\theta, r_{max})$ at each time step controls the future worst-case risk $\mathcal{R}_{max} (\theta)$, and therefore retention rates. That means if the initial group proportions satisfy $\alpha_k^{(0)} \geq a_{min}$, and $\mathcal{R}_{dro}(\theta, r_{max})$ is optimized for every time step (and therefore $\mathcal{R}_{max} (\theta)$ is minimized), $\mathcal{R}_{max}^T (\theta)$ over all time steps is controlled. In other words, optimizing $\mathcal{R}_{dro}(\theta, r_{max})$ every time step is enough to avoid disparity amplification.