In defense of reliabilist epistemology of algorithms
Juan M. Duran (TU Delft - Ethics & Philosophy of Technology)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In a reliabilist epistemology of algorithms, a high frequency of accurate output representations is indicative of the algorithm’s reliability. Recently, Humphreys challenged this assumption, arguing that reliability depends not only on frequency but also on the quality of outputs. Specifically, he contends that radical and egregious misrepresentations have a distinct epistemic impact on our assessment of an algorithm’s reliability, regardless of the frequency of their occurrence. He terms these statistically insignificant but serious errors (SIS-Errors) and maintains that their occurrence warrants revoking our epistemic attitude towards the algorithm’s reliability. This article seeks to defend reliabilist epistemologies of algorithms against the challenge posed by SIS-Errors. To this end, I draw upon computational reliabilism as a foundational framework and articulate epistemological conditions designed to prevent SIS-Errors and thus preserve algorithmic reliability.