Model-Agnostic Fairness via Data and Output Transformations

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 231 papers33 conceptsfrozen 2026-10-04

In the early days of algorithmic fairness, researchers often focused on "in-processing" methods: modifying the internal loss functions of specific models to penalize bias. While effective, this approach created a modularity gap. If a practitioner wanted to switch from a Support Vector Machine to a Deep Neural Network, they had to reinvent the fairness mechanism from scratch.

A growing body of research has shifted toward model-agnostic fairness, treating the underlying machine learning algorithm as a "black box." By intervening at the data level (pre-processing) or the prediction level (post-processing), these methods allow practitioners to enforce fairness across any architecture, from simple linear regressions to massive language models.

The Data Layer: Pre-processing for Fairness

The most intuitive way to achieve fairness is to "clean" the bias before the model ever sees it. If the training data is balanced and free of discriminatory correlations, any standard learner should theoretically produce a fair outcome.

Flavio Calmon and Dennis Wei pioneered this in Optimized Pre-Processing for Discrimination Prevention, where they used convex optimization to learn a transformation of the dataset. This transformation balances three competing goals: reducing group discrimination, preserving individual data utility, and limiting how much any single person's data is distorted.

Other researchers have explored more surgical interventions:

The Algorithmic Layer: Fairness as a Reduction

If we cannot change the data, can we change how we use the model? Alekh Agarwal, Miroslav Dudík, and John Langford introduced a landmark framework in A Reductions Approach to Fair Classification.

They treat fair classification as a constrained optimization problem and "reduce" it to a series of standard cost-sensitive classification problems. Essentially, the framework acts as a wrapper that calls the black-box learner multiple times, each time with different weights on the training samples. This iterative process converges on a model that satisfies fairness constraints (like demographic parity) while maximizing accuracy. This approach is powerful because it works for any classifier that can handle weighted data.

The Output Layer: Post-processing Scores

Sometimes, we don't have the luxury of retraining a model. In these cases, we must intervene at the final stage: the model's output.

Standard post-processing often involves simply changing the decision threshold for different groups. However, this can destroy the calibration of the model's probability scores. To solve this, Dennis Wei and Karthikeyan Natesan Ramamurthy developed FairScoreTransformer (FST). FST transforms the continuous scores produced by a model to satisfy fairness constraints while ensuring the resulting scores remain well-calibrated probabilities. This allows the model to be fair while still providing useful information about its confidence.

Why the Model-Agnostic Approach Works

The intuition behind this research direction is decoupling. By separating the fairness requirement from the learning architecture, these methods provide three key advantages:

  1. Portability: A single fairness intervention (like a pre-processing script) can be applied to a Random Forest today and a Transformer tomorrow.
  2. Scalability: Methods like the variational framework proposed by Eric Granger in Clustering with Fairness Constraints scale linearly with data size, making them practical for industrial applications where retraining complex models is too expensive.
  3. Future-Proofing: As new, more powerful models are developed, model-agnostic frameworks ensure that fairness doesn't become a bottleneck. Researchers like Tianchun Li are already extending these ideas to Universal Debiasing for Language Models, ensuring that even the most complex generative agents can be aligned with societal values.

Papers in this version

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 19 papers
  2. Version 1 · 2026-10-04 · 31 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_model_specific_fairness_constraints_4c66a6b1,
  title = {model-specific fairness constraints},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/model-specific-fairness-constraints/rdr_4c66a6b1904e4971934d55764e7ff1dd},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}

This exact version (version 1, frozen text):

@misc{lacuna_model_agnostic_fairness_via_data_and_out_4c66a6b1_v1,
  title = {Model-Agnostic Fairness via Data and Output Transformations},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/model-agnostic-fairness-via-data-and-output-transformations/rdr_4c66a6b1904e4971934d55764e7ff1dd/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}