Pith. sign in

REVIEW 1 cited by

Fair Infinitesimal Jackknife: Mitigating the Influence of Biased Training Data Points Without Refitting

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 2212.06803 v1 pith:CHMH3IQT submitted 2022-12-13 cs.LG cs.CYstat.ML

classification cs.LGcs.CYstat.ML
keywords fairnessimprovespointstrainingapproachdatadroppingfind
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In consequential decision-making applications, mitigating unwanted biases in machine learning models that yield systematic disadvantage to members of groups delineated by sensitive attributes such as race and gender is one key intervention to strive for equity. Focusing on demographic parity and equality of opportunity, in this paper we propose an algorithm that improves the fairness of a pre-trained classifier by simply dropping carefully selected training data points. We select instances based on their influence on the fairness metric of interest, computed using an infinitesimal jackknife-based approach. The dropping of training points is done in principle, but in practice does not require the model to be refit. Crucially, we find that such an intervention does not substantially reduce the predictive performance of the model but drastically improves the fairness metric. Through careful experiments, we evaluate the effectiveness of the proposed approach on diverse tasks and find that it consistently improves upon existing alternatives.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 5 citations worldwide. Full citation record

  1. Testing Most Influential Sets

    stat.ML 2025-10 reject novelty 6.0 of 10

    Maximum influence of the most influential k-point subset in OLS follows a Fréchet distribution (heavy tails, fixed k) or Gumbel distribution (light tails or growing k), enabling tests of excessive influence.

Pith tools