836 research outputs found
Factorisation properties of the strong product
We investigate a number of factorisation conditions in the frame- work of sets of probability measures, or coherent lower previsions, with finite referential spaces. We show that the so-called strong product constitutes one way to combine a number of marginal coherent lower previsions into an independent joint lower prevision, and we prove that under some conditions it is the only independent product that satisfies the factorisation conditions
Recent advances in imprecise-probabilistic graphical models
We summarise and provide pointers to recent advances in inference and identification for specific types of probabilistic graphical models using imprecise probabilities. Robust inferences can be made in so-called credal networks when the local models attached to their nodes are imprecisely specified as conditional lower previsions, by using exact algorithms whose complexity is comparable to that for the precise-probabilistic counterparts
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
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
Finitely additive extensions of distribution functions and moment sequences: The coherent lower prevision approach
We study the information that a distribution function provides about the finitely additive probability measure inducing it. We show that in general there is an infinite number of finitely additive probabilities associated with the same distribution function. Secondly, we investigate the relationship between a distribution function and its given sequence of moments. We provide formulae for the sets of distribution functions, and finitely additive probabilities, associated with some moment sequence, and determine under which conditions the moments determine the distribution function uniquely. We show that all these problems can be addressed efficiently using the theory of coherent lower previsions
Accept & Reject Statement-Based Uncertainty Models
We develop a framework for modelling and reasoning with uncertainty based on
accept and reject statements about gambles. It generalises the frameworks found
in the literature based on statements of acceptability, desirability, or
favourability and clarifies their relative position. Next to the
statement-based formulation, we also provide a translation in terms of
preference relations, discuss---as a bridge to existing frameworks---a number
of simplified variants, and show the relationship with prevision-based
uncertainty models. We furthermore provide an application to modelling symmetry
judgements.Comment: 35 pages, 17 figure
Epistemic irrelevance in credal networks : the case of imprecise Markov trees
We replace strong independence in credal networks with the weaker notion of epistemic irrelevance. Focusing on directed trees, we show how to combine local credal sets 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 essentially linear in the number of nodes, is formulated entirely in terms of coherent lower previsions. We supply examples of the algorithm's operation, and report an application to on-line character recognition that illustrates the advantages of our model for prediction
- …