L\"uders' and quantum Jeffrey's rules as entropic projections

We prove that the standard quantum mechanical description of a quantum state change due to measurement, given by Lueders' rules, is a special case of the constrained maximisation of a quantum relative entropy functional. This result is a quantum analogue of the derivation of the Bayes--Laplace rule as a special case of the constrained maximisation of relative entropy. The proof is provided for the Umegaki relative entropy of density operators over a Hilbert space as well as for the Araki relative entropy of normal states over a W*-algebra. We also introduce a quantum analogue of Jeffrey's rule, derive it in the same way as above, and discuss the meaning of these results for quantum bayesianism

There Is No Pure Empirical Reasoning

The justificatory force of empirical reasoning always depends upon the existence of some synthetic, a priori justification. The reasoner must begin with justified, substantive constraints on both the prior probability of the conclusion and certain conditional probabilities; otherwise, all possible degrees of belief in the conclusion are left open given the premises. Such constraints cannot in general be empirically justified, on pain of infinite regress. Nor does subjective Bayesianism offer a way out for the empiricist. Despite often-cited convergence theorems, subjective Bayesians cannot hold that any empirical hypothesis is ever objectively justified in the relevant sense. Rationalism is thus the only alternative to an implausible skepticism

Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal Networks

A reliable modeling of uncertain evidence in Bayesian networks based on a set-valued quantification is proposed. Both soft and virtual evidences are considered. We show that evidence propagation in this setup can be reduced to standard updating in an augmented credal network, equivalent to a set of consistent Bayesian networks. A characterization of the computational complexity for this task is derived together with an efficient exact procedure for a subclass of instances. In the case of multiple uncertain evidences over the same variable, the proposed procedure can provide a set-valued version of the geometric approach to opinion pooling.Comment: 19 page

Generalized belief change with imprecise probabilities and graphical models

We provide a theoretical investigation of probabilistic belief revision in complex frameworks, under extended conditions of uncertainty, inconsistency and imprecision. We motivate our kinematical approach by specializing our discussion to probabilistic reasoning with graphical models, whose modular representation allows for efficient inference. Most results in this direction are derived from the relevant work of Chan and Darwiche (2005), that first proved the inter-reducibility of virtual and probabilistic evidence. Such forms of information, deeply distinct in their meaning, are extended to the conditional and imprecise frameworks, allowing further generalizations, e.g. to experts' qualitative assessments. Belief aggregation and iterated revision of a rational agent's belief are also explored