A Puzzle concerning Compositionality in Machines

被引:1
作者
Ryan M. Nefdt
机构
[1] University of the Cape Town,Department of Philosophy
来源
Minds and Machines | 2020年 / 30卷
关键词
Compositionality; Deep Neural Networks; Deep learning; machine learning; Epistemic opacity; Artificial Intelligence;
D O I
暂无
中图分类号
学科分类号
摘要
This paper attempts to describe and address a specific puzzle related to compositionality in artificial networks such as Deep Neural Networks and machine learning in general. The puzzle identified here touches on a larger debate in Artificial Intelligence related to epistemic opacity but specifically focuses on computational applications of human level linguistic abilities or properties and a special difficulty with relation to these. Thus, the resulting issue is both general and unique. A partial solution is suggested.
引用
收藏
页码:47 / 75
页数:28
相关论文
共 65 条
[1]  
Ananny M(2016)Seeing without knowing: Limitations of the transparency ideal and its application to algorithmic accountability New Media & Society 20 973-989
[2]  
Crawford K(2007)Inferentialism and some of its challenges Philosophy and Phenomenological Research 74 651-676
[3]  
Brandom R(1999)Compositionality as methodology Linguistics and Philosophy 22 311-326
[4]  
Dever J(2018)Grounds for trust: Essential epistemic opacity and computational reliabilism Minds and Machines 28 645-666
[5]  
Durán J(1991)Distributed representations, simple recurrent networks, and grammatical structure Machine Learning 7 195-225
[6]  
Formanek N(1988)Connectionism and cognitive architecture: A critical analysis Cognition 28 3-71
[7]  
Elman J(2009)The philosophy of simulation: Hot new issues or same old stew? Synthese 169 593-613
[8]  
Fodor J(2011)The indeterminacy of word segmentation and the nature of morphology and syntax Folia Linguistica 45 31-80
[9]  
Pylyshyn Z(1997)Long short-term memory Neural Computation 9 1735-1780
[10]  
Frigg R(2009)The philosophical novelty of computer simulation methods Synthese 169 615-626