Reducing Biases in Record Matching Through Scores Calibration
Not on the map. Why?
Abstract (arXiv)
Record matching models typically output a real-valued matching score that is later consumed through thresholding, ranking, or human review. While fairness in record matching has mostly been assessed using binary decisions at a fixed threshold, such evaluations can miss systematic disparities in the entire score distribution and can yield conclusions that change with the chosen threshold. We introduce a threshold-independent notion of score bias that extends standard group-fairness criteria-demographic parity (DP), equal opportunity (EO), and equalized odds (EOD)-from binary outputs to score functions by integrating group-wise metric gaps over all thresholds. Using this metric, we empirically show that several state-of-the-art deep matchers can exhibit substantial score bias even when appearing fair at commonly used thresholds. To mitigate these disparities without retraining the underlying matcher, we propose two model-agnostic post-processing methods that only require score evaluations on an (unlabeled) calibration set. Calib targets DP by aligning minority/majority score distributions to a common Wasserstein barycenter via a quantile-based optimal-transport map, with finite-sample guarantees on both residual DP bias and score distortion. C-Calib extends this idea to label-dependent notions (EO/EOD) by performing barycenter alignment conditionally on an estimated label, and we characterize how its guarantees depend on both sample size and label-estimation error. Experiments on standard record-matching benchmarks and multiple neural matchers confirm that Calib and C-Calib substantially reduce score bias with minimal loss in accuracy.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 51 references that are in the map. First posted on arXiv 3 Nov 2024.
Builds on
28 of 51 references.
References · 28
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2017Spectrally-normalized margin bounds for neural networkscited by 681
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2019Fair Regression: Quantitative Definitions and Reduction-based Algorithmscited by 168
- 2020Deep Entity Matching with Pre-Trained Language Modelscited by 143
- 2017FA*IR: A Fair Top-k Ranking Algorithmcited by 113
- 2020Fair Regression with Wasserstein Barycenterscited by 99
- 2017Ranking with Fairness Constraintscited by 78
- 2019Policy Learning for Fairness in Rankingcited by 74
- 2021Fairness in Rankings and Recommendations: An Overviewcited by 62
- 2017DeepER -- Deep Entity Resolutioncited by 54
16 more
- 2019The Fairness of Risk Scores Beyond Classification: Bipartite Ranking and the xAUC Metriccited by 41
- 2019Low-resource Deep Entity Resolution with Transfer and Active Learningcited by 37
- 2020Interventions for Ranking in the Presence of Implicit Biascited by 27
- 2019Balanced Ranking with Diversity Constraintscited by 20
- 2020A Comprehensive Benchmark Framework for Active Learning Methods in Entity Matchingcited by 17
- 2022Fair Ranking with Noisy Protected Attributescited by 17
- 2022Minimax AUC Fairness: Efficient Algorithm with Provable Convergencecited by 16
- 2018A General Framework for Fair Regressioncited by 13
- 2020Wasserstein-based fairness interpretability framework for machine learning modelscited by 13
- 2023The Misuse of AUC: What High Impact Risk Assessment Gets Wrongcited by 10
- 2023Through the Fairness Lens: Experimental Analysis and Evaluation of Entity Matchingcited by 9
- 2022Repairing Regressors for Fair Binary Classification at Any Decision Thresholdcited by 8
- 2022Demographic Parity Constrained Minimax Optimal Regression under Linear Modelcited by 6
- 2023Fair Rank Aggregationcited by 5
- 2024Threshold-Independent Fair Matching through Score Calibrationcited by 4
- 2024FairEM360: A Suite for Responsible Entity Matchingcited by 1
Built on by
Not cited yet.