Search Results for author:
Found 8 papers, 1 papers with code
Smooth Sensitivity for Learning Differentially-Private yet Accurate Rule Lists
Differentially-private (DP) mechanisms can be embedded into the design of a machine learningalgorithm to protect the resulting model against privacy leakage, although this often comes with asignificant loss of accuracy.
SoK: Taming the Triangle -- On the Interplays between Fairness, Interpretability and Privacy in Machine Learning
Machine learning techniques are increasingly used for high-stakes decision-making, such as college admissions, loan attribution or recidivism prediction.
Probabilistic Dataset Reconstruction from Interpretable Models
In addition, we demonstrate that under realistic assumptions regarding the interpretable models' structure, the uncertainty of the reconstruction can be computed efficiently.
Learning Optimal Fair Scoring Systems for Multi-Class Classification
In this paper, we use Mixed-Integer Linear Programming (MILP) techniques to produce inherently interpretable scoring systems under sparsity and fairness constraints, for the general multi-class classification setup.
Exploiting Fairness to Enhance Sensitive Attributes Reconstruction
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.
Optimizing Binary Decision Diagrams with MaxSAT for classification
Then, we lift the encoding to a MaxSAT model to learn optimal BDDs in limited depths, that maximize the number of examples correctly classified.
Learning Fair Rule Lists
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.
Constraint programming for planning test campaigns of communications satellites
This can be modeled as packing the tests into configurations, and we introduce a set of implied constraints to improve the lower bound of the model.
