Relative Probability on Finite Outcome Spaces: A Systematic Examination of its Axiomatization, Properties, and Applications

• URL: http://arxiv.org/abs/2212.14555v3
• Date: Sun, 28 May 2023 01:20:32 GMT
• Title: Relative Probability on Finite Outcome Spaces: A Systematic Examination of its Axiomatization, Properties, and Applications
• Authors: Max Sklar
• Abstract summary: This work proposes a view of probability as a relative measure rather than an absolute one. We focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative probability functions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative probability functions. We then provide a library of examples of these functions and a system for composing them. Additionally, we discuss a relative version of Bayesian inference and its digital implementation. Finally, we prove the topological closure of the relative probability space, highlighting its ability to preserve information under limits.

Related papers

• Hidden variable theory for non-relativistic QED: the critical role of selection rules [0.0]
  We propose a hidden variable theory compatible with non-relativistic quantum electrodynamics. Our approach introduces logical variables to describe propositions about the occupation of stationary states. It successfully describes the essential properties of individual trials.
  arXiv  Detail & Related papers  (2024-10-23T23:25:53Z)
• On The Statistical Representation Properties Of The Perturb-Softmax And The Perturb-Argmax Probability Distributions [17.720298535412443]
  Gumbel-Softmax and Gumbel-Argmax probability distributions are useful in learning discrete structures in discriminative learning. Despite the efforts invested in optimizing these probability models, their statistical properties are under-explored. We investigate their representation properties and determine for which families of parameters these probability distributions are complete. We conclude the analysis by identifying two sets of parameters that satisfy these assumptions and thus admit a complete and minimal representation.
  arXiv  Detail & Related papers  (2024-06-04T10:22:12Z)
• Conditional Optimal Transport on Function Spaces [53.9025059364831]
  We develop a theory of constrained optimal transport problems that describe block-triangular Monge maps. This generalizes the theory of optimal triangular transport to separable infinite-dimensional function spaces with general cost functions. We present numerical experiments that demonstrate the computational applicability of our theoretical results for amortized and likelihood-free inference of functional parameters.
  arXiv  Detail & Related papers  (2023-11-09T18:44:42Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• Bounding Counterfactuals under Selection Bias [60.55840896782637]
  We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
  arXiv  Detail & Related papers  (2022-07-26T10:33:10Z)
• Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings [97.12538243736705]
  We study reinforcement learning with function approximation for large-scale Partially Observable Decision Processes (POMDPs) Our algorithm provably scales to large-scale POMDPs.
  arXiv  Detail & Related papers  (2022-06-24T05:13:35Z)
• A Logic-based Tractable Approximation of Probability [0.0]
  We identify the conditions under which propositional probability functions can be approximated by a hierarchy of depth-bounded Belief functions. We show that our approximations of probability lead to uncertain reasoning which, under the usual assumptions in the field, qualifies as tractable.
  arXiv  Detail & Related papers  (2022-05-06T13:25:12Z)
• The Sigma-Max System Induced from Randomness and Fuzziness [6.2983831147593685]
  This paper induce probability theory (sigma system) and possibility theory (max system) respectively from randomness and fuzziness. It is claimed that the long-standing problem of lack of consensus to the foundation of possibility theory is well resolved.
  arXiv  Detail & Related papers  (2021-10-12T15:55:37Z)
• Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach [84.29777236590674]
  We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identification and efficient estimation via two so-called bridge functions.
  arXiv  Detail & Related papers  (2021-03-25T17:59:19Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.