Chrome Extension
WeChat Mini Program
Use on ChatGLM

Fast and Efficient MMD-based Fair PCA Via Optimization over Stiefel Manifold

Proceedings of the AAAI Conference on Artificial Intelligence(2022)

Cited 12|Views38
No score
Abstract
This paper defines fair principal component analysis (PCA) as minimizing the maximum mean discrepancy (MMD) between the dimensionality-reduced conditional distributions of different protected classes. The incorporation of MMD naturally leads to an exact and tractable mathematical formulation of fairness with good statistical properties. We formulate the problem of fair PCA subject to MMD constraints as a non-convex optimization over the Stiefel manifold and solve it using the Riemannian Exact Penalty Method with Smoothing (REPMS). Importantly, we provide a local optimality guarantee and explicitly show the theoretical effect of each hyperparameter in practical settings, extending previous results. Experimental comparisons based on synthetic and UCI datasets show that our approach outperforms prior work in explained variance, fairness, and runtime.
More
Translated text
Key words
Machine Learning (ML),Philosophy And Ethics Of AI (PEAI)
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined