Pith. sign in

REVIEW

Fair Text Classification with Wasserstein Independence

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 2311.12689 v1 pith:TZ2J2MLI submitted 2023-11-21 cs.CL cs.CYcs.LG

classification cs.CLcs.CYcs.LG
keywords sensitivetextclassificationfairannotationsapproachattributescompared
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Group fairness is a central research topic in text classification, where reaching fair treatment between sensitive groups (e.g. women vs. men) remains an open challenge. This paper presents a novel method for mitigating biases in neural text classification, agnostic to the model architecture. Considering the difficulty to distinguish fair from unfair information in a text encoder, we take inspiration from adversarial training to induce Wasserstein independence between representations learned to predict our target label and the ones learned to predict some sensitive attribute. Our approach provides two significant advantages. Firstly, it does not require annotations of sensitive attributes in both testing and training data. This is more suitable for real-life scenarios compared to existing methods that require annotations of sensitive attributes at train time. Second, our approach exhibits a comparable or better fairness-accuracy trade-off compared to existing methods.

Discussion (0). Continue with ORCID to comment.

Pith tools