- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces global fairness, a score-level metric that integrates demographic-parity disparities across population acceptance rates. It proposes a smoothed estimator with a consistency guarantee and proves that global accuracy is an affine, strictly increasing function of AUC under certain continuity assumptions. The method is evaluated against six baselines on ACSIncome, Adult, and COMPAS. The authors report improved accuracy-fairness trade-offs, although the extent to which the experiments substantiate this claimed advantage remains an important question.
Critical strengths
- The metric addresses limitations of evaluating fairness at a single threshold.
- The consistency result and relationship between global accuracy and AUC provide useful mathematical interpretation.
Critical weaknesses
- It is unclear whether evaluating Fairlearn's mixture and individual classifiers separately allows for a fair comparison with the other methods.
- The paper does not provide enough evidence to determine whether the results are consistent across random seeds and data splits or whether the baselines are tuned comparably. Also, improvements in overall fairness may hide larger disparities at certain acceptance rates.
Questions for authors
- How are Fairlearn's mixtures and individual classifiers converted into scores for comparison, and how is the accuracy-fairness trade-off evaluated?
- Are the results consistent across different random seeds and data splits, and are the baselines tuned using comparable procedures?
- Do the disparity-versus-acceptance-rate curves show improvements across the full range, or do the overall results hide larger disparities at certain acceptance rates?
5 comments
W2 & Q2: Robustness across random seeds, data splits, and baseline tuning.
We thank the reviewer for raising these important concerns regarding experimental robustness and the comparability of baseline tuning.
Robustness across random seeds and data splits. We clarify that Figures 3 and 4 report results obtained from five random model seeds under a fixed training/validation/test split. To further investigate whether the observed improvements remain consistent across different data splits, we conduct additional experiments on ACS using five independently generated data splits, each with five random model seeds. All methods are evaluated on the same data splits to ensure direct comparability. The results are reported as mean ± standard deviation (SD) over the five model seeds for each data split.
First, the following table reports global accuracy under the global fairness constraint .
Global Accuracy (%) under on ACS (DP):
| Method | Split 0 | Split 1 | Split 2 | Split 3 | Split 4 |
|---|---|---|---|---|---|
| Fairret | 64.07±1.17 | 64.46±0.50 | 65.02±0.23 | 64.17±0.12 | 64.34±0.58 |
| Fairlearn | 65.17±0.48 | 65.17±0.42 | 62.50±2.48 | 63.54±0.43 | 64.67±0.52 |
| Wasserstein-1 | 65.67±0.13 | 64.13±1.83 | 61.69±0.81 | 62.49±1.52 | 64.08±1.93 |
| Ours | 65.80±0.18 | 65.56±0.07 | 65.22±0.17 | 64.58±0.20 | 65.19±0.20 |
As in Figure 2, ERM, FairScore, and Minimax do not achieve the required global fairness level and are therefore excluded from this constrained-accuracy comparison. Our method achieves the highest mean global accuracy across all five data splits while satisfying the specified global fairness constraint.
Second, we evaluate global fairness under the global accuracy constraint .
Global DP Gap (%) under on ACS:
| Method | Split 0 | Split 1 | Split 2 | Split 3 | Split 4 |
|---|---|---|---|---|---|
| ERM | 11.45±0.50 | 13.25±0.20 | 12.23±0.33 | 9.43±0.74 | 12.14±0.27 |
| Fairret | 2.24±0.45 | 2.98±0.40 | 3.52±0.50 | 3.45±0.41 | 2.82±0.45 |
| Fairlearn | 6.60±2.90 | 7.27±3.96 | 3.25±2.45 | 3.32±2.15 | 7.26±3.68 |
| Minimax | 9.78±0.84 | 11.49±0.79 | 9.17±0.47 | 7.05±0.59 | 9.79±0.69 |
| FairScore | 6.17±0.73 | 8.09±0.84 | 7.56±1.07 | 6.32±0.49 | 7.49±0.74 |
| W1 | 1.75±0.15 | 2.84±1.42 | 2.95±0.65 | 1.81±0.31 | 2.51±1.50 |
| Ours | 1.20±0.35 | 1.28±0.79 | 1.02±0.40 | 1.74±0.47 | 1.57±0.58 |
Our method consistently achieves the lowest mean global DP gap across all five data splits while maintaining the required global accuracy. Taken together, these results provide additional evidence that the improvements are not specific to a particular random initialization or data partition, but remain consistent across the evaluated model seeds and data splits.
Comparability of baseline tuning and evaluation. As detailed in Appendix C, we employ a common two-layer ReLU scoring architecture with hidden dimension 64 and a 60%/20%/20% training/validation/test split. The baselines are implemented using their publicly available codebases. For each fairness-aware method, including ours, we distinguish between two types of hyperparameters. First, we systematically vary the fairness budget or an analogous fairness regularization-strength parameter to construct a family of candidate score functions, rather than selecting a single value through validation. Second, for all other hyperparameters, we follow the procedures specified in the respective original papers, either tuning them on the validation set or adopting the recommended values. Appendix C.2 provides the corresponding hyperparameter settings and search ranges.
Importantly, all candidate score functions are evaluated using the same global accuracy and global fairness metrics across acceptance rates . Each candidate score function therefore corresponds to a paired point , from which we construct the accuracy–fairness Pareto frontiers in Figures 2 and 7.
For the acceptance-rate-wise comparisons in Figures 3 and 4, we apply the same constrained selection criteria to all methods. Specifically, under a prescribed global accuracy threshold, we select the candidate score function with the smallest global fairness gap among those satisfying the accuracy constraint. Conversely, under a prescribed global fairness threshold, we select the candidate with the highest global accuracy among those satisfying the fairness constraint. We then report the corresponding fairness gaps or accuracies at each acceptance rate.
Thus, while the fairness-controlling parameters are systematically varied to characterize each method's accuracy–fairness trade-off, the remaining hyperparameters follow the original methods' recommended tuning procedures or settings. All methods are compared using the same evaluation metrics and constrained selection criteria, ensuring a consistent evaluation protocol across different methods.
W2 & Q3: Fairness disparities across individual acceptance rates
A3. We thank the reviewer for highlighting the possibility that improvements in aggregate fairness could conceal larger disparities at individual acceptance rates.
While Figures 2 and 7 present the overall global accuracy–fairness trade-offs, where global accuracy and fairness are computed by averaging the corresponding metrics across acceptance rates , we specifically include Figures 3 and 4 to examine whether improvements in aggregate metrics are accompanied by favorable performance at individual acceptance rates, rather than potentially masking large disparities at certain rates.
Specifically, Figures 3 and 4 report accuracy and fairness gaps at each evaluated acceptance rate under comparable global performance constraints.
In Figure 3, among score functions with global accuracy of at least 64.5% on ACS, our method maintains a DP gap below 0.02 across all nine evaluated acceptance rates, whereas competing methods satisfy this fairness level only over subsets of the acceptance-rate range.
Similarly, Figure 4 shows that, among score functions with global accuracy of at least 56.0% on COMPAS, our method maintains an EO gap below 0.05 across all nine evaluated acceptance rates, while competing methods do not consistently satisfy this fairness level across the entire range.
These results demonstrate that the improvements of our method are not merely reflected in the averaged global fairness metric, but also translate into consistently low disparities across the evaluated acceptance rates.
Beyond these empirical findings, we further establish a quantitative connection between global fairness and maximum disparity across acceptance rates. At the population level, let denote the threshold-wise fairness disparity at acceptance rate , and suppose that is -Lipschitz continuous on . Since , for any , we have
\leq \frac{\Delta_G(s)}{r}+Lr.$$ In particular, when $L>0$ and $\Delta_G(s)\leq L$, choosing $r=\sqrt{\Delta_G(s)/L}$ yields $$\sup_{\alpha\in[0,1]}d_s(\alpha) \leq 2\sqrt{L\Delta_G(s)}.$$ **This result shows that controlling global fairness also limits how sharply large disparities can be concentrated at individual acceptance rates.** In particular, a large disparity at one acceptance rate must contribute to the overall global fairness measure through its neighboring rates, with the resulting maximum-disparity bound depending on the Lipschitz constant $L$. Taken together, the acceptance-rate-wise experiments demonstrate consistently low disparities at the evaluated rates, while the theoretical analysis further explains how global fairness can control maximum disparity across the continuous acceptance-rate range when the disparity function is Lipschitz continuous.
W1 & Q1. Fair comparison with Fairlearn's mixture and individual classifiers.
A1. We thank the reviewer for raising this important concern. Fairlearn's exponentiated-gradient algorithm (Agarwal et al., 2018) iteratively generates base classifiers and learns a randomized mixture of binary classifiers, rather than a mixture of continuous scoring functions. Therefore, the original framework does not uniquely specify how to construct a deterministic score function from the learned mixture.
Score construction. In our implementation, each base classifier is a neural network that naturally produces a continuous logit score st,ε(x). We construct a deterministic mixture score by taking the weighted average of the base classifiers' predicted positive-class probabilities using Fairlearn's learned mixture weights:
smix,ε(x)=∑twt,εσ(st,ε(x)),
where σ(⋅) denotes the sigmoid function. Importantly, Fairlearn's mixture weights are learned to combine binary classifiers under its original randomized-classification objective, rather than to optimize the accuracy–fairness trade-off of a deterministic continuous score function. Consequently, directly applying these weights to continuous scores does not necessarily yield a favorable score-level representation.
To avoid restricting Fairlearn's performance to this particular mixture-score construction, we additionally include the continuous scores produced by all individual base classifiers generated during Fairlearn's optimization in its candidate score function set. This allows Fairlearn to be evaluated using both the weighted mixture score and the individual base-classifier scores, without requiring additional training or learnable post-processing parameters.
Evaluation and fairness of comparison. For each candidate score function, we evaluate accuracy and DP/EO gaps at acceptance rates α∈{0.1,…,0.9}, and average them to obtain global accuracy and global fairness. These metrics are computed using the same protocol as for all competing methods. Importantly, including the individual base-classifier scores expands Fairlearn's candidate set and cannot deteriorate its attainable global accuracy–fairness Pareto frontier relative to evaluating only the mixture scores. Thus, our evaluation provides Fairlearn with additional opportunities to achieve favorable trade-offs rather than artificially restricting its score-level performance.
Empirical evidence. Despite this expanded candidate set, our method achieves more favorable global accuracy–fairness trade-offs, as shown in Figures 2 and 7. Figures 3 and 4 further demonstrate the advantages across individual acceptance rates. In particular, Figure 3 shows that, among models with global accuracy of at least 64.5% on ACS, our method maintains a DP gap below 0.02 across all evaluated acceptance rates, whereas Fairlearn and the other competing methods satisfy this level only over subsets of the range.
We emphasize that our deterministic mixture score is a score-level adaptation of Fairlearn's learned models rather than its original randomized binary classifier, and we do not assume that it inherits the latter's fairness guarantees.