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

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

# Distributonally Robust Optimization (DRO)

## Risk Bounding Over Unknown Groups

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 $\{a_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 fact that this distributionally robust optimization (DRO) is robust to any group distribution $P_k$ of a group $k \in K$ if the population proportion $a_k$ of this group is greater than or equal to the lowest population proportion $a_{min}$ (which is specified in practice). To create this distributionally robustness, the optimizations risk function $\mathcal{R}_{dro}$ has to "up-weigh" data $Z$ that cause high loss $\mathcal{l}(\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 $\{a_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 range $r$. This range $r$ is defined as the radius $r$ of a chi-squared ball $\mathcal{B}(P,r)$ around this probability distribution P. This ball is defined so that