Content deleted Content added
Bluelink 1 book for verifiability (prndis)) #IABot (v2.0) (GreenC bot |
Citation bot (talk | contribs) Alter: url, template type. Add: doi, issue, pmid, s2cid, author pars. 1-1. Removed URL that duplicated unique identifier. Removed parameters. Some additions/deletions were actually parameter name changes. | You can use this bot yourself. Report bugs here. | Activated by AManWithNoPlan | All pages linked from User:AManWithNoPlan/sandbox2 | via #UCB_webform_linked |
||
Line 26:
===Biological realism===
Connectionist work in general does not need to be biologically realistic and therefore suffers from a lack of neuroscientific plausibility.<ref>{{Cite web|url=http://www.encephalos.gr/48-1-01e.htm|title=Encephalos Journal|website=www.encephalos.gr|access-date=2018-02-20}}</ref><ref>{{Cite book|url=https://books.google.com/books?id=s-OCCwAAQBAJ&pg=PT18&lpg=PT18&dq=%22accurate%22#v=onepage
===Learning===
The weights in a neural network are adjusted according to some [[learning rule]] or algorithm, such as [[Hebbian theory|Hebbian learning]]. Thus, connectionists have created many sophisticated learning procedures for neural networks. Learning always involves modifying the connection weights. In general, these involve mathematical formulas to determine the change in weights when given sets of data consisting of activation vectors for some subset of the neural units. Several studies have been focused on designing teaching-learning methods based on connectionism.<ref>{{Cite journal|
By formalizing learning in such a way, connectionists have many tools. A very common strategy in connectionist learning methods is to incorporate [[gradient descent]] over an error surface in a space defined by the weight matrix. All gradient descent learning in connectionist models involves changing each weight by the [[partial derivative]] of the error surface with respect to the weight. [[Backpropagation]] (BP), first made popular in the 1980s, is probably the most commonly known connectionist gradient descent algorithm today.<ref name=":4" />
Line 81:
Despite these differences, some theorists have proposed that the connectionist architecture is simply the manner in which organic brains happen to implement the symbol-manipulation system. This is logically possible, as it is well known that connectionist models can implement symbol-manipulation systems of the kind used in computationalist models,<ref name=":3">{{Cite journal|last=Chang|first=Franklin|date=2002|title=Symbolically speaking: a connectionist model of sentence production|journal=Cognitive Science|language=en|volume=26|issue=5|pages=609–651|doi=10.1207/s15516709cog2605_3|issn=1551-6709}}</ref> as indeed they must be able if they are to explain the human ability to perform symbol-manipulation tasks. Several cognitive models combining both symbol-manipulative and connectionist architectures have been proposed, notably among them [[Paul Smolensky]]'s Integrated Connectionist/Symbolic Cognitive Architecture (ICS).<ref name=":0" /><ref>{{Cite journal|last=Smolensky|first=Paul|date=1990|title=Tensor Product Variable Binding and the Representation of Symbolic Structures in Connectionist Systems|url=http://www.lscp.net/persons/dupoux/teaching/AT1_2012/papers/Smolensky_1990_TensorProductVariableBinding.AI.pdf|journal=Artificial Intelligence|volume=46|issue=1–2|pages=159–216|via=|doi=10.1016/0004-3702(90)90007-M}}</ref> But the debate rests on whether this symbol manipulation forms the foundation of cognition in general, so this is not a potential vindication of computationalism. Nonetheless, computational descriptions may be helpful high-level descriptions of cognition of logic, for example.
The debate was largely centred on logical arguments about whether connectionist networks could produce the syntactic structure observed in this sort of reasoning. This was later achieved although using fast-variable binding abilities outside of those standardly assumed in connectionist models.<ref name=":3" /><ref>{{Cite journal|
Part of the appeal of computational descriptions is that they are relatively easy to interpret, and thus may be seen as contributing to our understanding of particular mental processes, whereas connectionist models are in general more opaque, to the extent that they may be describable only in very general terms (such as specifying the learning algorithm, the number of units, etc.), or in unhelpfully low-level terms. In this sense connectionist models may instantiate, and thereby provide evidence for, a broad theory of cognition (i.e., connectionism), without representing a helpful theory of the particular process that is being modelled. In this sense the debate might be considered as to some extent reflecting a mere difference in the level of analysis in which particular theories are framed. Some researchers suggest that the analysis gap is the consequence of connectionist mechanisms giving rise to [[Emergence|emergent phenomena]] that may be describable in computational terms.<ref>{{Cite journal|last=Ellis|first=Nick C.|date=1998|title=Emergentism, Connectionism and Language Learning|url=http://www-personal.umich.edu/~ncellis/NickEllis/Publications_files/Emergentism.pdf|journal=Language Learning|volume=48:4|issue=4|pages=631–664|doi=10.1111/0023-8333.00063|via=}}</ref>
The recent{{when|date=February 2016}} popularity of [[Cognitive Model#Dynamical systems|dynamical systems]] in [[philosophy of mind]] have added a new perspective on the debate; some authors{{which|date=February 2016}} now argue that any split between connectionism and computationalism is more conclusively characterized as a split between computationalism and [[Cognitive Model#Dynamical systems|dynamical systems]].
|