Online research in philosophy

This paper presents considerations in favour of the view that traditional (classical) architectures can be seen as emergent features of connectionist networks with distributed representation. A recent paper by William Bechtel (1988) which argues for a similar conclusion is unsatisfactory in that it fails to consider whether the compositional syntax and semantics attributed to mental representations by classical models can emerge within a connectionist network. The compatibility of the two paradigms hinges largely, I suggest, on how this question is answered. Focusing on the issue of syntax, I argue that while such structure is lacking in connectionist models with local representation, it can be accommodated within networks where representation is distributed. I discuss an important paper by Smolenski (1988) which attempts to show how connectionists can incorporate the relevant syntactic structure, suggesting that some criticisms levelled against that paper by Fodor & Pylyshyn (1988) are wanting. I then go on to indicate a strategy by which a compositional syntax and semantics can be defined for the sort of network that Smolenski describes. I conclude that since the connectionist can respect the central tenets of classicism, the two approaches are compatible with one another.

There is currently a debate over whether cognitive architecture is classical or connectionist in nature. One finds the following three comparisons between classical architecture and connectionist architecture made in the pro-connectionist literature in this debate: (1) connectionist architecture is neurally plausible and classical architecture is not; (2) connectionist architecture is far better suited to model pattern recognition capacities than is classical architecture; and (3) connectionist architecture is far better suited to model the acquisition of pattern recognition capacities by learning than is classical architecture. If true, (1)–(3) would yield a compelling case against the view that cognitive architecture is classical, and would offer some reason to think that cognitive architecture may be connectionist. We first present the case for (1)–(3) in the very words of connectionist enthusiasts. We then argue that the currently available evidence fails to support any of (1)–(3).

Connectionism is a style of modeling based upon networks of interconnected simple processing devices. This style of modeling goes by a number of other names too. Connectionist models are also sometimes referred to as 'Parallel Distributed Processing' (or PDP for short) models or networks.1 Connectionist systems are also sometimes referred to as 'neural networks' (abbreviated to NNs) or 'artificial neural networks' (abbreviated to ANNs). Although there may be some rhetorical appeal to this neural nomenclature, it is in fact misleading as connectionist networks are commonly significantly dissimilar to neurological systems. For this reason, I will avoid using this terminology, other than in direct quotations. Instead, I will follow the practice I have adopted above and use 'connectionist' as my primary term for systems of this kind.

Human cognition is said to be systematic: cognitive ability generalizes to structurally related behaviours. The connectionist approach to cognitive theorizing has been strongly criticized for its failure to explain systematicity. Demonstrations of generalization notwithstanding, I show that two widely used networks (feedforward and recurrent) do not support systematicity under the condition of local input/output representations. For a connectionist explanation of systematicity, these results leave two choices, either: (1) develop models capable of systematicity under local input/output representations; or (2) justify the choice of similarity-based (nonlocal) component representations sufficient for systematicity.

In their critique of connectionist models Fodor and Pylyshyn (1988) dismiss such models as not being cognitive or psychological. Evaluating Fodor and Pylyshyn's critique requires examining what is required in characterizating models as 'cognitive'. The present discussion examines the various senses of this term. It argues the answer to the title question seems to vary with these different senses. Indeed, by one sense of the term, neither representa-tionalism nor connectionism is cognitive. General ramifications of such an appraisal are discussed and alternative avenues for cognitive research are suggested.

Recently, connectionist models have been developed that seem to exhibit structuresensitive cognitive capacities without executing a program. This paper examines one such model and argues that it does execute a program. The argument proceeds by showing that what is essential to running a program is preserving the functional structure of the program. It has generally been assumed that this can only be done by systems possessing a certain temporalcausal organization. However, counterfactualpreserving functional architecture can be instantiated in other ways, for example geometrically, which are realizable by connectionist networks.

There is widespread belief that connectionist networks are dramatically different from classical or symbolic models. However, connectionists rarely test this belief by interpreting the internal structure of their nets. A new approach to interpreting networks was recently introduced by Berkeley et al. (1995). The current paper examines two implications of applying this method: (1) that the internal structure of a connectionist network can have a very classical appearance, and (2) that this interpretation can provide a cognitive theory that cannot be dismissed as a mere implementation.

Does connectionism spell doom for folk psychology? I examine the proposal that cognitive representational states such as beliefs can play no role if connectionist models - - interpreted as radical new cognitive theories -- take hold and replace other cognitive theories. Though I accept that connectionist theories are radical theories that shed light on cognition, I reject the conclusion that neural networks do not represent. Indeed, I argue that neural networks may actually give us a better working notion of cognitive representational states such as beliefs, and in so doing give us a better understanding of how these states might be instantiated in neural wetware.

Although connectionism is advocated by its proponents as an alternative to the classical computational theory of mind, doubts persist about its _computational_ credentials. Our aim is to dispel these doubts by explaining how connectionist networks compute. We first develop a generic account of computation—no easy task, because computation, like almost every other foundational concept in cognitive science, has resisted canonical definition. We opt for a characterisation that does justice to the explanatory role of computation in cognitive science. Next we examine what might be regarded as the “conventional” account of connectionist computation. We show why this account is inadequate and hence fosters the suspicion that connectionist networks aren’t genuinely computational. Lastly, we turn to the principal task of the paper: the development of a more robust portrait of connectionist computation. The basis of this portrait is an explanation of the representational capacities of connection weights, supported by an analysis of the weight configurations of a series of simulated neural networks.

This paper explores the question of whether connectionist models of cognition should be considered to be scientific theories of the cognitive domain. It is argued that in traditional scientific theories, there is a fairly close connection between the theoretical (unobservable) entities postulated and the empirical observations accounted for. In connectionist models, however, hundreds of theoretical terms are postulated -- viz., nodes and connections -- that are far removed from the observable phenomena. As a result, many of the features of any given connectionist model are relatively optional. This leads to the question of what, exactly, is learned about a cognitive domain modelled by a connectionist network.