Non-transparent machine learning algorithms can be described as non-trivial machines that do not have to be understood, but controlled as communication partners. From the perspective of sociological systems theory, the normative component of control should be addressed with a critical attitude, observing what is normal as improbable.
Elena Esposito (2021). Author’s Response: Opacity and Complexity of Learning Black Boxes. CONSTRUCTIVIST FOUNDATIONS, 16(3), 377-380.
Author’s Response: Opacity and Complexity of Learning Black Boxes
Elena Esposito
2021
Abstract
Non-transparent machine learning algorithms can be described as non-trivial machines that do not have to be understood, but controlled as communication partners. From the perspective of sociological systems theory, the normative component of control should be addressed with a critical attitude, observing what is normal as improbable.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Opacity and Complexity .pdf
accesso aperto
Descrizione: Articolo in rivista
Tipo:
Versione (PDF) editoriale / Version Of Record
Licenza:
Licenza per accesso libero gratuito
Dimensione
93.42 kB
Formato
Adobe PDF
|
93.42 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
