Inferensys

Glossary

Group Fairness

A class of fairness definitions that partition a population into groups defined by a protected attribute and require a statistical measure to be equal across these groups.
Stylish WeWork-like workspace with hot desks and document wall, professional searching through enterprise knowledge base on a mounted ultrawide display, warm industrial pendants overhead.
FAIRNESS DEFINITION

What is Group Fairness?

Group fairness is a class of algorithmic fairness definitions that partition a population into groups defined by a protected attribute and require a specific statistical measure to be equal across these groups.

Group fairness is a class of algorithmic fairness definitions that partition a population into groups defined by a protected attribute (e.g., race, gender) and require a specific statistical measure to be equal across these groups. It focuses on parity of outcomes or errors between demographic cohorts rather than treating similar individuals similarly, making it the dominant framework for auditing disparate impact in regulatory compliance contexts.

Common statistical measures enforced include demographic parity (equal positive prediction rates), equalized odds (equal true and false positive rates), and predictive parity (equal precision). A key challenge is that these criteria are mathematically mutually exclusive except in degenerate cases, forcing practitioners to select a specific metric based on the ethical and legal context of the deployment domain.

STATISTICAL PARITY FRAMEWORKS

Core Group Fairness Metrics

Group fairness metrics partition a population by a protected attribute and mandate that a specific statistical measure be equal across all groups. These definitions operationalize non-discrimination into auditable mathematical constraints.

01

Demographic Parity

Also known as statistical parity, this independence-based metric requires the probability of a positive prediction to be identical across all groups.

  • Formula: P(Ŷ=1 | A=a) = P(Ŷ=1 | A=b)
  • Key weakness: Can lead to 'levelling down' where qualified candidates in one group are rejected to match a lower-performing group's rate
  • Use case: College admissions and hiring where proportional representation is the explicit goal
  • Violation example: A lending model approving 80% of Group A but only 60% of Group B
02

Equalized Odds

A separation-based metric requiring both the true positive rate and false positive rate to be equal across groups. This ensures the classifier is equally accurate for all populations.

  • Formula: P(Ŷ=1 | Y=1, A=a) = P(Ŷ=1 | Y=1, A=b) AND P(Ŷ=1 | Y=0, A=a) = P(Ŷ=1 | Y=0, A=b)
  • Key insight: Satisfies both the 'equal opportunity' and 'equal mistreatment' criteria simultaneously
  • Limitation: Impossible to satisfy simultaneously with demographic parity when base rates differ across groups, except in trivial cases
  • Origin: Formalized by Hardt, Price, and Srebro in their 2016 NeurIPS paper
03

Equal Opportunity

A relaxed subset of equalized odds that only constrains the true positive rate across groups. It ensures equally qualified individuals have the same chance of receiving a positive outcome.

  • Formula: P(Ŷ=1 | Y=1, A=a) = P(Ŷ=1 | Y=1, A=b)
  • What it ignores: Does not constrain false positive rates, meaning one group could still experience higher rates of erroneous positive classifications
  • Practical advantage: Less restrictive than full equalized odds, allowing for better accuracy-fairness trade-offs
  • Example: A recidivism prediction tool where the true re-offense rate is captured equally across racial groups
04

Predictive Parity

A sufficiency-based metric requiring that the positive predictive value (precision) be equal across groups. A positive prediction must imply the same probability of success regardless of group membership.

  • Formula: P(Y=1 | Ŷ=1, A=a) = P(Y=1 | Ŷ=1, A=b)
  • Also called: 'Outcome test' in economics and legal scholarship
  • Key property: When satisfied, a decision-maker can treat the model's score as meaning the same thing for all individuals
  • Trade-off: Cannot be simultaneously satisfied with equalized odds when base rates differ, a result known as the impossibility theorem of fairness
05

Disparate Impact Ratio

A legal doctrine operationalized as the 80% rule (or four-fifths rule) from the Uniform Guidelines on Employee Selection Procedures.

  • Formula: DI = P(Ŷ=1 | A=disadvantaged) / P(Ŷ=1 | A=advantaged)
  • Threshold: A ratio below 0.8 indicates prima facie disparate impact
  • Origin: Rooted in US employment discrimination law (Griggs v. Duke Power Co., 1971)
  • Limitation: A purely statistical threshold that does not account for business necessity or job-relatedness defenses
  • Modern use: Frequently reported in algorithmic bias audits alongside other metrics
06

The Impossibility Theorem

A foundational result in algorithmic fairness proving that no classifier can simultaneously satisfy three common fairness criteria except in degenerate cases.

  • The three incompatible criteria: Demographic Parity, Equalized Odds, and Predictive Parity
  • When they align: Only when base rates Y are identical across groups or the classifier achieves perfect accuracy
  • Practical implication: Organizations must explicitly choose which fairness definition aligns with their ethical and legal obligations—there is no one-size-fits-all solution
  • Source: Proved independently by Kleinberg et al. (2016) and Chouldechova (2017)

How Group Fairness Metrics Are Computed

Group fairness metrics are computed by first partitioning a dataset into subgroups defined by a protected attribute, then calculating a chosen statistical measure for each group, and finally comparing these measures to quantify disparity.

The computation begins by segmenting the evaluation dataset into mutually exclusive groups based on a protected attribute such as race or gender. For each group, a specific statistical rate is calculated from the model's predictions and the ground truth labels. Common rates include the positive prediction rate, true positive rate, and positive predictive value, each forming the basis for a different fairness criterion.

The final step applies a mathematical comparison function to the group-level rates. For demographic parity, this is a simple difference or ratio of positive prediction rates. For equalized odds, the true positive and false positive rates are compared independently across groups. A perfectly fair model under a given definition yields a comparison value of zero difference or a ratio of one.

GROUP FAIRNESS AUDITING

Frequently Asked Questions

Clear, technical answers to the most common questions about defining, measuring, and enforcing statistical parity across protected groups in machine learning models.

Group Fairness is a class of algorithmic fairness definitions that partition a population into groups defined by a protected attribute (such as race, gender, or age) and require a specific statistical measure to be equal across these groups. Unlike Individual Fairness, which mandates that similar individuals receive similar outcomes, group fairness focuses on aggregate parity. The core mechanism involves selecting a statistical metric—such as positive prediction rate, true positive rate, or positive predictive value—and enforcing its equality across all slices of the data. This approach is formalized through three distinct mathematical families: Independence (e.g., Demographic Parity), Separation (e.g., Equalized Odds), and Sufficiency (e.g., Predictive Parity). The fundamental challenge is the impossibility theorem, which proves that these three families cannot be simultaneously satisfied except in degenerate cases, forcing practitioners to make explicit trade-offs based on the ethical and legal context of their deployment.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.