- The paper introduces optimal transport-based measures using the Wasserstein distance to capture conditional demographic disparities.
- It presents two regularization techniques, FairBiT and FairLeap, to enforce fairness while balancing model performance.
- Experiments on real-world datasets demonstrate that these methods achieve superior fairness-performance trade-offs compared to existing approaches.
Auditing and Enforcing Conditional Fairness via Optimal Transport
This paper introduces a novel approach to auditing and enforcing conditional demographic parity (CDP) using optimal transport techniques. CDP measures the fairness of a predictive model by ensuring its outputs remain independent of a sensitive feature when conditioned on an additional legitimate feature or set of features. Achieving CDP is more challenging than traditional demographic parity (DP) due to complexities introduced by multiple levels of conditioning variables and continuous model outputs.
Key Contributions:
- Conditional Demographic Disparity (CDD) Measures: The authors propose new measures for CDD using statistical distances from the optimal transport literature, specifically the Wasserstein distance. These measures evaluate the entire conditional distribution rather than just first moments, applicable to both classification and regression settings.
- Regularization Techniques:
To enforce CDP, the paper introduces two regularization-based approaches utilizing the CDD measures:
- FairBiT (Fairness through Bi-causal Transport): This method uses the bi-causal transport distance to target equality of conditional distributions. The regularizer is derived from a nested form of the Wasserstein distance, providing a differentiable objective for optimization.
- FairLeap: This method aggregates level-wise disparities across legitimate features using different probability measures. It allows practitioners to balance fairness and predictive performance through a regularization parameter.
- Quantitative Evaluation: The paper conducts extensive experiments on real-world datasets, including classification and regression tasks, to demonstrate the efficacy of the proposed methods. FairBiT and FairLeap consistently achieve better fairness-performance trade-offs compared to existing methods such as DCFR and adversarial debiasing.
Implications:
The findings address a significant gap in algorithmic fairness by providing tools to measure and enforce CDP. These methods are particularly relevant in scenarios where legitimate features are numerous or continuous, situations where traditional methods struggle. By leveraging optimal transport, the paper introduces a mathematically grounded framework to evaluate and reduce unfairness in algorithmic decision-making.
Future Directions:
This research opens avenues for further exploration in conditional fairness:
- Extending bi-causal transport methods to other fairness notions like equalized odds.
- Exploring hybrid approaches combining FairBiT with pre-processing or adversarial techniques to enhance fairness-performance trade-offs.
- Investigating applications to fairness-aware synthetic data generation for sectors like healthcare.
Overall, this paper contributes a substantial methodological advancement for achieving fairness in machine learning models by redefining fairness measures through the lens of optimal transport.