Related papers: Inverses, Conditionals and Compositional Operators…
New families of fourth-order composition methods for the numerical integration of initial value problems defined by ordinary differential equations are proposed. They are designed when the problem can be separated into three parts in such a…
We introduce a new algebraic structure for multi-dimensional compositional embeddings, built on directional non-commutative monoidal operators. The core contribution of this work is this novel framework, which exhibits appealing theoretical…
Compositional generalization, the ability to recognize familiar parts in novel contexts, is a defining property of intelligent systems. Although modern models are trained on massive datasets, they still cover only a tiny fraction of the…
This paper addresses inverse problems (in a broad sense) for two classes of multivariate neural network (NN) operators, with particular emphasis on saturation results, and both analytical and semi-analytical inverse theorems. One of the key…
We present a hierarchical viewpoint on the operator-algebraic formulation of quantum systems, in which $C^{*}$-algebras are responsible for the universal and intrinsic description, whereas von Neumann algebras provide the detailed account…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
This work addresses the design of multi-agent coordination through high-order consensus protocols. While first-order consensus strategies are well-studied -- with known robustness to uncertainties such as time delays, time-varying weights,…
Modelling compositionality has been a longstanding area of research in the field of vector space semantics. The categorical approach to compositionality maps grammar onto vector spaces in a principled way, but comes under fire for requiring…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
In this paper we discuss applications of the geometric theory of composition operators on Sobolev spaces to the spectral theory of non-linear elliptic operators. The lower estimates of the first non-trivial Neumann eigenvalues of the…
We study the composition operators on an algebra of Dirichlet series, the analogue of the Wiener algebra of absolutely convergent Taylor series, which we call the Wiener-Dirichlet algebra. The central issue is to understand the connection…
Learning compact and interpretable representations is a very natural task, which has not been solved satisfactorily even for simple binary datasets. In this paper, we review various ways of composing experts for binary data and argue that…
We describe a logarithmic tensor product theory for certain module categories for a ``conformal vertex algebra.'' In this theory, which is a natural, although intricate, generalization of earlier work of Huang and Lepowsky, we do not…
This dissertation builds a compositional cyber-physical systems theory to develop concrete semantics relating the above diverse views necessary for safety and security assurance. In this sense, composition can take two forms. The first is…
Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees compositionality, but seen from the point of view of stateful…
In this paper we study interpretations and equivalences of propositional deductive systems by using a quantale-theoretic approach introduced by Galatos and Tsinakis. Our aim is to provide a general order-theoretic framework which is able to…
Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the observational power of program terms. The key desideratum for any…
This work proposes a Bayesian inference method for the reduced-order modeling of time-dependent systems. Informed by the structure of the governing equations, the task of learning a reduced-order model from data is posed as a Bayesian…
Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped…
In this paper we revisit the hypothesis needed to define the "paracomposition" operator, an analogue to the classic pull-back operation in the low regularity setting, first introduced by S. Alinhac in [3]. More precisely we do so in two…