On coherent immediate prediction: connecting two theories of imprecise probability

We give an overview of two approaches to probabiliity theory where lower and upper probabilities, rather than probabilities, are used: Walley's behavioural theory of imprecise probabilities, and Shafer and Vovk's game-theoretic account of probability. We show that the two theories are more closely related than would be suspected at first sight, and we establish a correspondence between them that (i) has an interesting interpretation, and (ii) allows us to freely import results from one theory into the other. Our approach leads to an account of immediate prediction in the framework of Walley's theory, and we prove an interesting and quite general version of the weak law of large numbers

2-coherent and 2-convex Conditional Lower Previsions

In this paper we explore relaxations of (Williams) coherent and convex conditional previsions that form the families of $n$-coherent and $n$-convex conditional previsions, at the varying of $n$. We investigate which such previsions are the most general one may reasonably consider, suggesting (centered) $2$-convex or, if positive homogeneity and conjugacy is needed, $2$-coherent lower previsions. Basic properties of these previsions are studied. In particular, we prove that they satisfy the Generalized Bayes Rule and always have a $2$-convex or, respectively, $2$-coherent natural extension. The role of these extensions is analogous to that of the natural extension for coherent lower previsions. On the contrary, $n$-convex and $n$-coherent previsions with $n\geq 3$ either are convex or coherent themselves or have no extension of the same type on large enough sets. Among the uncertainty concepts that can be modelled by $2$-convexity, we discuss generalizations of capacities and niveloids to a conditional framework and show that the well-known risk measure Value-at-Risk only guarantees to be centered $2$-convex. In the final part, we determine the rationality requirements of $2$-convexity and $2$-coherence from a desirability perspective, emphasising how they weaken those of (Williams) coherence.Comment: This is the authors' version of a work that was accepted for publication in the International Journal of Approximate Reasoning, vol. 77, October 2016, pages 66-86, doi:10.1016/j.ijar.2016.06.003, http://www.sciencedirect.com/science/article/pii/S0888613X1630079

A note on the temporal sure preference principle and the updating of lower previsions.

This paper reviews the temporal sure preference principle as a basis for inference over time. We reformulate the principle in terms of desirability, and explore its implications for lower previsions. We report some initial results. We also discuss some of the technical difficulties encountered

Epistemic irrelevance in credal nets: the case of imprecise Markov trees

We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability. Focusing on directed trees, we show how to combine the given local uncertainty models in the nodes of the graph into a global model, and we use this to construct and justify an exact message-passing algorithm that computes updated beliefs for a variable in the tree. The algorithm, which is linear in the number of nodes, is formulated entirely in terms of coherent lower previsions, and is shown to satisfy a number of rationality requirements. We supply examples of the algorithm's operation, and report an application to on-line character recognition that illustrates the advantages of our approach for prediction. We comment on the perspectives, opened by the availability, for the first time, of a truly efficient algorithm based on epistemic irrelevance.Comment: 29 pages, 5 figures, 1 tabl