mlsanityData to 7 Oct 2026

Using Pareto Simulated Annealing to Address Algorithmic Bias in Machine Learning

arXiv 2105.15064 ↗First posted 31 May 2021cs.LG cs.CYcited by 3

Not on the map. Why?

Abstract (arXiv)

Algorithmic Bias can be due to bias in the training data or issues with the algorithm itself. These algorithmic issues typically relate to problems with model capacity and regularisation. This underestimation bias may arise because the model has been optimised for good generalisation accuracy without any explicit consideration of bias or fairness. In a sense, we should not be surprised that a model might be biased when it hasn't been "asked" not to be. In this paper, we consider including bias (underestimation) as an additional criterion in model training. We present a multi-objective optimisation strategy using Pareto Simulated Annealing that optimise for both balanced accuracy and underestimation. We demonstrate the effectiveness of this strategy on one synthetic and two real-world datasets.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 9 of its 31 references that are in the map. First posted on arXiv 31 May 2021.

Builds on

9 of 31 references.

References · 9

  1. 2014Certifying and removing disparate impactcited by 715
  2. 2020Fairness in Machine Learning: A Surveycited by 369
  3. 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 368
  4. 2020Characterising Bias in Compressed Modelscited by 162
  5. 2016Satisfying Real-world Goals with Dataset Constraintscited by 68
  6. 2021Algorithmic Factors Influencing Bias in Machine Learningcited by 9
  7. 2017Fairness-aware machine learning: a perspectivecited by 3
  8. 2020Underestimation Bias and Underfitting in Machine Learningcited by 2
  9. 2019Customizing Pareto Simulated Annealing for Multi-objective Optimization of Control Cabinet Layoutcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

3 papers.