PLS-based approach for fair representation learning
Elena M. De-Diego, Adrián Perez-Suay, Paula Gordaliza, Jean-Michel Loubes
TL;DR
This work introduces Fair Partial Least Squares (Fair PLS) to create low-dimensional representations that are predictive yet approximately independent of sensitive attributes. By augmenting the PLS objective with a fairness regularizer, and extending to kernelized variants via HSIC, the method balances utility and demographic parity, with an optional Equality of Odds extension. The authors provide algorithmic details (NIPALS and kernel forms), extensive experiments across six real-world datasets and multiple prediction models, and show that Fair PLS can outperform vanilla fair PCA in both fairness and predictive performance. The approach is applicable to diverse data modalities, including potential use in large language models, and preserves the interpretability advantages of PLS while enabling fair representations and fair predictions in practical deployments.
Abstract
We revisit the problem of fair representation learning by proposing Fair Partial Least Squares (PLS) components. PLS is widely used in statistics to efficiently reduce the dimension of the data by providing representation tailored for the prediction. We propose a novel method to incorporate fairness constraints in the construction of PLS components. This new algorithm provides a feasible way to construct such features both in the linear and the non linear case using kernel embeddings. The efficiency of our method is evaluated on different datasets, and we prove its superiority with respect to standard fair PCA method.
