The Misinterpretable Evidence Conveyed by Arbitrary Codes

• URL: http://arxiv.org/abs/2503.18984v1
• Date: Sun, 23 Mar 2025 07:31:26 GMT
• Title: The Misinterpretable Evidence Conveyed by Arbitrary Codes
• Authors: Guido Fioretti,
• Abstract summary: Evidence Theory is a framework for handling imprecise reasoning in the context of a judge evaluating testimonies or a detective evaluating cues.<n>This paper explores the possibility of employing Evidence Theory to represent arbitrary communication codes between and within living organisms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Evidence Theory is a mathematical framework for handling imprecise reasoning in the context of a judge evaluating testimonies or a detective evaluating cues, rather than a gambler playing games of chance. In comparison to Probability Theory, it is better equipped to deal with ambiguous information and novel possibilities. Furthermore, arrival and evaluation of testimonies implies a communication channel. This paper explores the possibility of employing Evidence Theory to represent arbitrary communication codes between and within living organisms. In this paper, different schemes are explored for living organisms incapable of anticipation, animals sufficiently sophisticated to be capable of extrapolation, and humans capable of reading one other's minds.

Related papers

• 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)
• Rate-Distortion-Perception Theory for Semantic Communication [73.04341519955223]
  We study the achievable data rate of semantic communication under the symbol distortion and semantic perception constraints. We observe that there exists cases that the receiver can directly infer the semantic information source satisfying certain distortion and perception constraints.
  arXiv  Detail & Related papers  (2023-12-09T02:04:32Z)
• Sherlock Holmes Doesn't Play Dice: The significance of Evidence Theory for the Social and Life Sciences [0.0]
  Evidence Theory can express the uncertainty deriving from the fear that events may materialize. Probability Theory must limit itself to the possibilities that a decision-maker is currently envisaging.
  arXiv  Detail & Related papers  (2023-09-01T07:52:28Z)
• Uncertain Machine Ethical Decisions Using Hypothetical Retrospection [8.064201367978066]
  We propose the use of the hypothetical retrospection argumentation procedure, developed by Sven Ove Hansson. Actions are represented with a branching set of potential outcomes, each with a state, utility, and either a numeric or poetic probability estimate. We introduce a preliminary framework that seems to meet the varied requirements of a machine ethics system.
  arXiv  Detail & Related papers  (2023-05-02T13:54:04Z)
• 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)
• A Quantitative Symbolic Approach to Individual Human Reasoning [0.0]
  We take findings from the literature and show how these, formalized as cognitive principles within a logical framework, can establish a quantitative notion of reasoning. We employ techniques from non-monotonic reasoning and computer science, namely, a solving paradigm called answer set programming (ASP) Finally, we can fruitfully use plausibility reasoning in ASP to test the effects of an existing experiment and explain different majority responses.
  arXiv  Detail & Related papers  (2022-05-10T16:43:47Z)
• 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)
• Visual Abductive Reasoning [85.17040703205608]
  Abductive reasoning seeks the likeliest possible explanation for partial observations. We propose a new task and dataset, Visual Abductive Reasoning ( VAR), for examining abductive reasoning ability of machine intelligence in everyday visual situations.
  arXiv  Detail & Related papers  (2022-03-26T10:17:03Z)
• Comparative Probing of Lexical Semantics Theories for Cognitive Plausibility and Technological Usefulness [1.028961895672321]
  Lexical semantics theories differ in advocating that the meaning of words is represented as an inference graph, a feature mapping or a vector space. We systematically probe different lexical semantics theories for their levels of cognitive plausibility and of technological usefulness.
  arXiv  Detail & Related papers  (2020-11-16T14:46:08Z)
• Emergence of Pragmatics from Referential Game between Theory of Mind Agents [64.25696237463397]
  We propose an algorithm, using which agents can spontaneously learn the ability to "read between lines" without any explicit hand-designed rules. We integrate the theory of mind (ToM) in a cooperative multi-agent pedagogical situation and propose an adaptive reinforcement learning (RL) algorithm to develop a communication protocol.
  arXiv  Detail & Related papers  (2020-01-21T19:37:33Z)
• Debate Dynamics for Human-comprehensible Fact-checking on Knowledge Graphs [27.225048123690243]
  We propose a novel method for fact-checking on knowledge graphs based on debate dynamics. The underlying idea is to frame the task of triple classification as a debate game between two reinforcement learning agents. Our method allows for interactive reasoning on knowledge graphs where the users can raise additional arguments or evaluate the debate taking common sense reasoning and external information into account.
  arXiv  Detail & Related papers  (2020-01-09T15:19:45Z)

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.