Graduate studies at Western
Minds and Machines 3 (2):125-153 (1993)
|Abstract||This paper reviews four significant advances on the feedforward architecture that has dominated discussions of connectionism. The first involves introducing modularity into networks by employing procedures whereby different networks learn to perform different components of a task, and a Gating Network determines which network is best equiped to respond to a given input. The second consists in the use of recurrent inputs whereby information from a previous cycle of processing is made available on later cycles. The third development involves developing compressed representations of strings in which there is no longer an explicit encoding of the components but where information about the structure of the original string can be recovered and so is present functionally. The final advance entails using connectionist learning procedures not just to change weights in networks but to change the patterns used as inputs to the network. These advances significantly increase the usefulness of connectionist networks for modeling human cognitive performance by, among other things, providing tools for explaining the productivity and systematicity of some mental activities, and developing representations that are sensitive to the content they are to represent|
|Keywords||Connectionism neural networks expert networks recurrent networks RAAM networks|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Brian P. McLaughlin & F. Warfield (1994). The Allure of Connectionism Reexamined. Synthese 101 (3):365-400.
S. Phillips (1998). Are Feedforward and Recurrent Networks Systematic? Analysis and Implications for a Connectionist Cognitive Architecture. .
Andy Clark (1994). Representational Trajectories in Connectionist Learning. Minds and Machines 4 (3):317-32.
Dan Lloyd (1996). Consciousness, Connectionism, and Cognitive Neuroscience: A Meeting of the Minds. Philosophical Psychology 9 (1):61-78.
Jerry A. Fodor & Zenon W. Pylyshyn (1988). Connectionism and Cognitive Architecture. Cognition 28:3-71.
Jonathan Opie & Gerard O'Brien (2006). How Do Connectionist Networks Compute? Cognitive Processing 7 (1):30-41.
Kenneth Aizawa (1994). Representations Without Rules, Connectionism, and the Syntactic Argument. Synthese 101 (3):465-92.
Michael R. W. Dawson, D. A. Medler & Istvan S. N. Berkeley (1997). PDP Networks Can Provide Models That Are Not Mere Implementations of Classical Theories. Philosophical Psychology 10 (1):25-40.
Martin Davies (1989). Connectionism, Modularity and Tacit Knowledge. British Journal for the Philosophy of Science 40 (December):541-55.
Added to index2009-01-28
Total downloads10 ( #114,693 of 750,430 )
Recent downloads (6 months)1 ( #62,995 of 750,430 )
How can I increase my downloads?