Fair Neighbor Embedding
Abstract
We consider fairness in dimensionality reduction. Nonlinear dimensionality reduction yields low dimensional representations that let users visualize and explore high-dimensional data. However, traditional dimensionality reduction may yield biased visualizations overemphasizing relationships of societal phenomena to sensitive attributes or protected groups. We introduce a framework of fair neighbor embedding, the Fair Neighbor Retrieval Visualizer, which formulates fair nonlinear dimensionality reduction as an information retrieval task whose performance and fairness are quantified by information retrieval criteria. The method optimizes low-dimensional embeddings that preserve high-dimensional data neighborhoods without yielding biased association of such neighborhoods to protected groups. In experiments the method yields fair visualizations outperforming previous methods.
Cite
Text
Peltonen et al. "Fair Neighbor Embedding." International Conference on Machine Learning, 2023.Markdown
[Peltonen et al. "Fair Neighbor Embedding." International Conference on Machine Learning, 2023.](https://mlanthology.org/icml/2023/peltonen2023icml-fair/)BibTeX
@inproceedings{peltonen2023icml-fair,
title = {{Fair Neighbor Embedding}},
author = {Peltonen, Jaakko and Xu, Wen and Nummenmaa, Timo and Nummenmaa, Jyrki},
booktitle = {International Conference on Machine Learning},
year = {2023},
pages = {27564-27584},
volume = {202},
url = {https://mlanthology.org/icml/2023/peltonen2023icml-fair/}
}