Related papers: Inverses, Conditionals and Compositional Operators…
A common problem in various applications is the additive decomposition of the output of a function with respect to its input variables. Functions with binary arguments can be axiomatically decomposed by the famous Shapley value. For the…
This paper refines the main results from our previous study on sparse bounds of generalized commutators of multilinear fractional singular integral operators in \cite{CenSong2412}. The key improvements are: 1. We replace pointwise…
A Dirac operator on a complete manifold is Fredholm if it is invertible outside a compact set. Assuming a compact group to act on all relevant structure, and the manifold to have a warped product structure outside such a compact set, we…
Motivated by the study of indecomposable, nonsimple modules for a vertex operator algebra $V$, we study the relationship between various types of $V$-modules and modules for the higher level Zhu algebras for $V$, denoted $A_n(V)$, for $n…
Currently, there is a gap between the tools used by probability theorists and those used in formal reasoning about probabilistic programs. On the one hand, a probability theorist decomposes probabilistic state along the simple and natural…
The importance of the theory of pseudo-differential operators in the study of non linear integrable systems is point out. Principally, the algebra $\Xi $ of nonlinear (local and nonlocal) differential operators, acting on the ring of…
Bayesian statistical models allow us to formalise our knowledge about the world and reason about our uncertainty, but there is a need for better procedures to accurately encode its complexity. One way to do so is through compositional…
We establish complete characterizations of various notions of expansivity for weighted composition operators on a very general class of locally convex spaces of continuous functions. This class includes several classical classes of…
Despite ample evidence that our concepts, our cognitive architecture, and mathematics itself are all deeply compositional, few models take advantage of this structure. We therefore propose a radically compositional approach to computational…
Mechanistic interpretability aims to explain neural model behaviour by reverse-engineering learned computational structure into human-understandable components. Without a formal framework, however, mechanistic explanations cannot be…
We develop operators for construction of proposals in probabilistic programs, which we refer to as inference combinators. Inference combinators define a grammar over importance samplers that compose primitive operations such as application…
We study weighted composition operators acting between Fock spaces. The following results are obtained: (1) Criteria for the boundedness and compactness; (2) Characterizations of compact differences and essential norm; (3) Complete…
The world is fundamentally compositional, so it is natural to think of visual recognition as the recognition of basic visually primitives that are composed according to well-defined rules. This strategy allows us to recognize unseen complex…
There are several important abstract operator systems with the convex cone of positive semidefinite matrices at the first level. Well-known are the operator systems of separable matrices, of positive semidefinite matrices, and of block…
In this work we show that the classical subject of general valuation theory and Zariski-Riemann varieties has a much wider scope than commutative algebra and desingularization theory. We construct and investigate birational projective limit…
First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…
High training costs of generative models and the need to fine-tune them for specific tasks have created a strong interest in model reuse and composition. A key challenge in composing iterative generative processes, such as GFlowNets and…
Originating in game theory, Shapley values are widely used for explaining a machine learning model's prediction by quantifying the contribution of each feature's value to the prediction. This requires a scalar prediction as in binary…
The Nekrasov partition function in supersymmetric quantum gauge theory is mathematically formulated as an equivariant integral over certain moduli spaces of sheaves on a complex surface. In ``Seiberg-Witten Theory and Random Partitions'',…
In the present paper we consider modal propositional logic and look for the constraints that are imposed to the propositions of the special type $\Box a$ by the structure of the relevant finite Kripke frame. We translate the usual language…