Cited by 231Ethics and Social Impacts of AIPrivacy-Preserving Technologies in DataExplainable Artificial Intelligence (XAI)

Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees

Open access
Celis, L. Elisa, Huang, Lingxiao, Keswani, Vijay, Vishnoi, Nisheeth K.·2019·Proceedings of the Conference on Fairness, Accountability, and Transparency

Abstract

Developing classification algorithms that are fair with respect to sensitive attributes of the data is an important problem due to the increased deployment of classification algorithms in societal contexts. Several recent works have focused on studying classification with respect to specific fairness metrics, modeled the corresponding fair classification problem as constrained optimization problems, and developed tailored algorithms to solve them. Despite this, there still remain important metrics for which there are no fair classifiers with theoretical guarantees; primarily because the resulting optimization problem is non-convex. The main contribution of this paper is a meta-algorithm for classification that can take as input a general class of fairness constraints with respect to multiple non-disjoint and multi-valued sensitive attributes, and which comes with provable guarantees. In particular, our algorithm can handle non-convex "linear fractional" constraints (which includes fairness constraints such as predictive parity) for which no prior algorithm was known. Key to our results is an algorithm for a family of classification problems with convex constraints along with a reduction from classification problems with linear fractional constraints to this family. Empirically, we observe that our algorithm is fast, can achieve near-perfect fairness with respect to various fairness metrics, and the loss in accuracy due to the imposed fairness constraints is often small.

Integrity signals

Registry

Crossref · 10.1145/3287560.3287586

Cites

49 of 49 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • When extending the classifier's (convex) loss function with fairness terms, researchers typically seek to balance fairness and accuracy.

    “When extending the classiier's (convex) loss function with fairness terms, researchers typically seek to balance fairness and accuracy (e.g.[5,26,36,52,57,98,119,141,153,168,208,314]).”

    From Fairness in machine learning: A survey (2024) · cites this paper as [57]

  • In-processing (constraint) optimization approaches have similar objectives to fairness regularization approaches.

    “In-processing (constraint) optimization approaches (e.g.[3, 57, 68, 79, 120, 135, 174, 208, 218, 219, 221, 307, 313]) have similar objectives to fairness regularization approaches, and hence we present them together.”

    From Fairness in machine learning: A survey (2024) · cites this paper as [57]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Celis, L. E., Huang, L., Keswani, V., & Vishnoi, N. K.
Affiliations
  • Yale University (US)
  • École Polytechnique Fédérale de Lausanne (CH)
Venue
Proceedings of the Conference on Fairness, Accountability, and Transparency
Publisher
ACM
Published
2019-01-29
Pages
319-328
OpenAlex
W2963100392
Cited by
231
References
49
Citations by year
2026: 16 · 2025: 25 · 2024: 33 · 2023: 34 · 2022: 38 · 2021: 46 · 2020: 27 · 2019: 11 · 2018: 1
FWCI
31.76
Type
conference paper
Language
en
Open access
Locations
  • ACM Conference on Fairness, Accountability, and Transparency (FAccT) (publishedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
Topics
  • Social Sciences › Safety Research › Ethics and Social Impacts of AI
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
Keywords
fair classification, fairness constraints, sensitive attributes, meta-algorithms, non-convex optimization, convex constraints, fairness-accuracy trade-off, provable guarantees

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review