Composable constraints

• URL: http://arxiv.org/abs/2112.06818v1
• Date: Mon, 13 Dec 2021 17:24:47 GMT
• Title: Composable constraints
• Authors: Matt Wilson, Augustin Vanrietvelde
• Abstract summary: We show that every composable constraint encoding can be used to construct an equivalent notion of a constrained category. We show how to express the compatibility of constraints with additional categorical structures of their targets, such as parallel composition, compactness, and time-symmetry.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding can be used to construct an equivalent notion of a constrained category in which morphisms are supplemented with the constraints they satisfy. We further describe how to express the compatibility of constraints with additional categorical structures of their targets, such as parallel composition, compactness, and time-symmetry. We present a variety of concrete examples. Some are familiar in the study of quantum protocols and quantum foundations, such as signalling and sectorial constraints; others arise by construction from basic categorical notions. We use the language developed to discuss the notion of intersectability of constraints and the simplifications it allows for when present, and to show that any time-symmetric theory of relational constraints admits a faithful notion of intersection.

Related papers

• Strong Equivalence in Answer Set Programming with Constraints [8.096489007229774]
  Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any context. We show that strong equivalence can be precisely characterized by their equivalence in the logic of Here-and-There with constraints. We present a translation from the language of several clingo-based answer set solvers that handle constraints into the language of Here-and-There with constraints.
  arXiv  Detail & Related papers  (2025-02-06T18:43:59Z)
• Linearization (in)stabilities and crossed products [0.0]
  We focus on the study of linearization (in)stabilities, exploring when linearized solutions can be integrated to exact ones. Our aim is to provide some clarity about the status of justification, under various conditions, for imposing such constraints on the linearized theory in the $G_Nto0$ limit.
  arXiv  Detail & Related papers  (2024-11-29T18:47:17Z)
• Compositional Structures in Neural Embedding and Interaction Decompositions [101.40245125955306]
  We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks. We introduce a characterization of compositional structures in terms of "interaction decompositions" We establish necessary and sufficient conditions for the presence of such structures within the representations of a model.
  arXiv  Detail & Related papers  (2024-07-12T02:39:50Z)
• A Canonicalization Perspective on Invariant and Equivariant Learning [54.44572887716977]
  We introduce a canonicalization perspective that provides an essential and complete view of the design of frames. We show that there exists an inherent connection between frames and canonical forms. We design novel frames for eigenvectors that are strictly superior to existing methods.
  arXiv  Detail & Related papers  (2024-05-28T17:22:15Z)
• Characterizing Hybrid Causal Structures with the Exclusivity Graph Approach [0.41942958779358674]
  We extend a graph theoretical technique to explore classical, quantum, and no-signaling distributions in hybrid scenarios. We show how with our method we can construct minimal Bell-like inequalities capable of simultaneously distinguishing classical, quantum, and no-signaling behaviors. The demonstrated method will represent a powerful tool to study quantum networks and for applications in quantum information tasks.
  arXiv  Detail & Related papers  (2023-12-29T19:44:38Z)
• Tractable Bounding of Counterfactual Queries by Knowledge Compilation [51.47174989680976]
  We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an inner approximation of those bounds by sampling the initialisation parameters. We show how a single symbolic knowledge compilation allows us to obtain the circuit structure with symbolic parameters to be replaced by their actual values.
  arXiv  Detail & Related papers  (2023-10-05T07:10:40Z)
• 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)
• On limitations of learning algorithms in competitive environments [77.34726150561087]
  We discuss conceptual limitations of generic learning algorithms pursuing adversarial goals in competitive environments. These limitations are shown to be related to intransitivity, which is commonly present in competitive environments.
  arXiv  Detail & Related papers  (2020-11-25T13:40:08Z)
• Efficient Generation of Structured Objects with Constrained Adversarial Networks [25.74932947671932]
  Generative Adversarial Networks (GANs) struggle to generate structured objects like molecules and game maps. We propose Constrained Adversarial Networks (CANs), an extension of GANs in which the constraints are embedded into the model during training. CANs support efficient inference of valid structures (with high probability) and allows to turn on and off the learned constraints at inference time.
  arXiv  Detail & Related papers  (2020-07-26T19:04:37Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)
• An ASP semantics for Constraints involving Conditional Aggregates [9.289905977910378]
  We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) We extend its underlying logical framework with aggregate functions over constraint values and variables. We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints.
  arXiv  Detail & Related papers  (2020-02-17T12:25:01Z)

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.