Related papers: On the decomposition of k-valued rational relation…
Interpretability methods aim to understand the algorithm implemented by a trained model (e.g., a Transofmer) by examining various aspects of the model, such as the weight matrices or the attention patterns. In this work, through a…
We concisely summarize a method of finding all rational solutions to an inhomogeneous rational ODE system of arbitrary order (but solvable for its highest order terms) by converting it into a finite dimensional linear algebra problem. This…
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…
Tensor train (TT) decomposition is a powerful representation for high-order tensors, which has been successfully applied to various machine learning tasks in recent years. However, since the tensor product is not commutative, permutation of…
Self-attention techniques, and specifically Transformers, are dominating the field of text processing and are becoming increasingly popular in computer vision classification tasks. In order to visualize the parts of the image that led to a…
In this paper a proof is given of Sugawara's conjecture from 1936, that the ray class field of conductor $\mathfrak{f}$ over an imaginary quadratic field $K$ is generated over $K$ by a single primitive $\mathfrak{f}$-division value of the…
We develop a theory of Hrushovski-Kazhdan style motivic integration for certain type of non-archimedean o-minimal fields, namely polynomial-bounded T-convex valued fields. The structure of valued fields is expressed through a two-sorted…
In this paper, we discuss a method of constructing separable representations of the $C^*$-algebras associated to strongly connected row-finite $k$-graphs $\Lambda$. We begin by giving an alternative characterization of the…
The main purpose of this paper is to investigate some natural problems regarding the order structure of representable functionals on $^*$-algebras. We describe the extreme points of order intervals, and give a nontrivial sufficient…
In 1980s, Thurston established a topological characterization theorem for postcritically finite rational maps. In this paper, a decomposition theorem for a class of postcritically infinite branched covering termed `Herman map' is developed.…
K-FAC is a successful tractable implementation of Natural Gradient for Deep Learning, which nevertheless suffers from the requirement to compute the inverse of the Kronecker factors (through an eigen-decomposition). This can be very…
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that…
In this paper we contribute to the frequently studied question of how to decompose a continuous piecewise linear (CPWL) function into a difference of two convex CPWL functions. Every CPWL function has infinitely many such decompositions,…
The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…
We analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…
Following recent work of R. Cluckers and F. Loeser [Fonctions constructible et integration motivic I, C. R. Math. Acad. Sci. Paris 339 (2004) 411 - 416] on motivic integration, we develop a direct image formalism for positive constructible…
Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been…
Let $k$ be an algebraically closed field of characteristic zero and $P(x,y)\in k[x,y]$ be a polynomial which depends on all its variables. $P$ has an algebraic constraint if the set $\{(P(a,b),(P(a',b'),P(a',b),P(a,b')\,|\,a,a',b,b'\in k\}$…
We propose the Relational Tucker3 (RT) decomposition for multi-relational link prediction in knowledge graphs. We show that many existing knowledge graph embedding models are special cases of the RT decomposition with certain predefined…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…