Sterkenburg, Tom F. (2024) Values in machine learning: What follows from underdetermination? [Preprint]
|
Text
valsalgs.pdf - Submitted Version Download (337kB) |
Abstract
It has been argued that inductive underdetermination entails that machine learning algorithms must be value-laden. This paper offers a more precise account of what it would mean for a "machine learning algorithm" to be "value-laden," and, building on this, argues that a general argument from underdetermination does not warrant this conclusion.
| Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
| Social Networking: |
| Item Type: | Preprint | ||||||
|---|---|---|---|---|---|---|---|
| Creators: |
|
||||||
| Subjects: | General Issues > Confirmation/Induction Specific Sciences > Artificial Intelligence > Machine Learning General Issues > Values In Science |
||||||
| Depositing User: | Mr Tom Sterkenburg | ||||||
| Date Deposited: | 20 Dec 2024 14:42 | ||||||
| Last Modified: | 20 Dec 2024 14:42 | ||||||
| Item ID: | 24439 | ||||||
| Subjects: | General Issues > Confirmation/Induction Specific Sciences > Artificial Intelligence > Machine Learning General Issues > Values In Science |
||||||
| Date: | 2024 | ||||||
| URI: | https://philsci-archive.pitt.edu/id/eprint/24439 |
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
![]() |
View Item |



