Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists

Abstract

Fairness and interpretability are fundamental requirements for the development of responsible machine learning. However, learning optimal interpretable models under fairness constraints has been identified as a major challenge. In this paper, we investigate and improve on a state-of-the-art exact learning algorithm, called CORELS, which learns rule lists that are certifiably optimal in terms of accuracy and sparsity. Statistical fairness metrics have been integrated incrementally into CORELS in the literature. This paper demonstrates the limitations of such an approach for exploring the search space efficiently before proposing an Integer Linear Programming method, leveraging accuracy, sparsity and fairness jointly for better pruning. Our thorough experiments show clear benefits of our approach regarding the exploration of the search space.
Fichier principal
Vignette du fichier
CPAIOR2022_FINAL-FERRY.pdf (579.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03602234 , version 1 (08-03-2022)

Identifiers

  • HAL Id : hal-03602234 , version 1

Cite

Ulrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala. Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists. 19th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR-2022), Jun 2022, Los Angeles, CA, United States. ⟨hal-03602234⟩
115 View
42 Download

Share

Gmail Mastodon Facebook X LinkedIn More