Probabilistic models of sentence comprehension are increasingly relevant to questions concerning human language processing. However, such models are often limited to syntactic factors. This restriction is unrealistic in light of experimental results suggesting interactions between syntax and other forms of linguistic information in human sentence processing. To address this limitation, this article introduces two sentence processing models that augment a syntactic component with information about discourse co-reference. The novel combination of probabilistic syntactic components with co-reference classifiers permits them (...) to more closely mimic human behavior than existing models. The first model uses a deep model of linguistics, based in part on probabilistic logic, allowing it to make qualitative predictions on experimental data; the second model uses shallow processing to make quantitative predictions on a broad-coverage reading-time corpus. (shrink)

This paper examines a promising probabilistic theory of singular causation developed by David Lewis. I argue that Lewis' theory must be made more sophisticated to deal with certain counterexamples involving pre-emption. These counterexamples appear to show that in the usual case singular causation requires an unbroken causal process to link cause with effect. I propose a new probabilistic account of singular causation, within the framework developed by Lewis, which captures this intuition.

We introduce a novel modal logic, namely the doxastic μ-calculus with error control (DμCEC), and propose a formalization of probabilistic anonymity and oblivious transfer in the logic, and the validation of these formalizations on implementations formalized in probabilistic CCS. The distinguishing feature of our logic is to provide a combination of dynamic operators for belief (whence the attribute “doxastic”) with a control on the possible error of apprehension of the perceived reality, and for internalized probability. Both operators are (...) dynamic (non-monotonic) thanks to the possibility of combining them with temporal operators, and are parameterized with a lower and upper probability bound (the error control). (shrink)

Probabilistic methods are providing new explanatory approaches to fundamental cognitive science questions of how humans structure, process and acquire language. This review examines probabilistic models defined over traditional symbolic structures. Language comprehension and production involve probabilistic inference in such models; and acquisition involves choosing the best model, given innate constraints and linguistic and other input. Probabilistic models can account for the learning and processing of language, while maintaining the sophistication of symbolic models. A recent burgeoning of (...) theoretical developments and online corpus creation has enabled large models to be tested, revealing probabilistic constraints in processing, undermining acquisition arguments based on a perceived poverty of the stimulus, and suggesting fruitful links with probabilistic theories of categorization and ambiguity resolution in perception. (shrink)

Experimental research shows that human sentence processing uses information from different levels of linguistic analysis, for example, lexical and syntactic preferences as well as semantic plausibility. Existing computational models of human sentence processing, however, have focused primarily on lexico‐syntactic factors. Those models that do account for semantic plausibility effects lack a general model of human plausibility intuitions at the sentence level. Within a probabilistic framework, we propose a wide‐coverage model that both assigns thematic roles to verb–argument pairs and determines (...) a preferred interpretation by evaluating the plausibility of the resulting (verb, role, argument) triples. The model is trained on a corpus of role‐annotated language data. We also present a transparent integration of the semantic model with an incremental probabilistic parser. We demonstrate that both the semantic plausibility model and the combined syntax/semantics model predict judgment and reading time data from the experimental literature. (shrink)

'The Probabilistic Mind' is a follow-up to the influential and highly cited 'Rational Models of Cognition'. It brings together developments in understanding how, and how far, high-level cognitive processes can be understood in rational terms, and particularly using probabilistic Bayesian methods.

The evolution of a single trapped ion exhibiting intermittent fluorescence and dark periods may be described either as a continuous process, using differential rate equations, or discretely, as a Markov process. The latter models the atom as making instantaneous transitions from one energy eigenstate to another, and is open to the objection that superpositions of energy states will form which are not covered by the Markov process. The superposition objection is replied to, and two new mathematical elements, Markov vectors and (...) Markov matrices, are proposed as additions to quantum theory. The paper concludes by attributing the cause of dark periods in the ion's history to instantaneous transitions in the ion itself, rather than to photon detection or other components of measurement. (shrink)

Words are the essence of communication: They are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisition: Children must first learn words before they can combine them into complex utterances. Many theories have been developed to explain the impressive efficiency of young children in acquiring the vocabulary of their language, as well as the developmental patterns observed in the course of lexical acquisition. A major source of disagreement (...) among the different theories is whether children are equipped with special mechanisms and biases for word learning, or their general cognitive abilities are adequate for the task. We present a novel computational model of early word learning to shed light on the mechanisms that might be at work in this process. The model learns word meanings as probabilistic associations between words and semantic elements, using an incremental and probabilistic learning mechanism, and drawing only on general cognitive abilities. The results presented here demonstrate that much about word meanings can be learned from naturally occurring child-directed utterances (paired with meaning representations), without using any special biases or constraints, and without any explicit developmental changes in the underlying learning mechanism. Furthermore, our model provides explanations for the occasionally contradictory child experimental data, and offers predictions for the behavior of young word learners in novel situations. (shrink)

Does perceptual consciousness require cognitive access? Ned Block argues that it does not. Central to his case are visual memory experiments that employ post-stimulus cueing—in particular, Sperling's classic partial report studies, change-detection work by Lamme and colleagues, and a recent paper by Bronfman and colleagues that exploits our perception of ‘gist’ properties. We argue contra Block that these experiments do not support his claim. Our reinterpretations differ from previous critics' in challenging as well a longstanding and common view of visual (...) memory as involving declining capacity across a series of stores. We conclude by discussing the relation of probabilistic perceptual representations and phenomenal consciousness. (shrink)

We describe a new approach for developing and validating cognitive process models. We develop graphical models (specifically, hidden Markov models) both from human empirical data on a task, as well as from synthetic data traces generated by a cognitive process model of human behavior on the task. We show that considering differences between the two graphical models can unveil substantive and nuanced imperfections of cognitive process models that can then be addressed to increase their fidelity to empirical data.

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 (...) purely inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

This article introduces the notion of the directedness of a process, which underlies event causation as well as the persistence of things. Using this notion it investigates what happens in typical cases of active event causation. Causes never necessitate their effects because even non- probabilistic causes can be counteracted.

We introduce a set of biologically and computationally motivated design choices for modeling the learning of language, or of other types of sequential, hierarchically structured experience and behavior, and describe an implemented system that conforms to these choices and is capable of unsupervised learning from raw natural-language corpora. Given a stream of linguistic input, our model incrementally learns a grammar that captures its statistical patterns, which can then be used to parse or generate new data. The grammar constructed in this (...) manner takes the form of a directed weighted graph, whose nodes are recursively (hierarchically) defined patterns over the elements of the input stream. We evaluated the model in seventeen experiments, grouped into five studies, which examined, respectively, (a) the generative ability of grammar learned from a corpus of natural language, (b) the characteristics of the learned representation, (c) sequence segmentation and chunking, (d) artificial grammar learning, and (e) certain types of structure dependence. The model's performance largely vindicates our design choices, suggesting that progress in modeling language acquisition can be made on a broad front—ranging from issues of generativity to the replication of human experimental findings—by bringing biological and computational considerations, as well as lessons from prior efforts, to bear on the modeling approach. (shrink)

The main aim of this paper is to provide some probabilistic notions on causality proposed to be applied to the nomic statements which intend to give account of the indeterministic processes within the domain of a scientific theory. In general, such statements are, in more or less extent, idealized statements which rest on a variety of unrealistic suppositions. I try to show how the probability distribution over the final states of an indeterministic process changes accordingly as the nomic (...) statement in question is de-idealized by means of addition of the causally relevant factors. In order to illustrate the study I take few nomic statements from population genetics. Besides, in the course, I attempt to contrast the ideas embraced here with some of the notions of Humphreys´ ontic conceptions of causality and explanation, which are contrary to the epistemic view adopted here about those subjects. (shrink)

We introduce a set of biologically and computationally motivated design choices for modeling the learning of language, or of other types of sequential, hierarchically structured experience and behavior, and describe an implemented system that conforms to these choices and is capable of unsupervised learning from raw natural‐language corpora. Given a stream of linguistic input, our model incrementally learns a grammar that captures its statistical patterns, which can then be used to parse or generate new data. The grammar constructed in this (...) manner takes the form of a directed weighted graph, whose nodes are recursively (hierarchically) defined patterns over the elements of the input stream. We evaluated the model in seventeen experiments, grouped into five studies, which examined, respectively, (a) the generative ability of grammar learned from a corpus of natural language, (b) the characteristics of the learned representation, (c) sequence segmentation and chunking, (d) artificial grammar learning, and (e) certain types of structure dependence. The model's performance largely vindicates our design choices, suggesting that progress in modeling language acquisition can be made on a broad front—ranging from issues of generativity to the replication of human experimental findings—by bringing biological and computational considerations, as well as lessons from prior efforts, to bear on the modeling approach. (shrink)

Nick Shea’s Representation in Cognitive Science commits him to representations in perceptual processing that are about probabilities. This commentary concerns how to adjudicate between this view and an alternative that locates the probabilities rather in the representational states’ associated “attitudes”. As background and motivation, evidence for probabilistic representations in perceptual processing is adduced, and it is shown how, on either conception, one can address a specific challenge Ned Block has raised to this evidence.

The problems of access—retrieving linguistic structure from some mental grammar —and disambiguation—choosing among these structures to correctly parse ambiguous linguistic input—are fundamental to language understanding. The literature abounds with psychological results on lexical access, the access of idioms, syntactic rule access, parsing preferences, syntactic disambiguation, and the processing of garden‐path sentences. Unfortunately, it has been difficult to combine models which account for these results to build a general, uniform model of access and disambiguation at the lexical, idiomatic, and syntactic levels. (...) For example, psycholinguistic theories of lexical access and idiom access and parsing theories of syntactic rule access have almost no commonality in methodology or coverage of psycholinguistic data. This article presents a single probabilistic algorithm which models both the access and disambiguation of linguistic knowledge. The algorithm is based on a parallel parser which ranks constructions for access, and interpretations for disambiguation, by their conditional probability. Low‐ranked constructions and interpretations are pruned through beam‐search; this pruning accounts, among other things, for the garden‐path effect. I show that this motivated probabilistic treatment accounts for a wide variety of psycholinguistic results, arguing for a more uniform representation of linguistic knowledge and for the use of probabilistically‐enriched grammars and interpreters as models of human knowledge of and processing of language. (shrink)

Provides a critical analysis and comparison of the theories of probabilistic causality offered by Hans Reichenbach I.J. Good and Patrick Suppes. Each of these theories faces some fundamental difficulties. In the end, the author argues that probabilistic causality cannot be explicated in terms of statistical relations among discrete events alone. Instead, we must take into account the physical processes that provide causal connections among events. In the time since this essay was first written, the literature on (...) class='Hi'>probabilistic causality has burgeoned, and the topic has become a major area of concern to many philosophers. (shrink)

A detailed treatment regarding the diverse properties and uses of evidence and the judgmental tasks they entail. Examines various processes by which evidence may be developed or discovered. Considers the construction of arguments made in defense of the relevance and credibility of individual items and masses of evidence as well as the task of assessing the inferential force of evidence. Includes over 100 numerical examples to illustrate the workings of diverse probabilistic expressions for the inferential force of evidence (...) and the subtleties they reveal. (shrink)

The probabilistic analysis of functional questions is maturing into a rigorous and coherent research paradigm that may unify the cognitive sciences, from the study of single neurons in the brain to the study of high level cognitive processes and distributed cognition. Endless debates about undecidable structural issues (modularity vs. interactivity, serial vs. parallel processing, iconic vs. propositional representations, symbolic vs. connectionist models) may be put aside in favor of a rigorous understanding of the problems solved by organisms in (...) their natural environments. [Shepard; Tenenbaum & Griffiths]. (shrink)

The author uses a series of examples to illustrate two versions of a new, nonprobabilist principle of epistemic rationality, the special and general versions of the metacognitive, expected relative frequency principle. These are used to explain the rationality of revisions to an agent’s degrees of confidence in propositions based on evidence of the reliability or unreliability of the cognitive processes responsible for them—especially reductions in confidence assignments to propositions antecedently regarded as certain—including certainty-reductions to instances of the law of (...) excluded middle or the law of noncontradiction in logic or certainty-reductions to the certainties of probabilist epistemology. The author proposes special and general versions of the MERF principle and uses them to explain the examples, including the reasoning that would lead to thoroughgoing fallibilism—that is, to a state of being certain of nothing. The author responds to the main defenses of probabilism: Dutch Book arguments, Joyce’s potential accuracy defense, and the potential calibration defenses of Shimony and van Fraassen by showing that, even though they do not satisfy the probability axioms, degrees of belief that satisfy the MERF principle minimize expected inaccuracy in Joyce’s sense; they can be externally calibrated in Shimony and van Fraassen’s sense; and they can serve as a basis for rational betting, unlike probabilist degrees of belief, which, in many cases, human beings have no rational way of ascertaining. The author also uses the MERF principle to subsume the various epistemic akrasia principles in the literature. Finally, the author responds to Titelbaum’s argument that epistemic akrasia principles require that we be certain of some epistemological beliefs, if we are rational. (shrink)

We present a probabilistic extension to active path analyses of token causation (Halpern & Pearl 2001, forthcoming; Hitchcock 2001). The extension uses the generalized notion of intervention presented in (Korb et al. 2004): we allow an intervention to set any probability distribution over the intervention variables, not just a single value. The resulting account can handle a wide range of examples. We do not claim the account is complete --- only that it fills an obvious gap in previous active-path (...) approaches. It still succumbs to recent counterexamples by Hiddleston (2005), because it does not explicitly consider causal processes. We claim three benefits: a detailed comparison of three active-path approaches, a probabilistic extension for each, and an algorithmic formulation. (shrink)

Salmon has argued that science provides explanations by describing a causal nexus: For Salmon, this nexus is a network of processes and interactions. I argue that this picture of the causal nexus is insufficient for an account of scientific explanation: a taxonomy of causal relevance is also needed. ;Probabilistic theories of causation seem to provide such a taxonomy in their dichotomy between promoting and inhibiting causes. However, standard probabilistic theories are beset by a difficulty called the problem (...) of disjunctive factors. According to such theories, an effect is more probable in the presence of a cause than in its absence . But there are many ways in which a particular cause may come about, and many in which it may be absent; these ways need not confer the same probabilities upon the effect. Thus, there is no direct comparison of two probabilities to be made. My solution is to abandon the oversimplified dichotomy between promoting and inhibiting causes. Causal claims convey qualitative information about more complex probabilistic relationships. Interestingly, this picture of causation meshes naturally with extant theories of explanation. ;I show how this framework may be employed in resolving several outstanding problems in the theories of causation and explanation, such as the relationship between singular and general causal claims, and the role of contrastive stress in causal and explanatory claims. ;Finally, I show how my account of causal explanation can be connected with the semantic conception of scientific theories. According to this conception, a theory is characterized in terms of a class of mathematical models. I describe the relationship between these mathematical models and the probabilistic relationships that are described by causal explanations. These ideas are illustrated in an extended discussion of causation and explanation in evolutionary theory. (shrink)

Theories of relational concept acquisition based on structured intersection discovery predict that relational concepts with a probabilistic structure ought to be extremely difficult to learn. We report four experiments testing this prediction by investigating conditions hypothesized to facilitate the learning of such categories. Experiment 1 showed that changing the task from a category-learning task to choosing the “winning” object in each stimulus greatly facilitated participants' ability to learn probabilistic relational categories. Experiments 2 and 3 further investigated the mechanisms (...) underlying this “who's winning” effect. Experiment 4 replicated and generalized the “who's winning” effect with more natural stimuli. Together, our findings suggest that people learn relational concepts by a process of intersection discovery akin to schema induction, and that any task that encourages people to discover a higher order relation that remains invariant over members of a category will facilitate the learning of putatively probabilistic relational concepts. (shrink)

This paper explores the idea that vague predicates like “tall”, “loud” or “expensive” are applied based on a process of analog magnitude representation, whereby magnitudes are represented with noise. I present a probabilistic account of vague judgment, inspired by early remarks from E. Borel on vagueness, and use it to model judgments about borderline cases. The model involves two main components: probabilistic magnitude representation on the one hand, and a notion of subjective criterion. The framework is used to (...) represent judgments of the form “x is clearly tall” versus “x is tall”, as involving a shift of one’s criterion, and then to derive observed patterns of acceptance for borderline contradictions, namely sentences of the form “x is tall and not tall”, relative to the acceptance of their conjuncts. (shrink)

We introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of ML-randomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.

When we perceive the external world, our brain has to deal with the incompleteness and uncertainty associated with sensory inputs, memory and prior knowledge. In theoretical neuroscience probabilistic approaches have received a growing interest recently, as they account for the ability to reason with incomplete knowledge and to efficiently describe perceptive and behavioral tasks. How can the probability distributions that need to be estimated in these models be represented and processed in the brain, in particular at the single cell (...) level? We consider the basic function carried out by photoreceptor cells which consists in detecting the presence or absence of light. We give a system-level understanding of the process of phototransduction based on a bayesian formalism: we show that the process of phototransduction is equivalent to a temporal probabilistic inference in a Hidden Markov Model (HMM), for estimating the presence or absence of light. Thus, the biochemical mechanisms of phototransduction underlie the estimation of the current state probability distribution of the presence of light. A classical descriptive model describes the interactions between the different molecular messengers, ions, enzymes and channel proteins occurring within the photoreceptor by a set of nonlinear coupled differential equations. In contrast, the probabilistic HMM model is described by a discrete recurrence equation. It appears that the binary HMM has a general solution in the case of constant input. This allows a detailed analysis of the dynamics of the system. The biochemical system and the HMM behave similarly under steady-state conditions. Consequently a formal equivalence can be found between the biochemical system and the HMM. Numerical simulations further extend the results to the dynamic case and to noisy input. All in all, we have derived a probabilistic model equivalent to a classical descriptive model of phototransduction, which has the additional advantage of assigning a function to phototransduction. The example of phototransduction shows how simple biochemical interactions underlie simple probabilistic inferences. (shrink)

We present a probabilistic extension to active path analyses of token causation. The extension uses the generalized notion of intervention presented in : we allow an intervention to set any probability distribution over the intervention variables, not just a single value. The resulting account can handle a wide range of examples. We do not claim the account is complete --- only that it fills an obvious gap in previous active-path approaches. It still succumbs to recent counterexamples by Hiddleston, because (...) it does not explicitly consider causal processes. We claim three benefits: a detailed comparison of three active-path approaches, a probabilistic extension for each, and an algorithmic formulation. (shrink)

The formalism of general probabilistic theories provides a universal paradigm that is suitable for describing various physical systems including classical and quantum ones as particular cases. Contrary to the usual no-restriction hypothesis, the set of accessible meters within a given theory can be limited for different reasons, and this raises a question of what restrictions on meters are operationally relevant. We argue that all operational restrictions must be closed under simulation, where the simulation scheme involves mixing and classical post-processing (...) of meters. We distinguish three classes of such operational restrictions: restrictions on meters originating from restrictions on effects; restrictions on meters that do not restrict the set of effects in any way; and all other restrictions. We fully characterize the first class of restrictions and discuss its connection to convex effect subalgebras. We show that the restrictions belonging to the second class can impose severe physical limitations despite the fact that all effects are accessible, which takes place, e.g., in the unambiguous discrimination of pure quantum states via effectively dichotomic meters. We further demonstrate that there are physically meaningful restrictions that fall into the third class. The presented study of operational restrictions provides a better understanding on how accessible measurements modify general probabilistic theories and quantum theory in particular. (shrink)

The question of whether humans represent grammatical knowledge as a binary condition on membership in a set of well-formed sentences, or as a probabilistic property has been the subject of debate among linguists, psychologists, and cognitive scientists for many decades. Acceptability judgments present a serious problem for both classical binary and probabilistic theories of grammaticality. These judgements are gradient in nature, and so cannot be directly accommodated in a binary formal grammar. However, it is also not possible to (...) simply reduce acceptability to probability. The acceptability of a sentence is not the same as the likelihood of its occurrence, which is, in part, determined by factors like sentence length and lexical frequency. In this paper, we present the results of a set of large-scale experiments using crowd-sourced acceptability judgments that demonstrate gradience to be a pervasive feature in acceptability judgments. We then show how one can predict acceptability judgments on the basis of probability by augmenting probabilistic language models with an acceptability measure. This is a function that normalizes probability values to eliminate the confounding factors of length and lexical frequency. We describe a sequence of modeling experiments with unsupervised language models drawn from state-of-the-art machine learning methods in natural language processing. Several of these models achieve very encouraging levels of accuracy in the acceptability prediction task, as measured by the correlation between the acceptability measure scores and mean human acceptability values. We consider the relevance of these results to the debate on the nature of grammatical competence, and we argue that they support the view that linguistic knowledge can be intrinsically probabilistic. (shrink)

Hans Reichenbach’s posthumous book The Direction of Time ends somewhere between Socratic aporia and historical irony. Prompted by Feynman’s diagrammatic formulation of quantum electrodynamics, Reichenbach eventually abandoned the delicate balancing between the macroscopic foundation of the direction of time and microscopic descriptions of time order undertaken throughout the previous chapters in favor of an exclusively macroscopic theory that he had vehemently rejected in the 1920s. I analyze Reichenbach’s reasoning against the backdrop of the history of Feynman diagrams and the current (...) practice of particle physics. Building upon the debates about processes and conserved quantities between Wesley Salmon and Phil Dowe in the 1990s, and the exchange between Reichenbach and the gestalt theorist Kurt Lewin during the 1920s about topology and genidentity, I investigate whether the aporia about local time order could be avoided by following a strategy that Reichenbach adopted elsewhere in the book and develop a notion of functional genidentity that captures the practice of present-day elementary particle physics and the fact that Feynman diagrams have to be understood in the context of a complex mathematical description of scattering processes. (shrink)

Recent work combining cognitive neuroscience with computational modelling suggests that distributed patterns of neural firing may represent probability distributions. This paper asks: what makes it the case that distributed patterns of firing, as well as carrying information about (correlating with) probability distributions over worldly parameters, represent such distributions? In examples of probabilistic population coding, it is the way information is used in downstream processing so as to lead to successful behaviour. In these cases content depends on factors beyond bare (...) information, contra Brian Skyrms’ (2010) view that representational content can be fully characterised in information-theoretic terms. (shrink)

Legal probabilism is the view that juridical fact-finding should be modeled using Bayesian methods. One of the alternatives to it is the narration view, according to which instead we should conceptualize the process in terms of competing narrations of what happened. The goal of this paper is to develop a reconciliatory account, on which the narration view is construed from the Bayesian perspective within the framework of formal Bayesian epistemology.

A central problem in the cognitive sciences is identifying the link between consciousness and neural computation. The key features of consciousness—including the emergence of representative information content and the initiation of volitional action—are correlated with neural activity in the cerebral cortex, but not computational processes in spinal reflex circuits or classical computing architecture. To take a new approach toward considering the problem of consciousness, it may be worth re‐examining some outstanding puzzles in neuroscience, focusing on differences between the cerebral (...) cortex and spinal reflex circuits. First, the mammalian cerebral cortex exhibits exascale computational power, a feature that is not strictly correlated with the number of binary computational units; second, individual computational units engage in noisy coding, allowing random electrical events to gate signaling outcomes; third, this noisy coding results in the synchronous firing of statistically random populations of cells across the neural network, at a range of nested frequencies; fourth, the system grows into a more ordered state over time, as it encodes the predictive value gained through observation; and finally, the cerebral cortex is extraordinarily energy efficient, with very little free energy lost to entropy during the work of information processing. Here, I argue that each of these five key features suggest the mammalian brain engages in probabilistic computation. Indeed, by modeling the physical mechanisms of probabilistic computation, we may find a better way to explain the unique emergent features arising from cortical neural networks. (shrink)

We present an interdisciplinary approach to study systematic relations between logical form and attacks between claims in an argumentative framework. We propose to generalize qualitative attack principles by quantitative ones. Specifically, we use coherent conditional probabilities to evaluate the rationality of principles which govern the strength of argumentative attacks. Finally, we present an experiment which explores the psychological plausibility of selected attack principles.

In coal mining industry, the running state of mine ventilators plays an extremely significant role for the safe and reliable operation of various industrial productions. To guarantee the better reliability, safety, and economy of mine ventilators, in view of early detection and effective fault diagnosis of mechanical faults which could prevent unscheduled downtime and minimize maintenance fees, it is imperative to construct some viable mathematical models for mine ventilator fault diagnosis. In this article, we plan to establish a data-based mine (...) ventilator fault diagnosis method to handle situations where engineers are absent or they are incapable of coming to a conclusion from multisource data. In the process of building the mine ventilator fault diagnosis model, considering that probabilistic rough sets could reduce the errors triggered by incompleteness, inconsistency, and inaccuracy without needing any additional assumptions and Pythagorean fuzzy multigranulation rough sets over the two universes’ model could effectively handle data representation, fusion, and analysis issues, we generalize the existing PF MGRSs over the two universes’ model to the PRS setting, as well as to further establish a novel model named Pythagorean fuzzy multigranulation probabilistic rough sets over two universes. In the granular computing paradigm, three types of PF MG-PRSs over two universes based on the risk attitude of engineers are proposed at first. Afterwards, several basic propositions of the newly proposed model are explored. Moreover, a PF multigranulation probabilistic model for mine ventilator fault diagnosis based on PF MG-PRSs over two universes is investigated. At last, a real-world case study of dealing with a mine ventilator fault diagnosis problem is given to illustrate the practicality of the presented model, and a validity test, a sensitivity analysis, and a comparison analysis are further explored to demonstrate the effectiveness of the presented model. (shrink)

Memory limitations and probabilistic expectations are two key factors that have been posited to play a role in the incremental processing of natural language. Relative clauses (RCs) have long served as a key proving ground for such theories of language processing. Across three self-paced reading experiments, we test the online comprehension of Hungarian subject- and object-extracted RCs (SRCs and ORCs, respectively). We capitalize on the syntactic properties of Hungarian that allow for a variety of word orders within RCs, which (...) helps us to delineate the processing costs associated with memory demand and violated expectations. Results showed a processing cost at the RC verb for structures that have longer verb-argument distances, despite those structures being more frequent in the corpus. These findings thus support theories that attribute processing difficulty to memory limitations, rather than theories that attribute difficulty to less expected structures. (shrink)

The present study assessed the degree to which probabilistic reasoning performance and thinking style influenced perception of risk and self-reported levels of terrorism-related behaviour change. A sample of 263 respondents, recruited via convenience sampling, completed a series of measures comprising probabilistic reasoning tasks (perception of randomness, base rate, probability, and conjunction fallacy), the Reality Testing subscale of the Inventory of Personality Organization (IPO-RT), the Domain-Specific Risk-Taking Scale, and a terrorism-related behaviour change scale. Structural equation modelling examined three progressive (...) models. Firstly, the Independence Model assumed that probabilistic reasoning, perception of risk and reality testing independently predicted terrorism-related behaviour change. Secondly, the Mediation Model supposed that probabilistic reasoning and reality testing correlated, and indirectly predicted terrorism-related behaviour change through perception of risk. Lastly, the Dual-Influence Model proposed that probabilistic reasoning indirectly predicted terrorism-related behaviour change via perception of risk, independent of reality testing. Results indicated that performance on probabilistic reasoning tasks most strongly predicted perception of risk, and preference for an intuitive thinking style (measured by the IPO-RT) best explained terrorism-related behaviour change. The combination of perception of risk with probabilistic reasoning ability in the Dual-Influence Model enhanced the predictive power of the analytical-rational route, with conjunction fallacy having a significant indirect effect on terrorism-related behaviour change via perception of risk. The Dual-Influence Model possessed superior fit and reported similar predictive relations between intuitive-experiential and analytical-rational routes and terrorism-related behaviour change. The discussion critically examines these findings in relation to dual-processing frameworks. This includes considering the limitations of current operationalisations and recommendations for future research that align outcomes and subsequent work more closely to specific dual-process models. (shrink)

The area of smart power grids needs to constantly improve its efficiency and resilience, to provide high quality electrical power in a resilient grid, while managing faults and avoiding failures. Achieving this requires high component reliability, adequate maintenance, and a studied failure occurrence. Correct system operation involves those activities and novel methodologies to detect, classify, and isolate faults and failures and model and simulate processes with predictive algorithms and analytics. In this paper, we showcase the application of a complex-adaptive, (...) self-organizing modeling method, and Probabilistic Boolean Networks, as a way towards the understanding of the dynamics of smart grid devices, and to model and characterize their behavior. This work demonstrates that PBNs are equivalent to the standard Reinforcement Learning Cycle, in which the agent/model has an interaction with its environment and receives feedback from it in the form of a reward signal. Different reward structures were created to characterize preferred behavior. This information can be used to guide the PBN to avoid fault conditions and failures. (shrink)

Predictive processing models of psychopathologies are not explanatorily consistent with the present account of abstract thought. These models are based on latent variables probabilistically mapping the structure of the world. As such, they cannot be informed by representational ontology based on mental objects and states. What actually is the case is merely some terminological affinity between subjective and informational uncertainty.

In this paper incomplete data sets, or data sets with missing attribute values, have three interpretations, lost values, attribute-concept values and ‘do not care’ conditions. Additionally, the process of data mining is based on two types of probabilistic approximations, global and saturated. We present results of experiments on mining incomplete data sets using six approaches, combining three interpretations of missing attribute values with two types of probabilistic approximations. We compare our six approaches, using the error rate computed as (...) a result of ten-fold cross validation as a criterion of quality. We show that for some data sets the error rate is significantly smaller (5% level of significance) for lost values, for some data sets the smaller error rate is associated with attribute-concept values, and sometimes with ‘do not care’ conditions. Again, for some approaches the error rate is significantly smaller for saturated probabilistic approximations than for global probabilistic approximations, while for some approaches it is the other way around. Thus, for an incomplete data set, the best approach to data mining should be chosen by trying all six approaches. (shrink)

ABSTRACTTo build a process model of the understanding of conditionals we extract a common core of three semantics of if-then sentences: the conditional event interpretation in the coherencebased probability logic, the discourse processingtheory of Hans Kamp, and the game-theoretical approach of Jaakko Hintikka. The empirical part reports three experiments in which each participant assessed the probability of 52 if-then sentencesin a truth table task. Each experiment included a second task: An n-back task relating the interpretation of conditionals to working memory, (...) a Bayesian bookbag and poker chip task relating the interpretation of conditionals to probability updating, and a probabilistic modus ponens task relating the interpretation of conditionals to a classical inference task. Data analysis shows that the way in which the conditionals are interpreted correlates with each of the supplementary tasks. The results are discussed within the process model proposed in the introduction. (shrink)

In this work we try to study theories of causation based upon causal processes and causal interactions in the context of classical and quantum physics. Our central aim is to find out whether such causal theories are compatible with the world picture suggested by contemporary theories of physics. In the first part, we review, compare and try to place among more general taxonomical schemes, the causal theories by Russell (the causal lines approach), Reichenbach (mark method, probabilistic causality and (...) the principle of common cause), Salmon (mark method, structure, invariant and conserved quantities approaches) and Dowe (conserved quantity theory). In the second part of the work, we deal with some problems that process theories of causation face whenever one tries to define, rigorously, causal concepts (e.g. “causal process” or “conjunctive common cause”) in the context of classical relativistic physical theories (van Dam – Wigner particle theory, the free Klein-Gordon field, classical electromagnetic theory) as well as quantum theories (algebraic relativistic quantum field theory). In this vein, special attention has been given to the locality problem in physical theories as it emerges from the structure of local classical the quantum theories (semantic locality), the relation between global and local conditions for physical systems (global and local determinism) as well as the problem of action at a distance, which is of central importance for the theories of causation under examination (Bell’s inequalities, EPR paradox, Reeh-Schlieder theorem and local independence conditions). We argue for three different theses: first, there are physical theories in the context of which it is impossible even to formulate the necessary physical hypotheses that allow us to define basic causal concepts and causal principles; second, there are physical theories which allow us to formulate these hypotheses only ad hoc; finally, in some cases it is necessary to revise basic causal principles and concepts bequeathed by the philosophical tradition. (shrink)

Nonmonotonic logics allow—contrary to classical (monotone) logics— for withdrawing conclusions in the light of new evidence. Nonmonotonic reasoning is often claimed to mimic human common sense reasoning. Only a few studies, though, have investigated this claim empirically. system p is a central, broadly accepted nonmonotonic reasoning system that proposes basic rationality postulates. We previously investigated empirically a probabilistic interpretation of three selected rules of system p. We found a relatively good agreement of human reasoning and principles of nonmonotonic reasoning (...) according to the coherence interpretation of system p. This study reports an experiment on the cautious monotonicity Rule and its “incautious” counterpart that is not contained in system p, namely the monotonicity Rule. In accordance with our previous results, the data suggest that people reason nonmonotonically: the subjects in the cautious monotonicity condition infer significantly tighter intervals close to the coherence interpretation of system p compared with the subjects in the incautious monotonicity condition where rather wide (and hence non-informative) intervals are inferred. (shrink)