Post-processing for Fair Regression via Explainable SVD
Not on the map. Why?
Abstract (arXiv)
This paper presents a post-processing algorithm for training fair neural network regression models that satisfy statistical parity, utilizing an explainable singular value decomposition (SVD) of the weight matrix. We propose a linear transformation of the weight matrix, whereby the singular values derived from the SVD of the transformed matrix directly correspond to the differences in the first and second moments of the output distributions across two groups. Consequently, we can convert the fairness constraints into constraints on the singular values. We analytically solve the problem of finding the optimal weights under these constraints. Experimental validation on various datasets demonstrates that our method achieves a similar or superior fairness-accuracy trade-off compared to the baselines without using the sensitive attribute at the inference time.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 4 Apr 2025.
Builds on
3 of 20 references.
References · 3
- 2017Counterfactual Fairnesscited by 802
- 2019Conscientious Classification: A Data Scientist's Guide to Discrimination-Aware Classificationcited by 55
- 2020Achieving Equalized Odds by Resampling Sensitive Attributescited by 42
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2025Demographic-Agnostic Fairness without Harmcited by 1
- 2026Individual Fairness In Strategic Classificationcited by 0
- 2026Individual Fairness In Strategic Classification4 Feb 2026
- 2025Demographic-Agnostic Fairness without Harm28 Sep 2025