In recent years, the family of algorithms collected under the term ``deep learning'' has revolutionized artificial intelligence, enabling machines to reach human-like performances in many complex cognitive tasks. Although deep learning models are grounded in the connectionist paradigm, their recent advances were basically developed with engineering goals in mind. Despite of their applied focus, deep learning models eventually seem fruitful for cognitive purposes. This can be thought as a kind of biological exaptation, where a physiological structure becomes applicable for a (...) function different from that for which it was selected. In this paper, it will be argued that it is time for cognitive science to seriously come to terms with deep learning, and we try to spell out the reasons why this is the case. First, the path of the evolution of deep learning from the connectionist project is traced, demonstrating the remarkable continuity, and the differences as well. Then, it will be considered how deep learning models can be useful for many cognitive topics, especially those where it has achieved performance comparable to humans, from perception to language. It will be maintained that deep learning poses questions that cognitive sciences should try to answer. One of such questions is the reasons why deep convolutional models that are disembodied, inactive, unaware of context, and static, are by far the closest to the patterns of activation in the brain visual system. (shrink)

At the beginning of the 20th century, Gestalt psychologists put forward the concept of psychoneural isomorphism, which was meant to replace Fechner’s obscure notion of psychophysical parallelism and provide a heuristics that may facilitate the search for the neural correlates of the mind. However, the concept has generated much confusion in the debate, and today its role is still unclear. In this contribution, I will attempt a little conceptual spadework in clarifying the concept of psychoneural isomorphism, focusing exclusively on conscious (...) visual perceptual experience and its neural correlates. Firstly, I will outline the history of our concept, and its alleged metaphysical and epistemic roles. Then, I will clarify the nature of isomorphism and rule out its metaphysical role. Finally, I will review some epistemic roles of our concept, zooming in on the work of Jean Petitot, and suggest that it does not play a relevant heuristic role. I conclude suggesting that psychoneural isomorphism might be an indicator of robustness for certain mathematical descriptions of perceptual content. (shrink)

This paper discusses the relevance of models for cognitive science that integrate mechanistic and computational aspects. Its main hypothesis is that a model of a cognitive system is satisfactory and explanatory to the extent that it bridges phenomena at multiple mechanistic levels, such that at least several of these mechanistic levels are shown to implement computational processes. The relevant parts of the computation must be mapped onto distinguishable entities and activities of the mechanism. The ideal is contrasted with two other (...) accounts of modeling in cognitive science. The first has been presented by David Marr in combination with a distinction of “levels of computation”. The second builds on a hierarchy of “mechanistic levels” in the sense of Carl Craver. It is argued that neither of the two accounts secures satisfactory explanations of cognitive systems. The mechanistic-computational ideal can be thought of as resulting from a fusion of Marr’s and Craver’s ideals. It is defended as adequate and plausible in light of scientific practice, and certain metaphysical background assumptions are discussed. (shrink)

Building on an overview of dual systems theories in behavioural economics, the paper presents a methodological assessment in terms of the mechanistic explanations framework that has gained prominence in philosophy of the neurosciences. I conclude that they fail to meet the standards of causal explanations and I suggest an alternative ‘dual functions’ view based on Marr’s methodology of computational neuroscience. Recent psychological and neuroscience research undermines the case for a categorization of brain processes in terms of properties such as relative (...) speed. I defend an interpretation of dualities as functional, without assigning them to specific neurophysiological structures. (shrink)

It is generally accepted that, in the cognitive and neural sciences, there are both computational and mechanistic explanations. We ask how computational explanations can integrate into the mechanistic hierarchy. The problem stems from the fact that implementation and mechanistic relations have different forms. The implementation relation, from the states of an abstract computational system to the physical, implementing states is a homomorphism mapping relation. The mechanistic relation, however, is that of part/whole; the explaining features in a mechanistic explanation are the (...) components of the explanandum phenomenon and their causal organization. Moreover, each component in one level of mechanism is constituted and explained by components of an underlying level of mechanism. Hence, it seems, computational variables and functions cannot be mechanistically explained by the medium-dependent states and properties that implement them. How then, do the computational and the implementational integrate to create the mechanistic hierarchy? After explicating the general problem, we further demonstrate it through a concrete example, of reinforcement learning, in the cognitive and neural sciences. We then examine two possible solutions. On one solution, the mechanistic hierarchy embeds at the same levels computational and implementational properties. This picture fits with the view that computational explanations are mechanistic sketches. On the other solution, there are two separate hierarchies, one computational and another implementational, which are related by the implementation relation. This picture fits with the view that computational explanations are functional and autonomous explanations. It is less clear how these solutions fit with the view that computational explanations are full-fledged mechanistic explanations. Finally, we argue that both pictures are consistent with the reinforcement learning example, but that scientific practice does not align with the view that computational models are merely mechanistic sketches. (shrink)

Computational explanations focus on information processing required in specific cognitive capacities, such as perception, reasoning or decision-making. These explanations specify the nature of the information processing task, what information needs to be represented, and why it should be operated on in a particular manner. In this article, the focus is on three questions concerning the nature of computational explanations: What type of explanations they are, in what sense computational explanations are explanatory and to what extent they involve a special, “independent” (...) or “autonomous” level of explanation. In this paper, we defend the view computational explanations are genuine explanations, which track non-causal/formal dependencies. Specifically, we argue that they do not provide mere sketches for explanation, in contrast to what for example Piccinini and Craver :283–311, 2011) suggest. This view of computational explanations implies some degree of “autonomy” for the computational level. However, as we will demonstrate that does not make this view “computationally chauvinistic” in a way that Piccinini or Kaplan :339–373, 2011) have charged it to be. (shrink)

Opponents of the computational theory of mind have held that the theory is devoid of explanatory content, since whatever computational procedures are said to account for our cognitive attributes will also be realized by a host of other ‘deviant’ physical systems, such as buckets of water and possibly even stones. Such ‘triviality’ claims rely on a simple mapping account of physical implementation. Hence defenders of CTM traditionally attempt to block the trivialization critique by advocating additional constraints on the implementation relation. (...) However, instead of attempting to ‘save’ CTM by constraining the account of physical implementation, I argue that the general form of the triviality argument is invalid. I provide a counterexample scenario, and show that SMA is in fact consistent with empirically rich and theoretically plausible versions of CTM. This move requires rejection of the computational sufficiency thesis, which I argue is scientifically unjustified in any case. By shifting the ‘burden of explanatory force’ away from the concept of physical implementation, and instead placing it on salient aspects of the target phenomenon to be explained, it’s possible to retain a maximally liberal and unfettered view of physical implementation, and at the same time defuse the triviality arguments that have motivated defenders of CTM to impose various theory-laden constraints on SMA. (shrink)

Descriptive abstraction means omission of information from descriptions of phenomena. In this paper, I introduce a distinction between vertical and horizontal descriptive abstraction. Vertical abstracts away levels of mechanism or organization, while horizontal abstracts away details within one level of organization. The distinction is implicit in parts of the literature, but it has received insufficient attention and gone mainly unnoticed. I suggest that the distinction can be used to clarify how computational descriptions are formed in some variants of the mechanistic (...) account of physical computation. Furthermore, I suggest that, if this suggestion is adopted, it can be used to resolve what I call abstraction, hierarchy, and generality problems raised against mechanistic account of physical computation. According to the abstraction problem, the mechanistic account of physical computation is conceptually confused in claiming that physical systems process computational, abstract properties. An existing solution distinguishes between descriptive and metaphysical abstraction, suggesting that the abstraction problem unnecessarily postulates metaphysically abstract entities. The solution has been criticized for leading to what I call hierarchy and generality problems: it results in two separate hierarchies, one physical and one computational, making it problematic both to account for the generality of computational descriptions and to specify how the two hierarchies are related to each other. Adopting the vertical-horizontal distinction and the view that computational descriptions are achieved by horizontal abstraction allows one to account for the generality of computational descriptions, and to form a single hierarchy in which there are no separate hierarchies in need of integration. (shrink)

Mechanism realists assert the existence of mechanisms as objective structures in the world, but their exact metaphysical commitments are unclear. We introduce Local Hierarchy Realism (LHR) as a substantive and plausible form of mechanism realism. The limits of LHR reveal a deep tension between two aspects of mechanists’ explanatory strategy. Functional decomposition identifies locally relevant entities and activities, while these same entities and activities are also embedded in a nested hierarchy of levels. In principle, a functional decomposition may identify entities (...) engaging in causal interactions that crosscut the hierarchical structure of composition relations, violating the mechanist’s injunction against interlevel causation. We argue that this possibility is realized in the example of ephaptic coupling, a subsidiary process of neural computation that crosscuts the hierarchy derived from synaptic transmission. These considerations undermine the plausibility of LHR as a general view, yet LHR has the advantages that (i) its metaphysical implications are precisely stateable; (ii) the structure it identifies is not reducible to mere aggregate causation; and (iii) it clearly satisfies intuitive and informal definitions of mechanism. We conclude by assessing the prospects for a form of mechanism realism weaker than LHR that nevertheless satisfies all three of these requirements. (shrink)

Dynamical systems play a central role in explanations in cognitive neuroscience. The grounds for these explanations are hotly debated and generally fall under two approaches: non-mechanistic and mechanistic. In this paper, I first outline a neurodynamical explanatory schema that highlights the role of dynamical systems in cognitive phenomena. I next explore the mechanistic status of such neurodynamical explanations. I argue that these explanations satisfy only some of the constraints on mechanistic explanation and should be considered pseudomechanistic explanations. I defend this (...) argument against three alternative interpretations of the neurodynamical explanatory schema. The independent interpretation holds that neurodynamical explanations and mechanisms are independent. The constitutive interpretation holds that neurodynamical explanations are constitutive but otherwise non-mechanistic. Both the independent and constitutive interpretations fail to account for all the features of neurodynamical explanations. The partial interpretation assumes that the targets of dynamical systems models are mechanisms and so holds that neurodynamical explanations are incomplete because they lack mechanistic details. I contend instead that the targets of those models are dynamical systems distinct from mechanisms and defend this claim against several objections. I conclude with a defense of the pseudomechanistic interpretation and a discussion of the source of their explanatory power in relation to a causal-mechanical description of the world. (shrink)

The mechanistic view of computation contends that computational explanations are mechanistic explanations. Mechanists, however, disagree about the precise role that the environment – or the so-called “contextual level” – plays for computational explanations. We advance here two claims: Contextual factors essentially determine the computational identity of a computing system ; this means that specifying the “intrinsic” mechanism is not sufficient to fix the computational identity of the system. It is not necessary to specify the causal-mechanistic interaction between the system and (...) its context in order to offer a complete and adequate computational explanation. While the first claim has been discussed before, the second has been practically ignored. After supporting these claims, we discuss the implications of our contextualist view for the mechanistic view of computational explanation. Our aim is to show that some versions of the mechanistic view are consistent with the contextualist view, whilst others are not. (shrink)

An underlying assumption in computational approaches in cognitive and brain sciences is that the nervous system is an input–output model of the world: Its input–output functions mirror certain relations in the target domains. I argue that the input–output modelling assumption plays distinct methodological and explanatory roles. Methodologically, input–output modelling serves to discover the computed function from environmental cues. Explanatorily, input–output modelling serves to account for the appropriateness of the computed function to the explanandum information-processing task. I compare very briefly the (...) modelling explanation to mechanistic and optimality explanations, noting that in both cases the explanations can be seen as complementary rather than contrastive or competing. (shrink)

A popular view presents explanations in the cognitive sciences as causal or mechanistic and argues that an important feature of such explanations is that they allow us to manipulate and control the explanandum phenomena. Nonetheless, whether there can be explanations in the cognitive sciences that are neither causal nor mechanistic is still under debate. Another prominent view suggests that both causal and non-causal relations of counterfactual dependence can be explanatory, but this view is open to the criticism that it is (...) not clear how to distinguish explanatory from non-explanatory relations. In this paper, I draw from both views and suggest that, in the cognitive sciences, relations of counterfactual dependence that allow manipulation and control can be explanatory even when they are neither causal nor mechanistic. Furthermore, the ability to allow manipulation can determine whether non-causal counterfactual dependence relations are explanatory. I present a preliminary framework for manipulation relations that includes some non-causal relations and use two examples from the cognitive sciences to show how this framework distinguishes between explanatory and non-explanatory, non-causal relations. The proposed framework suggests that, in the cognitive sciences, causal and non-causal relations have the same criterion for explanatory value, namely, whether or not they allow manipulation and control. (shrink)

The mechanistic view of computation contends that computational explanations are mechanistic explanations. Mechanists, however, disagree about the precise role that the environment – or the so-called “contextual level” – plays for computational explanations. We advance here two claims: Contextual factors essentially determine the computational identity of a computing system ; this means that specifying the “intrinsic” mechanism is not sufficient to fix the computational identity of the system. It is not necessary to specify the causal-mechanistic interaction between the system and (...) its context in order to offer a complete and adequate computational explanation. While the first claim has been discussed before, the second has been practically ignored. After supporting these claims, we discuss the implications of our contextualist view for the mechanistic view of computational explanation. Our aim is to show that some versions of the mechanistic view are consistent with the contextualist view, whilst others are not. (shrink)

In a recent article in this Journal, Fumagalli argues that economists are provisionally justified in resisting prominent calls to integrate neural variables into economic models of choice. In other articles, various authors engage with Fumagalli’s argument and try to substantiate three often-made claims concerning neuroeconomic modelling. First, the benefits derivable from neurally informing some economic models of choice do not involve significant tractability costs. Second, neuroeconomic modelling is best understood within Marr’s three-level of analysis framework for information-processing systems. And third, (...) neural findings enable choice modellers to confirm the causal relevance of variables posited by competing economic models, identify causally relevant variables overlooked by existing models, and explain observed behavioural variability better than standard economic models. In this paper, I critically examine these three claims and respond to the related criticisms of Fumagalli’s argument. Moreover, I qualify and extend Fumagalli’s account of how trade-offs between distinct modelling desiderata hamper neuroeconomists’ attempts to improve economic models of choice. I then draw on influential neuroeconomic studies to argue that even the putatively best available neural findings fail to substantiate current calls for a neural enrichment of economic models. (shrink)

Mechanism realists assert the existence of mechanisms as objective structures in the world, but their exact metaphysical commitments are unclear. We introduce Local Hierarchy Realism (LHR) as a substantive and plausible form of mechanism realism. The limits of LHR reveal a deep tension between two aspects of mechanists’ explanatory strategy. Functional decomposition identifies locally relevant entities and activities, while these same entities and activities are also embedded in a nested hierarchy of levels. In principle, a functional decomposition may identify entities (...) engaging in causal interactions that crosscut the hierarchical structure of composition relations, violating the mechanist’s injunction against interlevel causation. We argue that this possibility is realized in the example of ephaptic coupling, a subsidiary process of neural computation that crosscuts the hierarchy derived from synaptic transmission. These considerations undermine the plausibility of LHR as a general view, yet LHR has the advantages that (i) its metaphysical implications are precisely stateable; (ii) the structure it identifies is not reducible to mere aggregate causation; and (iii) it clearly satisfies intuitive and informal definitions of mechanism. We conclude by assessing the prospects for a form of mechanism realism weaker than LHR that nevertheless satisfies all three of these requirements. (shrink)

The aim of this paper is to begin developing a version of Gualtiero Piccinini’s mechanistic account of computation that does not need to appeal to any notion of proper functions. The motivation for doing so is a general concern about the role played by proper functions in Piccinini’s account, which will be evaluated in the first part of the paper. I will then propose a potential alternative approach, where computing mechanisms are understood in terms of Carl Craver’s perspectival account of (...) mechanistic functions. According to this approach, the mechanistic function of ‘performing a computation’ can only be attributed relative to an explanatory perspective, but such attributions are nonetheless constrained by the underlying physical structure of the system in question, thus avoiding unlimited pancomputationalism. If successful, this approach would carry with it fewer controversial assumptions than Piccinini’s original account, which requires a robust understanding of proper functions. Insofar as there are outstanding concerns about the status of proper functions, this approach would therefore be more generally acceptable. (shrink)