Skip to content

Equalized odds

A classifier fairness criterion requiring protected groups to have equal true-positive and false-positive rates conditional on the actual outcome.

Version
v2 · 2026-09-06 · History
Domain-specific #
1775
Origin domain
machine learning
Subdomain
group fairness for supervised prediction
Aliases
Equalized odds criterion

Core Idea

Equalized odds is a classifier fairness criterion requiring protected groups to have equal true-positive and false-positive rates conditional on the actual outcome.

A predictor satisfies equalized odds with respect to protected attribute A and outcome Y when its prediction is conditionally independent of A given Y. In binary classification, this requires equal true-positive rates and equal false-positive rates across protected groups, or equivalently equal prediction distributions within each actual-outcome stratum.

Its operative boundary is not supplied by the name alone. Preserve this identity: A classifier fairness criterion requiring protected groups to have equal true-positive and false-positive rates conditional on the actual outcome.

Scope of Application

The abstraction recurs literally within binary and multiclass supervised decisions where protected-group error rates are audited or constrained. The following habitats preserve the same recognition machinery; they are not invitations to extend the name metaphorically.

  • Lending. approval errors are compared conditional on repayment outcome.
  • Medical prediction. sensitivity and false-positive rates are compared across patient groups.
  • Risk assessment. error-rate disparities are measured by outcome strata.
  • Post-processing. randomized thresholds move a score onto an equalized-odds frontier.
  • Model selection. accuracy and group-conditional error constraints are optimized jointly.

Clarity

Declare A, Y, the prediction threshold, positive class, population, and whether equality is exact or tolerance-bounded. Report uncertainty for every group–outcome cell. Equalized odds can be technically satisfied against labels that encode unequal treatment, so label validity and decision consequences remain separate normative questions.

A practical identification audit begins with the typed roles rather than the title: establish the protected attribute, verify the ground-truth outcome, then test the remaining conditions and exclusions.

Manages Complexity

The criterion decomposes disparity into false-negative and false-positive treatment conditional on actual status. ROC geometry makes feasible post-processing explicit and reveals the performance cost of equalizing rates.

The compression remains accountable because each simplification has a named failure condition. Disagreement can be localized to a missing role, an invalid assumption, an ambiguous measurement, or a neighboring abstraction instead of being hidden inside an unanalyzed label.

Abstract Reasoning

R1. Define protected groups, outcome labels, prediction, and decision population. R2. Estimate true- and false-positive rates within every adequately sampled group. R3. Test both rate equalities with uncertainty or a declared tolerance. R4. If post-processing, derive group-specific randomized thresholds from the validation ROC curves. R5. Audit label quality, calibration, intersectional groups, and downstream consequences beyond the criterion.

Knowledge Transfer

The criterion transfers literally across supervised predictions with protected group, outcome, and both conditional error rates. Fairness and constraint are parents; equal acceptance rates or equal accuracy alone do not satisfy equalized odds.

The transfer boundary is explicit: DOMAIN-SPECIFIC PASS / PRIME FAIL: The criterion is applied across classifiers, protected attributes, and binary outcomes by comparing group-conditioned error rates. Literal recognition retains the specialist vocabulary and validity conditions of machine-learning fairness; outside that setting only broader parent operations transfer.

Relationships to Other Abstractions

Local relationship map for Equalized oddsParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Equalized oddsDOMAINPrime abstraction: Constraint — is a kind ofConstraintPRIMEPrime abstraction: Fairness — is a kind ofFairnessPRIME

Current abstraction Equalized odds Domain-specific

Parents (2) — more general patterns this builds on

  • Equalized odds is a kind of Constraint Prime

    Constraint (prime:constraint).

  • Equalized odds is a kind of Fairness Prime

    Fairness (prime:fairness).

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Equalized odds sits in a sparse region of the domain-specific corpus (76th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Statistical Paradoxes & Model Reliability (20 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08