REVIEW 9 cited by
Projection to Fairness in Statistical Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In the context of regression, we consider the fundamental question of making an estimator fair while preserving its prediction accuracy as much as possible. To that end, we define its projection to fairness as its closest fair estimator in a sense that reflects prediction accuracy. Our methodology leverages tools from optimal transport to construct efficiently the projection to fairness of any given estimator as a simple post-processing step. Moreover, our approach precisely quantifies the cost of fairness, measured in terms of prediction accuracy.
Forward citations
Cited by 9 Pith papers
-
Group Fairness Meets the Black Box: Enabling Fair Algorithms on Closed LLMs via Post-Processing
A prompt-based pipeline lets closed LLMs like GPT-4o be used with classical group-fairness algorithms, without access to weights or embeddings.
-
OT-FairBoost: Optimal Transport-Guided Gradient Boosting for Fairness Regularization on Tabular Data
Embedding discrete Wasserstein-2 gradients and diagonal Hessians into LightGBM yields stronger accuracy–fairness trade-offs than prior in- and post-processing baselines on classification, regression, and multi-group tasks.
-
Functional Bilevel Optimization for Predictive Fairness
Optimizing DPVar—the variance of conditional-mean predictions given a continuous sensitive attribute—via functional bilevel methods (FBO/ITD) yields better fairness–accuracy trade-offs than HSIC, adversarial, and GDP ...
-
Optimal Transport under Group Fairness Constraints
Group-fairness targets are added as constraints to entropic optimal transport, with a modified Sinkhorn algorithm and two relaxations (penalty and cost learning) that come with sample-complexity bounds.
-
Federated Calculation of the Free-Support Transportation Barycenter by Single-Loop Dual Decomposition
A single-loop dual subgradient method computes a free-support Wasserstein barycenter in a federated setting without solving mass transportation subproblems at each iteration.
-
Computing Optimal Transport Maps and Wasserstein Barycenters Using Conditional Normalizing Flows
A conditional normalizing flow method that solves the primal optimal transport problem and computes Wasserstein-2 barycenters as weighted averages of maps from a shared latent distribution.
-
Fairness-Aware Grouping for Continuous Sensitive Variables: Application for Debiasing Face Analysis with respect to Skin Tone
A fairness-based grouping algorithm that partitions a continuous sensitive attribute into subgroups with maximally different discrimination levels, validated on synthetic data and face images.
-
Distributional Limit Theory for Optimal Transport
A survey of central limit theorems for empirical optimal transport, with a new one-dimensional L1 cost fluctuation CLT and a list of open problems.
-
Machine Unlearning via Information Theoretic Regularization
The paper introduces an auditable, information-theoretic 'marginal unlearning' definition and a rate-distortion style regularization method that can remove data points or features from models.
Discussion (0). Continue with ORCID to comment.