The Contextuality-by-Default View of the Sheaf-Theoretic Approach to Contextuality

• URL: http://arxiv.org/abs/1906.02718v3
• Date: Sat, 8 Apr 2023 18:18:30 GMT
• Title: The Contextuality-by-Default View of the Sheaf-Theoretic Approach to Contextuality
• Authors: Ehtibar N. Dzhafarov
• Abstract summary: Sheaf-Theoretic Contextuality (STC) theory is a very general account of whether multiply overlapping subsets of a set can be viewed as inheriting this structure from a global structure imposed on the entire set. I show that when STC is applied to systems of random variables, it can be recast in the language of the Contextuality-by-Default (CbD) theory. I show that it can be resolved by considering systems with multiple possible deterministic realizations as quasi-probabilistic systems with Bayesian priors assigned to the realizations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Sheaf-Theoretic Contextuality (STC) theory developed by Abramsky and colleagues is a very general account of whether multiply overlapping subsets of a set, each of which is endowed with certain "local'" structure, can be viewed as inheriting this structure from a global structure imposed on the entire set. A fundamental requirement of STC is that any intersection of subsets inherit one and the same structure from all intersecting subsets. I show that when STC is applied to systems of random variables, it can be recast in the language of the Contextuality-by-Default (CbD) theory, and this allows one to extend STC to arbitrary systems, in which the requirement in question (called "consistent connectedness'" in CbD) is not necessarily satisfied. When applied to deterministic systems, such as systems of logical statements with fixed truth values, a problem arises of distinguishing lack of consistent connectedness from contextuality. I show that it can be resolved by considering systems with multiple possible deterministic realizations as quasi-probabilistic systems with Bayesian priors assigned to the realizations. Although STC and CbD have distinct native languages and distinct aims and means, the conceptual modifications presented in this paper seem to make them essentially coextensive.

Related papers

• Hierarchical Invariance for Robust and Interpretable Vision Tasks at Larger Scales [54.78115855552886]
  We show how to construct over-complete invariants with a Convolutional Neural Networks (CNN)-like hierarchical architecture. With the over-completeness, discriminative features w.r.t. the task can be adaptively formed in a Neural Architecture Search (NAS)-like manner. For robust and interpretable vision tasks at larger scales, hierarchical invariant representation can be considered as an effective alternative to traditional CNN and invariants.
  arXiv  Detail & Related papers  (2024-02-23T16:50:07Z)
• Inducing Systematicity in Transformers by Attending to Structurally Quantized Embeddings [60.698130703909804]
  Transformers generalize to novel compositions of structures and entities after being trained on a complex dataset. We propose SQ-Transformer that explicitly encourages systematicity in the embeddings and attention layers. We show that SQ-Transformer achieves stronger compositional generalization than the vanilla Transformer on multiple low-complexity semantic parsing and machine translation datasets.
  arXiv  Detail & Related papers  (2024-02-09T15:53:15Z)
• Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension [80.99865844249106]
  We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning. Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
  arXiv  Detail & Related papers  (2023-06-21T07:34:27Z)
• A Theory of Unsupervised Speech Recognition [60.12287608968879]
  Unsupervised speech recognition (ASR-U) is the problem of learning automatic speech recognition systems from unpaired speech-only and text-only corpora. We propose a general theoretical framework to study the properties of ASR-U systems based on random matrix theory and the theory of neural tangent kernels.
  arXiv  Detail & Related papers  (2023-06-09T08:12:27Z)
• Contextuality with disturbance and without: Neither can violate substantive requirements the other satisfies [0.0]
  Contextuality was originally defined only for consistently connected systems of random variables. We show that no such set of requirements is possible, not only for CbD but for all possible CbD-like extensions of contextuality.
  arXiv  Detail & Related papers  (2023-02-23T13:18:11Z)
• A Verification Framework for Component-Based Modeling and Simulation Putting the pieces together [0.0]
  The proposed verification framework provides methods, techniques and tool support for verifying composability at its different levels. In particular we focus on the Dynamic-Semantic Composability level due to its significance in the overall composability correctness and also due to the level of difficulty it poses in the process.
  arXiv  Detail & Related papers  (2023-01-08T18:53:28Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Non-standard entanglement structure of local unitary self-dual models as a saturated situation of repeatability in general probabilistic theories [61.12008553173672]
  We show the existence of infinite structures of quantum composite system such that it is self-dual with local unitary symmetry. We also show the existence of a structure of quantum composite system such that non-orthogonal states in the structure are perfectly distinguishable.
  arXiv  Detail & Related papers  (2021-11-29T23:37:58Z)
• Nonmonotonic Inferences with Qualitative Conditionals based on Preferred Structures on Worlds [3.42658286826597]
  We introduce the preferred structure relation on worlds using conditionals in R. We show that system W exhibits desirable inference properties like satisfying system P and avoiding. In contrast to skeptical c-inference, it does not require to solve a complex constraint satisfaction problem, but is as tractable as system Z.
  arXiv  Detail & Related papers  (2020-05-26T13:32:00Z)
• Expressiveness and machine processability of Knowledge Organization Systems (KOS): An analysis of concepts and relations [0.0]
  The potential of both the expressiveness and machine processability of each Knowledge Organization System is extensively regulated by its structural rules. Ontologies explicitly define diverse types of relations, and are by their nature machine-processable.
  arXiv  Detail & Related papers  (2020-03-11T12:35:52Z)

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.