Pith. sign in

REVIEW 2 cited by

A Unified Post-Processing Framework for Group Fairness in Classification

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

arxiv 2405.04025 v2 pith:YMBBJ4KD submitted 2024-05-07 cs.LG cs.CY

classification cs.LGcs.CY
keywords fairnessgrouppost-processingalgorithmclassificationfairoptimalbase
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a post-processing algorithm for fair classification that covers group fairness criteria including statistical parity, equal opportunity, and equalized odds under a single framework, and is applicable to multiclass problems in both attribute-aware and attribute-blind settings. Our algorithm, called "LinearPost", achieves fairness post-hoc by linearly transforming the predictions of the (unfair) base predictor with a "fairness risk" according to a weighted combination of the (predicted) group memberships. It yields the Bayes optimal fair classifier if the base predictors being post-processed are Bayes optimal, otherwise, the resulting classifier may not be optimal, but fairness is guaranteed as long as the group membership predictor is multicalibrated. The parameters of the post-processing can be efficiently computed and estimated from solving an empirical linear program. Empirical evaluations demonstrate the advantage of our algorithm in the high fairness regime compared to existing post-processing and in-processing fair classification algorithms.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Group Fairness Meets the Black Box: Enabling Fair Algorithms on Closed LLMs via Post-Processing

    cs.LG 2025-08 conditional novelty 7.0 of 10

    A prompt-based pipeline lets closed LLMs like GPT-4o be used with classical group-fairness algorithms, without access to weights or embeddings.

  2. Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives

    cs.LG 2026-07 accept novelty 5.5 of 10

    Combinatorial optimization provides global guarantees, certificates, and explicit trade-offs for trustworthy ML tasks spanning training, explanation, fairness, robustness, compression, and privacy.

Pith tools