Generalised Process Theories

• URL: http://arxiv.org/abs/2502.10368v1
• Date: Fri, 14 Feb 2025 18:47:07 GMT
• Title: Generalised Process Theories
• Authors: John H. Selby, Maria E. Stasinou, Matt Wilson, Bob Coecke,
• Abstract summary: We propose an alternative formalization using operad algebras, motivated by recent results connecting SMCs to operadic structures. We provide an accessible yet rigorous formulation that unifies and extends traditional process-theoretic approaches.
• Score: 0.0
• License:
• Abstract: Process theories provide a powerful framework for describing compositional structures across diverse fields, from quantum mechanics to computational linguistics. Traditionally, they have been formalized using symmetric monoidal categories (SMCs). However, various generalizations, including time-neutral, higher-order, and enriched process theories, do not naturally conform to this structure. In this work, we propose an alternative formalization using operad algebras, motivated by recent results connecting SMCs to operadic structures, which captures a broader class of process theories. By leveraging the string-diagrammatic language, we provide an accessible yet rigorous formulation that unifies and extends traditional process-theoretic approaches. Our operadic framework not only recovers standard process theories as a special case but also enables new insights into quantum foundations and compositional structures. This work paves the way for further investigations into the algebraic and operational properties of generalised process theories within an operadic setting.

Related papers

• What makes Models Compositional? A Theoretical View: With Supplement [60.284698521569936]
  We propose a general neuro-symbolic definition of compositional functions and their compositional complexity. We show how various existing general and special purpose sequence processing models fit this definition and use it to analyze their compositional complexity.
  arXiv  Detail & Related papers  (2024-05-02T20:10:27Z)
• Position Paper: Generalized grammar rules and structure-based generalization beyond classical equivariance for lexical tasks and transduction [7.523978255716284]
  We propose a general framework for building models that can generalize compositionally using the concept of Generalized Grammar Rules (GGRs) Our framework is general enough to contain many existing works as special cases. We present ideas on how GGRs might be implemented, and in the process draw connections to reinforcement learning and other areas of research.
  arXiv  Detail & Related papers  (2024-02-02T18:44:37Z)
• Constructor Theory as Process Theory [0.0]
  We show how to formulate fundamental notions of constructor theory within the canvas of process theory. We answer the question of how constructor theory relates to the broader body of process-theoretic literature.
  arXiv  Detail & Related papers  (2023-12-14T12:58:55Z)
• Query Structure Modeling for Inductive Logical Reasoning Over Knowledge Graphs [67.043747188954]
  We propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs. It encodes linearized query structures and entities using pre-trained language models to find answers. We conduct experiments on two inductive logical reasoning datasets and three transductive datasets.
  arXiv  Detail & Related papers  (2023-05-23T01:25:29Z)
• Linear Spaces of Meanings: Compositional Structures in Vision-Language Models [110.00434385712786]
  We investigate compositional structures in data embeddings from pre-trained vision-language models (VLMs) We first present a framework for understanding compositional structures from a geometric perspective. We then explain what these structures entail probabilistically in the case of VLM embeddings, providing intuitions for why they arise in practice.
  arXiv  Detail & Related papers  (2023-02-28T08:11:56Z)
• Compositional Generalization Requires Compositional Parsers [69.77216620997305]
  We compare sequence-to-sequence models and models guided by compositional principles on the recent COGS corpus. We show structural generalization is a key measure of compositional generalization and requires models that are aware of complex structure.
  arXiv  Detail & Related papers  (2022-02-24T07:36:35Z)
• Causality in Higher Order Process Theories [0.7614628596146599]
  We provide an equivalent construction of the HOPT framework from four simple axioms of process-theoretic nature. We then use the HOPT framework to establish connections between foundational features such as causality, determinism and signalling.
  arXiv  Detail & Related papers  (2021-07-30T12:36:12Z)
• 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)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• CPM Categories for Galois Extensions [0.0]
  We develop an infinite hierarchy of probabilistic theories, exhibiting compositional decoherence structures. These decoherences reduce the degrees of freedom in physical systems, while at the same time restricting the fields over which the systems are defined. These theories possess fully fledged operational semantics, allowing both categorical and GPT-style approaches to their study.
  arXiv  Detail & Related papers  (2021-06-02T14:52:41Z)
• One-Way LOCC Indistinguishable Lattice States via Operator Structures [0.0]
  We develop a technique for the construction of relatively small sets of lattice states not distinguishable by one-way LOCC schemes. We show examples, show the construction extends to generalized Pauli states, and compare the construction to other recent work.
  arXiv  Detail & Related papers  (2020-04-24T14:37:56Z)

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.