Irrelevant and independent natural extension for sets of desirable gambles
The results in this paper add useful tools to the theory of sets of desirable gambles, a growing toolbox for reasoning with partial probability assessments. We investigate how to combine a number of marginal coherent sets of desirable gambles into a joint set using the properties of epistemic irrelevance and independence. We provide formulas for the smallest such joint, called their independent natural extension, and study its main properties. The independent natural extension of maximal coherent sets of desirable gambles allows us to define the strong product of sets of desirable gambles. Finally, we explore an easy way to generalise these results to also apply for the conditional versions of epistemic irrelevance and independence. Having such a set of tools that are easily implemented in computer programs is clearly beneficial to fields, like AI, with a clear interest in coherent reasoning under uncertainty using general and robust uncertainty models that require no full specification.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Results about sets of desirable gamble sets
Coherent sets of desirable gamble sets is used as a model for representing an agents opinions and choice preferences under uncertainty. In this paper we provide some results about the axioms required for coherence and th…
Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions
Integrating functions on discrete domains into neural networks is key to developing their capability to reason about discrete objects. But, discrete domains are (1) not naturally amenable to gradient-based optimization, …
Combinatorial OptimizationVocal Bursts Intensity PredictionLogistic-Normal Likelihoods for Heteroscedastic Label Noise
A natural way of estimating heteroscedastic label noise in regression is to model the observed (potentially noisy) target as a sample from a normal distribution, whose parameters can be learned by minimizing the negative…
ClassificationAn ExpTime Upper Bound for $\mathcal{ALC}$ with Integers (Extended Version)
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into …
New copulas based on general partitions-of-unity (part III) - the continuous case (extended version)
In this paper we discuss a natural extension of infinite discrete partition-of-unity copulas which were recently introduced in the literature to continuous partition of copulas with possible applications in risk manageme…
ManagementUnity