Pith. sign in

REVIEW 2 cited by

Metric Learning for Individual Fairness

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 1906.00250 v2 pith:TZMIP55J submitted 2019-06-01 cs.LG cs.CYstat.ML

classification cs.LGcs.CYstat.ML
keywords fairnessmetricindividualindividualssimilarityapproximationsarbiterhuman
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

There has been much discussion recently about how fairness should be measured or enforced in classification. Individual Fairness [Dwork, Hardt, Pitassi, Reingold, Zemel, 2012], which requires that similar individuals be treated similarly, is a highly appealing definition as it gives strong guarantees on treatment of individuals. Unfortunately, the need for a task-specific similarity metric has prevented its use in practice. In this work, we propose a solution to the problem of approximating a metric for Individual Fairness based on human judgments. Our model assumes that we have access to a human fairness arbiter, who can answer a limited set of queries concerning similarity of individuals for a particular task, is free of explicit biases and possesses sufficient domain knowledge to evaluate similarity. Our contributions include definitions for metric approximation relevant for Individual Fairness, constructions for approximations from a limited number of realistic queries to the arbiter on a sample of individuals, and learning procedures to construct hypotheses for metric approximations which generalize to unseen samples under certain assumptions of learnability of distance threshold functions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Local Statistical Parity for the Estimation of Fair Decision Trees

    cs.LG 2025-04 conditional novelty 6.0 of 10

    A decision tree satisfies statistical parity if every node split is independent of the protected attribute, a condition C-LRT approximates with constrained logistic splits.

  2. Avoiding Resentment Via Monotonic Fairness

    stat.ML 2019-09 conditional novelty 6.0 of 10

    Monotonic fairness, enforced by positive-weight neural networks, avoids both class and score resentment by construction while still allowing a demographic parity trade-off.

Pith tools