Information algebras of coherent sets of gambles in general possibility spaces

• URL: http://arxiv.org/abs/2105.12037v1
• Date: Tue, 25 May 2021 16:18:39 GMT
• Title: Information algebras of coherent sets of gambles in general possibility spaces
• Authors: Juerg Kohlas, Arianna Casanova, Marco Zaffalon
• Abstract summary: We show that coherent sets of gambles can be embedded into the algebraic structure of information algebra. This leads to a new perspective of the algebraic and logical structure of desirability.
• Score: 1.697342683039794
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we show that coherent sets of gambles can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical structure of desirability and secondly, it connects desirability, hence imprecise probabilities, to other formalism in computer science sharing the same underlying structure. Both the domain-free and the labeled view of the information algebra of coherent sets of gambles are presented, considering general possibility spaces.

Related papers

• Algebras of actions in an agent's representations of the world [51.06229789727133]
  We use our framework to reproduce the symmetry-based representations from the symmetry-based disentangled representation learning formalism. We then study the algebras of the transformations of worlds with features that occur in simple reinforcement learning scenarios. Using computational methods, that we developed, we extract the algebras of the transformations of these worlds and classify them according to their properties.
  arXiv  Detail & Related papers  (2023-10-02T18:24:51Z)
• Quantum computing with anyons: an $F$-matrix and braid calculator [0.0]
  We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We present anyons abstractly as sets of labels together with a collection of data satisfying a number of axioms. In the language of RFCs, our solver can produce $F$-matrices for anyon systems corresponding to multiplicity-free fusion rings.
  arXiv  Detail & Related papers  (2022-12-01T19:31:17Z)
• Knowledgebra: An Algebraic Learning Framework for Knowledge Graph [15.235089177507897]
  Knowledge graph (KG) representation learning aims to encode entities and relations into dense continuous vector spaces such that knowledge contained in a dataset could be consistently represented. We developed a mathematical language for KG based on an observation of their inherent algebraic structure, which we termed as Knowledgebra. We implemented an instantiation model, SemE, using simple matrix semigroups, which exhibits state-of-the-art performance on standard datasets.
  arXiv  Detail & Related papers  (2022-04-15T04:53:47Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• A Short Note on the Relationship of Information Gain and Eluder Dimension [86.86653394312134]
  We show that eluder dimension and information gain are equivalent in a precise sense for reproducing kernel Hilbert spaces. We show that this is not a coincidence -- eluder dimension and information gain are equivalent in a precise sense for reproducing kernel Hilbert spaces.
  arXiv  Detail & Related papers  (2021-07-06T04:01:22Z)
• Algebras of Sets and Coherent Sets of Gambles [1.697342683039794]
  We show how to construct an information algebra of coherent sets of gambles defined on general possibility spaces. This paper also details how propositional logic is naturally embedded into the theory of imprecise probabilities.
  arXiv  Detail & Related papers  (2021-05-27T08:14:38Z)
• Compositional Processing Emerges in Neural Networks Solving Math Problems [100.80518350845668]
  Recent progress in artificial neural networks has shown that when large models are trained on enough linguistic data, grammatical structure emerges in their representations. We extend this work to the domain of mathematical reasoning, where it is possible to formulate precise hypotheses about how meanings should be composed. Our work shows that neural networks are not only able to infer something about the structured relationships implicit in their training data, but can also deploy this knowledge to guide the composition of individual meanings into composite wholes.
  arXiv  Detail & Related papers  (2021-05-19T07:24:42Z)
• Information algebras of coherent sets of gambles [1.697342683039794]
  We show that coherent sets of gambles can be embedded into the algebraic structure of information algebra. This leads to a new perspective of the algebraic and logical structure of desirability.
  arXiv  Detail & Related papers  (2021-02-26T09:36:39Z)
• General stochastic separation theorems with optimal bounds [68.8204255655161]
  Phenomenon of separability was revealed and used in machine learning to correct errors of Artificial Intelligence (AI) systems and analyze AI instabilities. Errors or clusters of errors can be separated from the rest of the data. The ability to correct an AI system also opens up the possibility of an attack on it, and the high dimensionality induces vulnerabilities caused by the same separability.
  arXiv  Detail & Related papers  (2020-10-11T13:12:41Z)
• Lattice Representation Learning [6.427169570069738]
  We introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be computed explicitly using lattice quantization, yet they can be learned efficiently using the ideas we introduce. This article will focus on laying the groundwork for exploring and exploiting the first two properties, including a new mathematical result linking expressions used during training and inference time and experimental validation on two popular datasets.
  arXiv  Detail & Related papers  (2020-06-24T16:05:11Z)
• A Theory of Usable Information Under Computational Constraints [103.5901638681034]
  We propose a new framework for reasoning about information in complex systems. Our foundation is based on a variational extension of Shannon's information theory. We show that by incorporating computational constraints, $mathcalV$-information can be reliably estimated from data.
  arXiv  Detail & Related papers  (2020-02-25T06:09:30Z)

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.