Algorithmic fairness auditing: can discrimination by algorithms be prevented?
Summary
Algorithms are increasingly used in decision-making. As numerous scandals show, this introduces new risks of discrimination on large scales. Algorithmic fairness audits have often been proposed as a binding method to reduce this and other risks. Hence, this research investigates what role auditing can play in ensuring algorithmic fairness, in terms of non-discrimination. Strictly defined, auditing leaves no room for subjective interpretation, meaning that all choices faced when assessing algorithmic fairness should be eliminated to create an audit framework. Hence our research focusses on detecting and eliminating these choices. Firstly, we identify the normative choices that are faced when assessing algorithmic fairness from a computer science perspective. Secondly, we investigate to what extent Dutch non-discrimination legislation prescribes how these choices should be made. We discover that some important, normative choices are left open by law. Hence, thirdly, we use informal conversations with algorithmic fairness practitioners to explore best practices in algorithmic fairness assessments to find alternative ways of deciding on these normative choices. Finally, we conclude that algorithmic fairness audits cannot be used directly to ensure non-discrimination. However, both internal and external audits can have a more indirect use in ensuring non-discrimination by ensuring the soundness of either the procedure of internal algorithmic fairness assessments or the documentation thereof.
Collections
Related items
Showing items related by title, author, creator and subject.
-
The Algorithm Agenda: A Discourse Analysis of the Dutch Algorithm Register.
Bottenbley, Akira (2023)This paper examines accountability and transparency in the Algorithm Register (AR) in the context of the Netherlands government's algorithm use. This paper aims to explore how transparency and accountability are implemented ... -
Extending Stein’s GCD algorithm and a comparison to Euclid’s GCD algorithm
Barkema, J.R. (2019)Euclid’s algorithm and Stein’s binary GCD algorithm are the two most well-known GCD algorithms. It has already been proven that Euclid’s algorithm is O(n^2), but we aim to provide a more intuitive and thorough proof using ... -
Why Algorithmic Decision Making Is Not Value-Neutral: Proposing a taxonomy of values in algorithmic decision making
Biekart, Marijn (2023)Algorithmic decision making (ADM) is used to assist decisions that have far-reaching consequences for individuals and society as a whole, for example in hiring and criminal law. As such, it is important that ADM is fair. ...