Skip to content
Open access

Deployment-Aware Comparison of Lightweight Bias Mitigation Techniques in Machine Learning Pipelines

2026 · IEEE Access · Vol 14, pp. 139244-139261 · 0 citations · 24 references

TL;DR

A deployment-aware empirical comparison of three lightweight bias mitigation methods (Reweighing, Disparate Impact Remover, and Equalized Odds post-processing) against an unmitigated baseline is presented.

Abstract

Bias mitigation techniques for tabular classification are widely studied for their fairness and accuracy properties, but their deployment cost—including latency, training overhead, and implementation complexity—is reported less consistently. We present a deployment-aware empirical comparison of three lightweight bias mitigation methods (Reweighing, Disparate Impact Remover, and Equalized Odds post-processing) against an unmitigated baseline, evaluated across three benchmark datasets (Adult, COMPAS, German Credit) and two classifiers (Logistic Regression and Random Forest). We report performance, fairness, and operational cost across 300 runs total in the main matrix (240 runs with default AIF360 DIR + 60 runs with our Disparate Impact Remover sub-protocol that uses a train-only fitting procedure to avoid the feature-distribution leakage we observed in AIF360’s standard transductive DisparateImpactRemover API). Results show that the best method is not constant: Equalized Odds reliably reduces equalized-odds disparity (<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>EOD<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>) across all settings at a 2–10 percentage-point accuracy cost; Reweighing reduces demographic-parity disparity (<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>SPD<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>) substantially on Logistic Regression (47–80% reduction) but barely affects Random Forest on the larger datasets (4–9% reduction on Adult and COMPAS); and under the corrected train-only protocol, Disparate Impact Remover does not consistently reduce <inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>SPD<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula> (<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>SPD<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula> reduction is below 4% in 3 of 6 configurations and <inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>SPD<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula> increases by 3–54% in the remaining 3 configurations), at an accuracy cost within ±1 percentage point and batch-256 inference-latency multipliers of 12–<inline-formula> <tex-math notation="LaTeX">$49\times $ </tex-math></inline-formula> on Logistic Regression and 1.3–<inline-formula> <tex-math notation="LaTeX">$2.4\times $ </tex-math></inline-formula> on Random Forest. Under classifier hyperparameter tuning on the validation fold, the Reweighing<inline-formula> <tex-math notation="LaTeX">$\times $ </tex-math></inline-formula>Random-Forest gap closes markedly: tuned RF (max_depth= 10, class_weight=’balanced’ most often selected) achieves 30-49% <inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula>SPD<inline-formula> <tex-math notation="LaTeX">$\vert $ </tex-math></inline-formula> reductions with Reweighing, indicating that the RF gap under default hyperparameters is an artifact of the defaults rather than of Reweighing itself. We synthesize these results into a model- and constraint-conditional decision framework, and we report the AIF360 transductive-DIR leakage as a methodological observation that subsequent empirical fairness studies should address. Code, data-loading procedures, and the train-only DIR module are available at: <uri>https://github.com/shiva88/fairness-deployment-comparison</uri>

Read PDF

Similar papers

Open access Sep 2026

Robust Evaluation Metrics for Assessing Machine Learning Performance Beyond Accuracy

A structured multi-metric evaluation framework that integrates classification, ranking-based, calibration, and robustness-oriented metrics for comprehensive ML performance assessment is proposed capable of supporting more reliable real-world ML deployment.

Ade Putra, E. Noche, Diksha D. Gabhane · 0 citations
Open access Aug 2026

DecayBench: A Reference-Free Benchmark for Trustworthy Drift Detection

The no-regret property is proved and Alert is proposed, a label-free aggregation rule for drift detection that strictly improves over single-modality monitoring, increasing AUC by up to 25 points under mixed-modality drift and by approximately 50 points under cross-modal mismatch.

Jia Xu, Ying-Li Tian · 0 citations
Open access Oct 2026

Systematic benchmarking of oversampling, undersampling, and hybrid sampling techniques using SMOTE-CCU+ with statistical validation and ablation analysis

The persistent challenge of class imbalance continues to hinder predictive accuracy and fairness in Educational Data Mining (EDM), particularly in modelling academic performance and student behaviour. In this study, we present a comprehensive benchmark of resampling strategies encompassing oversampling, undersampli...

Khaled Mahmud Sujon, Rohayanti Hassan, Manal A. Othman et al. · 0 citations
#machine learning Preprint Sep 2026

Steering Under Compression: Dose-Response, Capability Cost, and Failure Asymmetry in Quantized LLMs

This work systematically study activation steering under weight-only quantization (INT8 and NF4) across four open-weight 7-9B models and two behavioral targets: judged sentiment and judge-free reasoning length, finding that sentiment steering survives quantization intact.

Saurav Bhandari, Benjamin Wade · 0 citations
Open access Sep 2026

When Does Cost-Sensitive Weighting Matter? A Classifier-Capacity Anal-ysis for Imbalanced Classification

The evidence supports a simple two-tier policy: tune the weighting scheme carefully for linear learners, and keep the plain balanced default for ensemble and boosting learners, where additional tuning yields no benefit that survives a significance test.

Swati Satpute, Ajit More · 0 citations

: Making

This work presents ShortcutCatcher, an automated, model-agnostic framework that detects and mitigates shortcuts with the help of explainable AI, and exposes dataset limitations where collection artefacts act as silent shortcuts that have gone so far unnoticed.

Politecnico Yuqi Zhao, I. di Torino, Politecnico Di et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.