Fair Bayesian Optimization
Valerio Perrone, Michele Donini, Muhammad Bilal Zafar, Robin, Schmucker, Krishnaram Kenthapadi, C\'edric Archambeau

TL;DR
This paper presents a flexible Bayesian optimization framework that enforces fairness constraints across various ML models by tuning hyperparameters, achieving fairer and high-performing solutions without model-specific adjustments.
Contribution
It introduces a general, model-agnostic constrained Bayesian optimization method for optimizing ML performance with fairness constraints, applicable to diverse models and fairness definitions.
Findings
The approach achieves accurate and fair solutions by hyperparameter tuning.
It is competitive with specialized fairness techniques and outperforms data preprocessing methods.
Hyperparameters like regularization correlate with fairness and generalization.
Abstract
Given the increasing importance of machine learning (ML) in our lives, several algorithmic fairness techniques have been proposed to mitigate biases in the outcomes of the ML models. However, most of these techniques are specialized to cater to a single family of ML models and a specific definition of fairness, limiting their adaptibility in practice. We introduce a general constrained Bayesian optimization (BO) framework to optimize the performance of any ML model while enforcing one or multiple fairness constraints. BO is a model-agnostic optimization method that has been successfully applied to automatically tune the hyperparameters of ML models. We apply BO with fairness constraints to a range of popular models, including random forests, gradient boosting, and neural networks, showing that we can obtain accurate and fair solutions by acting solely on the hyperparameters. We also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
