Pith. sign in

REVIEW 2 cited by

Intersectional Unfairness Discovery

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.20790 v3 pith:EXZVJNCR submitted 2024-05-31 cs.LG cs.CY

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

AI systems have been shown to produce unfair results for certain subgroups of population, highlighting the need to understand bias on certain sensitive attributes. Current research often falls short, primarily focusing on the subgroups characterized by a single sensitive attribute, while neglecting the nature of intersectional fairness of multiple sensitive attributes. This paper focuses on its one fundamental aspect by discovering diverse high-bias subgroups under intersectional sensitive attributes. Specifically, we propose a Bias-Guided Generative Network (BGGN). By treating each bias value as a reward, BGGN efficiently generates high-bias intersectional sensitive attributes. Experiments on real-world text and image datasets demonstrate a diverse and efficient discovery of BGGN. To further evaluate the generated unseen but possible unfair intersectional sensitive attributes, we formulate them as prompts and use modern generative AI to produce new texts and images. The results of frequently generating biased data provides new insights of discovering potential unfairness in popular modern generative AI systems. Warning: This paper contains generative examples that are offensive in nature.

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. Full citation record

  1. Generalization in VAE and Diffusion Models: A Unified Information-Theoretic Analysis

    cs.LG 2025-06 reject novelty 5.0 of 10

    The authors derive information-theoretic generalization bounds for VAEs and diffusion models that expose a trade-off in the diffusion time T, and propose using the computable bound to select T and regularize training.

  2. Homophily Enhanced Graph Domain Adaptation

    cs.SI 2025-05 reject novelty 4.0 of 10

    Graph domain adaptation fails more when source and target graphs have different local homophily profiles, and the proposed HGDA filters and aligns homophily, heterophily, and attribute signals to improve cross-graph n...

Pith tools