Maximum Weighted Loss Discrepancy
Not on the map. Why?
Abstract (arXiv)
Though machine learning algorithms excel at minimizing the average loss over a population, this might lead to large discrepancies between the losses across groups within the population. To capture this inequality, we introduce and study a notion we call maximum weighted loss discrepancy (MWLD), the maximum (weighted) difference between the loss of a group and the loss of the population. We relate MWLD to group fairness notions and robustness to demographic shifts. We then show MWLD satisfies the following three properties: 1) It is statistically impossible to estimate MWLD when all groups have equal weights. 2) For a particular family of weighting functions, we can estimate MWLD efficiently. 3) MWLD is related to loss variance, a quantity that arises in generalization bounds. We estimate MWLD with different weighting functions on four common datasets from the fairness literature. We finally show that loss variance regularization can halve the loss variance of a classifier and hence reduce MWLD without suffering a significant drop in accuracy.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 5; 2023: 5.
11 papers.
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
- 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervisioncited by 445
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
- 2022On Feature Learning in the Presence of Spurious Correlationscited by 145
- 2022Picking on the Same Person: Does Algorithmic Monoculture lead to Outcome Homogenization?cited by 89
- 2022Subgroup Robustness Grows On Trees: An Empirical Baseline Investigationcited by 17
- 2023Targeted Data Generation: Finding and Fixing Model Weaknessescited by 15
- 2022Simplicity Bias Leads to Amplified Performance Disparitiescited by 11
- 2023Bias Amplification Enhances Minority Group Performancecited by 6
- 2023FERI: A Multitask-based Fairness Achieving Algorithm with Applications to Fair Organ Transplantationcited by 2
- 2023REST: Enhancing Group Robustness in DNNs through Reweighted Sparse Trainingcited by 2
- 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision14 Dec 2023
- 2023REST: Enhancing Group Robustness in DNNs through Reweighted Sparse Training5 Dec 2023
- 2023FERI: A Multitask-based Fairness Achieving Algorithm with Applications to Fair Organ Transplantation20 Oct 2023
- 2023Bias Amplification Enhances Minority Group Performance13 Sep 2023
- 2023Targeted Data Generation: Finding and Fixing Model Weaknesses28 May 2023
- 2022Simplicity Bias Leads to Amplified Performance Disparities13 Dec 2022
- 2022Picking on the Same Person: Does Algorithmic Monoculture lead to Outcome Homogenization?25 Nov 2022
- 2022Subgroup Robustness Grows On Trees: An Empirical Baseline Investigation23 Nov 2022
- 2022On Feature Learning in the Presence of Spurious Correlations20 Oct 2022
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlations6 Apr 2022
- 2021Just Train Twice: Improving Group Robustness without Training Group Information19 Jul 2021