mlsanityData to 7 Oct 2026

OmniFair: A Declarative System for Model-Agnostic Group Fairness in Machine Learning

arXiv 2103.09055 ↗First posted 13 Mar 2021cs.CY cs.DB cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

Machine learning (ML) is increasingly being used to make decisions in our society. ML models, however, can be unfair to certain demographic groups (e.g., African Americans or females) according to various fairness metrics. Existing techniques for producing fair ML models either are limited to the type of fairness constraints they can handle (e.g., preprocessing) or require nontrivial modifications to downstream ML training algorithms (e.g., in-processing). We propose a declarative system OmniFair for supporting group fairness in ML. OmniFair features a declarative interface for users to specify desired group fairness constraints and supports all commonly used group fairness notions, including statistical parity, equalized odds, and predictive parity. OmniFair is also model-agnostic in the sense that it does not require modifications to a chosen ML algorithm. OmniFair also supports enforcing multiple user declared fairness constraints simultaneously while most previous techniques cannot. The algorithms in OmniFair maximize model accuracy while meeting the specified fairness constraints, and their efficiency is optimized based on the theoretically provable monotonicity property regarding the trade-off between accuracy and fairness that is unique to our system. We conduct experiments on commonly used datasets that exhibit bias against minority groups in the fairness literature. We show that OmniFair is more versatile than existing algorithmic fairness approaches in terms of both supported fairness constraints and downstream ML models. OmniFair reduces the accuracy loss by up to 94.8% compared with the second best method. OmniFair also achieves similar running time to preprocessing methods, and is up to 270× faster than in-processing methods.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). Builds on 17 of its 51 references that are in the map. First posted on arXiv 13 Mar 2021.

Builds on

17 of 51 references.

References · 17

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  3. 2014Certifying and removing disparate impactcited by 715
  4. 2018A Reductions Approach to Fair Classificationcited by 585
  5. 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 582
  6. 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 370
  7. 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 368
  8. 2017Fairness in Criminal Justice Risk Assessments: The State of the Artcited by 315
  9. 2018Classification with Fairness Constraints: A Meta-Algorithm with Provable Guaranteescited by 146
  10. 2018An Intersectional Definition of Fairnesscited by 126
  11. 2013Discrimination in Online Ad Deliverycited by 93
  12. 2018An Empirical Study of Rich Subgroup Fairness for Machine Learningcited by 81
5 more
  1. 2018Assessing and Remedying Coverage for a Given Datasetcited by 21
  2. 2019GOGGLES: Automatic Image Labeling with Affinity Codingcited by 19
  3. 2019FairPrep: Promoting Data to a First-Class Citizen in Studies on Fairness-Enhancing Interventionscited by 13
  4. 2018Helix: Holistic Optimization for Accelerating Iterative Machine Learningcited by 11
  5. 2017Infrastructure for Usable Machine Learning: The Stanford DAWN Projectcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 8; 2023: 3; 2024: 2; 2025: 0; 2026: 1.

18 papers.

Sort: