Sherlock Holmes Doesn't Play Dice: The mathematics of uncertain reasoning when something may happen, that one is not even able to figure out

• URL: http://arxiv.org/abs/2309.03222v3
• Date: Fri, 28 Mar 2025 11:11:28 GMT
• Title: Sherlock Holmes Doesn't Play Dice: The mathematics of uncertain reasoning when something may happen, that one is not even able to figure out
• Authors: Guido Fioretti,
• Abstract summary: I stress that an extended version of Evidence Theory can express the uncertainty deriving from the fear that events may materialize.<n>Probability Theory must limit itself to the possibilities that a decision-maker is currently envisaging.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: While Evidence Theory (also known as Dempster-Shafer Theory, or Belief Functions Theory) is being increasingly used in data fusion, its potentialities in the Social and Life Sciences are often obscured by lack of awareness of its distinctive features. In particular, with this paper I stress that an extended version of Evidence Theory can express the uncertainty deriving from the fear that events may materialize, that one is not even able to figure out. By contrast, Probability Theory must limit itself to the possibilities that a decision-maker is currently envisaging. I compare this extended version of Evidence Theory to sophisticated extensions of Probability Theory, such as imprecise and sub-additive probabilities, as well as unconventional versions of Information Theory that are employed in data fusion and transmission of cultural information. A further extension to multi-agent interaction is outlined.

Related papers

• The Misinterpretable Evidence Conveyed by Arbitrary Codes [0.0]
  Evidence Theory is a framework for handling imprecise reasoning in the context of a judge evaluating testimonies or a detective evaluating cues. This paper explores the possibility of employing Evidence Theory to represent arbitrary communication codes between and within living organisms.
  arXiv  Detail & Related papers  (2025-03-23T07:31:26Z)
• Minimal operational theories: classical theories with quantum features [41.94295877935867]
  We show that almost all minimal theories with conditioning satisfy two quantum no-go theorems. As a relevant example, we construct a minimal toy-theory with conditioning where all systems are classical.
  arXiv  Detail & Related papers  (2024-08-02T16:24:09Z)
• Isopignistic Canonical Decomposition via Belief Evolution Network [12.459136964317942]
  We propose an isopignistic transformation based on the belief evolution network. This decomposition offers a reverse path between the possibility distribution and its isopignistic mass functions. This paper establishes a theoretical basis for building general models of artificial intelligence based on probability theory, Dempster-Shafer theory, and possibility theory.
  arXiv  Detail & Related papers  (2024-05-04T12:39:15Z)
• Machine Learning of the Prime Distribution [49.84018914962972]
  We provide a theoretical argument explaining the experimental observations of Yang-Hui He about the learnability of primes. We also posit that the ErdHos-Kac law would very unlikely be discovered by current machine learning techniques.
  arXiv  Detail & Related papers  (2024-03-19T09:47:54Z)
• Machine learning and information theory concepts towards an AI Mathematician [77.63761356203105]
  The current state-of-the-art in artificial intelligence is impressive, especially in terms of mastery of language, but not so much in terms of mathematical reasoning. This essay builds on the idea that current deep learning mostly succeeds at system 1 abilities. It takes an information-theoretical posture to ask questions about what constitutes an interesting mathematical statement.
  arXiv  Detail & Related papers  (2024-03-07T15:12:06Z)
• On the Time Orientation of Probabilistic Theories [0.0]
  An influential theorem by Satosi Watanabe convinced many that there can be no physical probabilistic theory with both non-trivial forward and backward transition probabilities. We show that this conclusion does not follow from the theorem.
  arXiv  Detail & Related papers  (2024-03-02T01:55:46Z)
• An Elementary Proof That Everett's Quantum Multiverse Is Nonlocal: Bell-Locality and Branch-Symmetry in the Many-Worlds Interpretation [0.0]
  Everett's many-worlds or multiverse theory is an attempt to find an alternative to the standard Copenhagen interpretation of quantum mechanics. Here, we show that this is not the case and debunk the contradictions by analyzing in detail the Greenberger--Horne--Zeilinger (GHZ) nonlocality theorem.
  arXiv  Detail & Related papers  (2023-06-13T14:15:56Z)
• On the Joint Interaction of Models, Data, and Features [82.60073661644435]
  We introduce a new tool, the interaction tensor, for empirically analyzing the interaction between data and model through features. Based on these observations, we propose a conceptual framework for feature learning. Under this framework, the expected accuracy for a single hypothesis and agreement for a pair of hypotheses can both be derived in closed-form.
  arXiv  Detail & Related papers  (2023-06-07T21:35:26Z)
• Connecting classical finite exchangeability to quantum theory [69.62715388742298]
  Exchangeability is a fundamental concept in probability theory and statistics. We show how a de Finetti-like representation theorem for finitely exchangeable sequences requires a mathematical representation which is formally equivalent to quantum theory.
  arXiv  Detail & Related papers  (2023-06-06T17:15:19Z)
• The Explanation of Entanglement in Quantum Mechanics [0.0]
  Pure states, i.e., probability distributions of measurement values, cannot inhere in elementary particles and therefore cannot be regarded as interacting causally. The areas in quantum mechanics in which causal interactions are relevant include, though not explicitly, measurement and therefore the Born rule, and, explicitly, the unitary Schrodinger time development of states.
  arXiv  Detail & Related papers  (2023-04-28T03:28:52Z)
• Uncertain Evidence in Probabilistic Models and Stochastic Simulators [80.40110074847527]
  We consider the problem of performing Bayesian inference in probabilistic models where observations are accompanied by uncertainty, referred to as uncertain evidence' We explore how to interpret uncertain evidence, and by extension the importance of proper interpretation as it pertains to inference about latent variables. We devise concrete guidelines on how to account for uncertain evidence and we provide new insights, particularly regarding consistency.
  arXiv  Detail & Related papers  (2022-10-21T20:32:59Z)
• Incompatibility of observables, channels and instruments in information theories [68.8204255655161]
  We study the notion of compatibility for tests of an operational probabilistic theory. We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.
  arXiv  Detail & Related papers  (2022-04-17T08:44:29Z)
• Observers of quantum systems cannot agree to disagree [55.41644538483948]
  We ask whether agreement between observers can serve as a physical principle that must hold for any theory of the world. We construct examples of (postquantum) no-signaling boxes where observers can agree to disagree.
  arXiv  Detail & Related papers  (2021-02-17T19:00:04Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Classicality without local discriminability: decoupling entanglement and complementarity [0.0]
  An operational probabilistic theory where all systems are classical, and all pure states of composite systems are entangled, is constructed. We demonstrate that the presence of entanglement is independent of the existence of incompatible measurements. We also prove the existence, in the theory, of a universal processor.
  arXiv  Detail & Related papers  (2020-08-10T10:30:47Z)
• General Probabilistic Theories with a Gleason-type Theorem [0.0]
  Gleason-type theorems for quantum theory allow one to recover the quantum state space. We identify the class of general probabilistic theories which also admit Gleason-type theorems.
  arXiv  Detail & Related papers  (2020-05-28T17:29:29Z)
• Belief functions induced by random fuzzy sets: A general framework for representing uncertain and fuzzy evidence [6.713564212269253]
  We generalize Zadeh's notion of "evidence of the second kind" We show that it makes it possible to reconcile the possibilistic interpretation of likelihood with Bayesian inference.
  arXiv  Detail & Related papers  (2020-04-24T10:14:54Z)

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.