Approximating Discrimination Within Models When Faced With Several Non-Binary Sensitive Attributes
<|reference_start|>Approximating Discrimination Within Models When Faced With Several Non-Binary Sensitive Attributes: Discrimination mitigation with machine learning (ML) models could be complicated because multiple factors may interweave with each other including hierarchically and historically. Yet few existing fairness measures are able to capture the discrimination level within ML models in the face of multiple sensitive attributes. To bridge this gap, we propose a fairness measure based on distances between sets from a manifold perspective, named as 'harmonic fairness measure via manifolds (HFM)' with two optional versions, which can deal with a fine-grained discrimination evaluation for several sensitive attributes of multiple values. To accelerate the computation of distances of sets, we further propose two approximation algorithms named 'Approximation of distance between sets for one sensitive attribute with multiple values (ApproxDist)' and 'Approximation of extended distance between sets for several sensitive attributes with multiple values (ExtendDist)' to respectively resolve bias evaluation of one single sensitive attribute with multiple values and that of several sensitive attributes with multiple values. Moreover, we provide an algorithmic effectiveness analysis for ApproxDist under certain assumptions to explain how well it could work. The empirical results demonstrate that our proposed fairness measure HFM is valid and approximation algorithms (i.e., ApproxDist and ExtendDist) are effective and efficient.<|reference_end|>
@article{bian2024approximating,
    title={Approximating Discrimination Within Models When Faced With Several
  Non-Binary Sensitive Attributes},
    author={Yijun Bian, Yujie Luo, Ping Xu},
    journal={arXiv preprint arXiv:2408.06099},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.06099},
    primaryClass={cs.LG cs.CY}
}