no code implementations • 22 Dec 2023 • Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala
Machine learning techniques are increasingly used for high-stakes decision-making, such as college admissions, loan attribution or recidivism prediction.
no code implementations • 29 Aug 2023 • Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala
In addition, we demonstrate that under realistic assumptions regarding the interpretable models' structure, the uncertainty of the reconstruction can be computed efficiently.
no code implementations • 2 Sep 2022 • Julien Ferry, Ulrich Aïvodji, Sébastien Gambs, Marie-José Huguet, Mohamed Siala
More precisely, we propose a generic reconstruction correction method, which takes as input an initial guess made by the adversary and corrects it to comply with some user-defined constraints (such as the fairness information) while minimizing the changes in the adversary's guess.
no code implementations • 21 Mar 2022 • Hao Hu, Marie-José Huguet, Mohamed Siala
Then, we lift the encoding to a MaxSAT model to learn optimal BDDs in limited depths, that maximize the number of examples correctly classified.
no code implementations • 10 Feb 2021 • Mohammed H. AlSharif, Mohamed Saad, Mohamed Siala, Mohanad Ahmed, Tareq Y. Al-Naffouri
For the same movement range, the system provides range estimates with a root mean square error (RMSE) less than 0. 76 mm in a high SNR scenario (10 dB), and an MSE less than 0. 85 mm in a low SNR scenario (-10 dB).
1 code implementation • 9 Sep 2019 • Ulrich Aïvodji, Julien Ferry, Sébastien Gambs, Marie-José Huguet, Mohamed Siala
While it has been shown that interpretable models can be as accurate as black-box models in several critical domains, existing fair classification techniques that are interpretable by design often display poor accuracy/fairness tradeoffs in comparison with their non-interpretable counterparts.
no code implementations • 18 Sep 2017 • Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan
Then, we show the equivalence between the SAT formulation and finding a (1, 1)-supermatch on a specific family of instances.
no code implementations • 24 May 2017 • Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin
We first define robustness by introducing (a, b)-supermatches.
no code implementations • 22 Apr 2013 • Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh
The FOCUS constraint expresses the notion that solutions are concentrated.