Directly Optimizing Mean Demographic Parity for Nonlinear Regression
Not on the map. Why?
Abstract (arXiv)
We focus on regression settings where the fairness goal is to equalize average predictions across values of a sensitive attribute, a criterion known as mean demographic parity. Directly optimizing this criterion is difficult because it depends on a conditional mean that is unknown and changes during training. Common dependence penalties and adversarial methods do not estimate this conditional mean; instead, they push predictions toward full independence. This stronger constraint can reduce accuracy even when average predictions are already equal. Existing conditional-mean methods are limited to linear predictors or low-dimensional sensitive attributes. We enable direct optimization of mean demographic parity using DPVar, a fairness measure defined as the variance of the conditional mean prediction. Because the conditional mean must be estimated as the predictor changes, optimizing DPVar leads to a functional bilevel problem. We develop two solvers: FBO, which uses a closed-form hypergradient, and an iterative-differentiation (ITD) solver that differentiates through updates of the conditional-mean estimator. Unlike previous conditional-mean methods, our approach applies to nonlinear predictors and high-dimensional continuous sensitive attributes. Across a semi-synthetic benchmark built from 21 tabular regression datasets and Communities & Crime data, FBO and ITD recover competitive or better accuracy-DPVar trade-offs than existing methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 33 references that are in the map. First posted on arXiv 6 Jul 2026.
Builds on
15 of 33 references.
References · 15
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2019Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networkscited by 242
- 2018Online normalizer calculation for softmaxcited by 162
- 2016Motifs in Temporal Networkscited by 101
- 2022TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphscited by 61
- 2021Dynamic Graph Neural Networks for Sequential Recommendationcited by 57
- 2020Accelerating Graph Sampling for Graph Machine Learning using GPUscited by 29
- 2023Spatio-Temporal Graph Neural Point Process for Traffic Congestion Event Predictioncited by 13
- 2024MSPipe: Efficient Temporal GNN Training via Staleness-Aware Pipelinecited by 12
- 2013Do the rich get richer? An empirical analysis of the BitCoin transaction networkcited by 7
3 more
- 2023NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streamscited by 6
- 2023GNNFlow: A Distributed Framework for Continuous Temporal GNN Learning on Dynamic Graphscited by 5
- 2024FastGL: A GPU-Efficient Framework for Accelerating Sampling-Based GNN Training at Large Scalecited by 3
Built on by
Not cited yet.