Related papers: An insertion algorithm for catabolizability
We introduce a novel framework for Generalized Tensor Transforms (GTTs), constructed through an $n$-fold tensor product of an arbitrary $b \times b$ unitary matrix $W$. This construction generalizes many established transforms, by providing…
The rules of canonical quantization normally offer good results, but sometimes they fail, e.g., leading to quantum triviality ($=$ free) for certain examples that are classically nontrivial ($\ne$ free). A new procedure, called Enhanced…
We derive the effective theories for heavy particles with a functional integral approach by integrating away the states with high velocity and with high virtuality. This formulation is non-perturbative and has a close connection with the…
Most algorithms in classical and contemporary machine learning focus on correlation-based dependence between features to drive performance. Although success has been observed in many relevant problems, these algorithms fail when the…
We present a scheme for the analytic computation of renormalization functions on the lattice, using a symbolic manipulation computer language. Our first nontrivial application is a new three-loop result for the topological susceptibility.
We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…
Results of Morse and Schilling show that the set of increasing factorizations of reduced words for a permutation is naturally a crystal for the general linear Lie algebra. Hiroshima has recently constructed two superalgebra analogues of…
Continuous-output neural machine translation (CoNMT) replaces the discrete next-word prediction problem with an embedding prediction. The semantic structure of the target embedding space (i.e., closeness of related words) is intuitively…
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of…
We present the mathematical context of the predictive accuracy index and then introduce the definition of integral average transform. We establish the relation of our definition with two variables kernels $K({\bf y},{\bf x})$. As an example…
In his seminal work with NK algorithms, Kauffman noted that fitness outcomes from algorithms navigating an NK landscape show a sharp decline at high complexity arising from pervasive interdependence among problem dimensions. This phenomenon…
Regularization of neural machine translation is still a significant problem, especially in low-resource settings. To mollify this problem, we propose regressing word embeddings (ReWE) as a new regularization technique in a system that is…
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example genomic networks. A novel algorithm, dubbed Graphitour, for…
We consider a perturbation of an ``integrable'' Hamiltonian and give an expression for the canonical or unitary transformation which ``simplifies'' this perturbed system. The problem is to invert a functional defined on the Lie- algebra of…
Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…
This paper investigates techniques for knowledge injection into word embeddings learned from large corpora of unannotated data. These representations are trained with word cooccurrence statistics and do not commonly exploit syntactic and…
In this paper, we present an abstract framework of many-valued modal logic with the interpretation of atomic propositions and modal operators as predicate lifting over coalgebras for an endofunctor on the category of sets. It generalizes…
Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…
It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the…