Papers › Individual Fairness Guarantees for Neural Networks

Individual Fairness Guarantees for Neural Networks

11 May 2022arXiv:2205.05763archive 2025-07-28

Elias Benussi, Andrea Patane, Matthew Wicker, Luca Laurenti, Marta Kwiatkowska

We consider the problem of certifying the individual fairness (IF) of feed-forward neural networks (NNs). In particular, we work with the ϵ-δ-IF formulation, which, given a NN and a similarity metric learnt from data, requires that the output difference between any pair of ϵ-similar individuals is bounded by a maximum decision tolerance δ≥0. Working with a range of metrics, including the Mahalanobis distance, we propose a method to overapproximate the resulting optimisation problem using piecewise-linear functions to lower and upper bound the NN's non-linearities globally over the input space. We encode this computation as the solution of a Mixed-Integer Linear Programming problem and demonstrate that it can be used to compute IF guarantees on four datasets widely used for fairness benchmarking. We show how this formulation can be used to encourage models' fairness at training time by modifying the NN loss, and empirically confirm our approach yields NNs that are orders of magnitude fairer than state-of-the-art methods.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2205.05763")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: official repository: 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

eliasbenussi/nn-cert-individual-fairness officialmentioned in papertfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from eliasbenussi/nn-cert-individual-fairness. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

compl_svd_projector eliasbenussi/nn-cert-individual-fairness/training/SenSR.py official repository unverified MIT (permissive) · 034accda1c28c7b8 · report
considered_paths eliasbenussi/nn-cert-individual-fairness/certification_experiments.py official repository unverified MIT (permissive) · be16d70449f8dac6 · report
fair_dist eliasbenussi/nn-cert-individual-fairness/training/SenSR.py official repository unverified MIT (permissive) · 78b0a063868409f0 · report
learn_sensitive_hyperplane_cat eliasbenussi/nn-cert-individual-fairness/training/sensitive_subspace.py official repository unverified MIT (permissive) · f5a5df8e0db2140a · report
learn_sensitive_hyperplane_num eliasbenussi/nn-cert-individual-fairness/training/sensitive_subspace.py official repository unverified MIT (permissive) · ae96aacd2101aca8 · report
stack_weights eliasbenussi/nn-cert-individual-fairness/training/sensitive_subspace.py official repository unverified MIT (permissive) · b8bc8c3fd1cac4d8 · report
weight_variable eliasbenussi/nn-cert-individual-fairness/training/SenSR.py official repository unverified MIT (permissive) · 06fe887d57990942 · report

Tasks

BenchmarkingFairness

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections