How do we know we use symbols?
{This is Gary.} In the last post I was wondering about the categorization
issues raised by a paper. Halfway along, I spoke about another paper that went bad (Clarke & Thornton, 1997, BBS {C&T}). In one of the responses to the target article by C&T, Gary Marcus explains how Elman networks (backpropogation, hidden units, momentum etc etc) generally cannot really do things that are hallmarks of the kinds of stuff that we can do, and the example is worth considering.
Gary considered the following: imagine I said to you "a rose is a rose", or "a duck is a duck"; what would you reply to "a dax is a ___"?
If you thought of anything besides "dax", your neurons probably look like little points with arrows sticking in an out, reminiscent of Toshirô Mifune towards the end of Kurosawa's Throne of Blood.
What Gary saw was that with many many versions of an Elman network, the network was simply unable to generalize the "a (__) is a (__)" pattern. This is because a network operates over the input set, looking for correlations and the like; usually it cannot abstract well to stuff that is outside the input stimulus set. {Rider: certain patterns it can of course generalize; these typically lie inside the training set, in the sense that they can be arrived at by intrapolation}.
Which reminds me very much of some of the things that Fodor says are non-negotiable for a proper theory of the mind. One of them is something similar: systematicity.
Systematicity means that if I can say "John kisses Mary", then I can as easily say "Mary kisses John". It is as if the verb kisses is surrounded by two slots, which can be filled by the kisser and the kissee.
0 Comments:
Post a Comment
<< Home