Aggregating causal judgements

Decision making typically requires judgements about causal relations. We need to know both the causal effects of our actions and the causal relevance of various environmental factors. Judgements about the nature and strength of causal relations often differ, even among experts. How to handle such diversity is the topic of this paper. First we consider the possibility of aggregating causal judgements via the aggregation of probabilistic ones. The broadly negative outcome of this investigation leads us to look at aggregating causal judgements independently of probabilistic ones. We do so by transcribing causal claims into the judgement aggregation framework and applying some recent results in this field. Finally we look at the implications for probability aggregation when it is constrained by prior aggregation of causal judgements.mathematical economics;

Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation

In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, given any finite family of conditional events F and any nonempty subset S of F, the family F p-entails the quasi conjunction C(S); then, given any conditional event E|H, we analyze the equivalence between p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some nonempty subset of F. We also illustrate some alternative theorems related with p-consistency and p-entailment. Finally, we deepen the study of the connections between the notions of p-entailment and inclusion relation by introducing for a pair (F,E|H) the (possibly empty) class K of the subsets S of F such that C(S) implies E|H. We show that the class K satisfies many properties; in particular K is additive and has a greatest element which can be determined by applying a suitable algorithm

Precise Propagation of Upper and Lower Probability Bounds in System P

In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional assertions of a given knowledge base, automatically obtaining the precise probability bounds for the derived conclusions of the inference rules. This allows a more flexible and realistic use of System P in default reasoning and provides an exact illustration of the degradation of the inference rules when interpreted in probabilistic terms. We also examine the disjunctive Weak Rational Monotony of System P+ proposed by Adams in his extended probability logic.Comment: 8 pages -8th Intl. Workshop on Non-Monotonic Reasoning NMR'2000, April 9-11, Breckenridge, Colorad

A Stronger Bell Argument for (Some Kind of) Parameter Dependence

It is widely accepted that the violation of Bell inequalities excludes local theories of the quantum realm. This paper presents a new derivation of the inequalities from non-trivial non-local theories and formulates a stronger Bell argument excluding also these non-local theories. Taking into account all possible theories, the conclusion of this stronger argument provably is the strongest possible consequence from the violation of Bell inequalities on a qualitative probabilistic level (given usual background assumptions). Among the forbidden theories is a subset of outcome dependent theories showing that outcome dependence is not sufficient for explaining a violation of Bell inequalities. Non-local theories which can violate Bell inequalities (among them quantum theory) are rather characterised by the fact that at least one of the measurement outcomes in some sense (which is made precise) probabilistically depends both on its local as well as on its distant measurement setting ('parameter'). When Bell inequalities are found to be violated, the true choice is not 'outcome dependence or parameter dependence' but between two kinds of parameter dependences, one of them being what is usually called 'parameter dependence'. Against the received view established by Jarrett and Shimony that on a probabilistic level quantum non-locality amounts to outcome dependence, this result confirms and makes precise Maudlin's claim that some kind of parameter dependence is required.Comment: forthcoming in: Studies in the History and Philosophy of Modern Physic

Efficient computational strategies to learn the structure of probabilistic graphical models of cumulative phenomena

Structural learning of Bayesian Networks (BNs) is a NP-hard problem, which is further complicated by many theoretical issues, such as the I-equivalence among different structures. In this work, we focus on a specific subclass of BNs, named Suppes-Bayes Causal Networks (SBCNs), which include specific structural constraints based on Suppes' probabilistic causation to efficiently model cumulative phenomena. Here we compare the performance, via extensive simulations, of various state-of-the-art search strategies, such as local search techniques and Genetic Algorithms, as well as of distinct regularization methods. The assessment is performed on a large number of simulated datasets from topologies with distinct levels of complexity, various sample size and different rates of errors in the data. Among the main results, we show that the introduction of Suppes' constraints dramatically improve the inference accuracy, by reducing the solution space and providing a temporal ordering on the variables. We also report on trade-offs among different search techniques that can be efficiently employed in distinct experimental settings. This manuscript is an extended version of the paper "Structural Learning of Probabilistic Graphical Models of Cumulative Phenomena" presented at the 2018 International Conference on Computational Science

The Goodman-Nguyen Relation within Imprecise Probability Theory

The Goodman-Nguyen relation is a partial order generalising the implication (inclusion) relation to conditional events. As such, with precise probabilities it both induces an agreeing probability ordering and is a key tool in a certain common extension problem. Most previous work involving this relation is concerned with either conditional event algebras or precise probabilities. We investigate here its role within imprecise probability theory, first in the framework of conditional events and then proposing a generalisation of the Goodman-Nguyen relation to conditional gambles. It turns out that this relation induces an agreeing ordering on coherent or C-convex conditional imprecise previsions. In a standard inferential problem with conditional events, it lets us determine the natural extension, as well as an upper extension. With conditional gambles, it is useful in deriving a number of inferential inequalities.Comment: Published version: http://www.sciencedirect.com/science/article/pii/S0888613X1400101

Facts, Values and Quanta

Quantum mechanics is a fundamentally probabilistic theory (at least so far as the empirical predictions are concerned). It follows that, if one wants to properly understand quantum mechanics, it is essential to clearly understand the meaning of probability statements. The interpretation of probability has excited nearly as much philosophical controversy as the interpretation of quantum mechanics. 20th century physicists have mostly adopted a frequentist conception. In this paper it is argued that we ought, instead, to adopt a logical or Bayesian conception. The paper includes a comparison of the orthodox and Bayesian theories of statistical inference. It concludes with a few remarks concerning the implications for the concept of physical reality.Comment: 30 pages, AMS Late