Pith. sign in

REVIEW 2 cited by

Toward a better trade-off between performance and fairness with kernel-based distribution matching

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 1910.11779 v1 pith:GMZJMFXK submitted 2019-10-25 cs.LG stat.ML

Toward a better trade-off between performance and fairness with kernel-based distribution matching

classification cs.LG stat.ML
keywords fairnesskernel-basedtowardclassifiersdifferentmetricsperformancereal-world
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

As recent literature has demonstrated how classifiers often carry unintended biases toward some subgroups, deploying machine learned models to users demands careful consideration of the social consequences. How should we address this problem in a real-world system? How should we balance core performance and fairness metrics? In this paper, we introduce a MinDiff framework for regularizing classifiers toward different fairness metrics and analyze a technique with kernel-based statistical dependency tests. We run a thorough study on an academic dataset to compare the Pareto frontier achieved by different regularization approaches, and apply our kernel-based method to two large-scale industrial systems demonstrating real-world improvements.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

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

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

  2. On the Reproducibility of "FairCLIP: Harnessing Fairness in Vision-Language Learning''

    cs.CV 2025-09 conditional novelty 6.0

    FairCLIP's claimed fairness and performance gains over CLIP do not reproduce on two datasets, and its official implementation diverges from the paper's own formulation.