- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes A-IEOF, a fairness-aware learning framework for binary classification when new features are added to an existing model. The main goal is to maintain equalized odds across sensitive groups, even when the distribution of the newly added features changes after deployment.
The method combines three components: adversarially generated feature replacements to control worst-case fairness disparities, teacher anchoring to preserve predictions from the original model, and a stability regularizer to reduce sensitivity to the new features. The authors also provide a theoretical bound on fairness degradation under a restricted form of distribution shift.
The method is evaluated on clinical data, Adult, COMPAS, and a controlled synthetic benchmark. Results show improved fairness and robustness compared with several baselines, although predictive accuracy sometimes decreases. Ablation studies suggest that standard fairness regularization primarily improves fairness on the original distribution, while the proposed intervention and stability terms improve robustness to feature shifts.
Critical strengths
-
Practically motivated problem setting. The paper addresses fairness under distribution shift when new features are introduced into an existing model. This is a relevant deployment scenario that goes beyond enforcing fairness on a fixed training distribution.
-
Theoretical motivation and targeted empirical validation. The paper provides a bound connecting fairness degradation to feature sensitivity and the magnitude of distribution shift. The controlled shift experiments and ablation studies support this connection, showing that the proposed intervention and stability terms improve robustness rather than merely reducing fairness gaps on the training distribution.
Critical weaknesses
-
Discussion of closely related work is somewhat insufficient. The paper does not adequately discuss closely related fairness methods such as "FairICP: Encouraging Equalized Odds via Inverse Conditional Permutation" and "Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness". GerryFair considers fairness across rich collections of subgroups while FairICP addresses conditional independence across multiple sensitive attributes through adversarial learning. These approaches are relevant to the paper's multi-group fairness objective and adversarial optimization framework. A more careful comparison is needed to clarify what is fundamentally new about the proposed method, beyond combining existing techniques in a feature-addition setting.
-
Limited scope of the theoretical guarantee. The fairness-transfer bound assumes that the newly added feature provides no additional information about the outcome conditional on the existing features and sensitive group. This appears restrictive given the motivation of adding informative features to improve prediction. It is unclear how well the theoretical guarantees apply to realistic settings where this assumption is violated.
Questions for authors
See weaknesses.
2 comments
Part 2 of 2.
How restrictive it is in practice. We estimated η coarsely, conditioning on the group only. On the controlled benchmark, where independence holds by construction, the estimate is below 0.10, which is sampling noise around zero. On the CT metadata, where the institution identifier strongly predicts the label, it is 0.25 to 0.42. With A-IEOF's sensitivity there (ε̂_stab = 0.571), the relaxed bound is vacuous, and the experiments agree. At Δ_TV = 0.5, the EO gap of A-IEOF rises from 0.403 to 1.213. This is less than ERM (0.356 to 1.394). It is more than the reductions learner (0.384 to 0.990) and IRM (0.635 to 0.737). We report this case as a limitation of the method in the abstract, the real-data section, the conclusion and the ethics statement.
Why the setting still matters. There is a tension, which the Scope paragraph now states. A model that extracts label signal from B must be sensitive to B. Utility from B and robustness to shifts in B therefore pull in opposite directions. The bound does not remove this tension. It quantifies it, and the training weights λ_interv and λ_stab choose a point on it.
Part 1 of 2.
W1. Related work omits FairICP and GerryFair. What is new beyond combining existing techniques?
Thank you for pointing this out. The revision adds a related-work paragraph titled "Multi-group and equalized-odds in-processing". It covers the following methods.
The paragraph states that A-IEOF shares ingredients with an adversary, a soft EO penalty and multi-group gaps. We do not claim these ingredients as new. The difference lies in what is resampled and what is guaranteed.
FairICP resamples the sensitive attributes given the label. It tests and enforces equalized odds under the training distribution. A-IEOF instead resamples a designated non-sensitive block B given (x_{-B}, s). An adversarial generator searches for replacement values of B that break equalized odds, and the model is trained to withstand them. Theorem 1 then bounds how much the EO gap can change when the deployment distribution of B moves:
No result of this kind exists for FairICP, because FairICP does not single out a feature block whose distribution may shift.
GerryFair widens the set of groups to a rich subgroup class. A-IEOF keeps a small, fixed set of intersectional groups and widens the set of distributions instead.
The two directions are complementary. A subgroup auditor such as GerryFair could replace our max-min over groups. FairICP's permutation sampler could replace our generator when B is continuous and high-dimensional.
The new experiments support this distinction for the in-distribution methods we could run. Reductions-EO, Fairlearn's exponentiated gradient and Prejudice Remover all control EO on the training distribution. Under a shift of 0.5 in P(B | S), all three lose 0.24 to 0.28 in EO, while A-IEOF changes by 0.002 (Table 4, shown under Reviewer 1, W1c). We did not run FairICP or GerryFair, and Appendix H says so.
W2. The bound assumes the new feature adds no information about the outcome given the existing features and group. This seems restrictive.
Thank you for pointing this out. The assumption was stronger than the result needs, and the revised theorem no longer requires it.
Where the assumption entered. In the original proof, conditional independence (B independent of Y given X_{-B} and S) was used at one step only. It replaced P(B | X_{-B}, S, Y) by P(B | X_{-B}, S). This allowed a shift in P(B | X_{-B}, S) to be carried over to the label-conditional rates that define equalized odds.
The relaxed result. We measure the shift directly on the label-conditional law of B. The revised theorem (Appendix G) states:
Here Δ_TV is the shift in P(B | X_{-B}, S). η_P measures, in total variation, how far P(B | X_{-B}, S, Y) is from P(B | X_{-B}, S) under P. No independence assumption is needed. Conditional independence is the special case η_P = η_P' = 0, which recovers the original bound.
The cost of a violation. When B carries extra label information, the guarantee weakens additively by C · ε_stab · (η_P + η_P'). It does not fail abruptly when η is above zero. It loosens in proportion to how much label information B carries and to how sensitive the model is to B. Training with a small ε_stab therefore keeps the bound informative under mild violations.