Related papers: Matrix Factorizations, Minimal Models and Massey P…
Matrix factorization is an important mathematical problem encountered in the context of dictionary learning, recommendation systems and machine learning. We introduce a new `decimation' scheme that maps it to neural network models of…
The explicit McKay correspondence, as formulated by Gonzalez-Sprinberg and Verdier, associates to each exceptional divisor in the minimal resolution of a rational double point a matrix factorization of the equation of the rational double…
The model reduction problem for high-order multi-input, multi-output (MIMO) polynomial nonlinear systems based on moment matching is addressed. The technique of power-series decomposition is exploited: this decomposes the solution of the…
We present an approach to decomposition and factor analysis of matrices with ordinal data. The matrix entries are grades to which objects represented by rows satisfy attributes represented by columns, e.g. grades to which an image is red, a…
For $x$ an element of a field other than $0$ or $1$, we compute the order $n$ Massey products $$\langle (1-x)^{-1}, x^{-1}, \ldots, x^{-1}, (1-x)^{-1} \rangle$$ of $n-2$ factors of $x^{-1}$ and two factors of $(1-x)^{-1}$ by embedding…
We discuss how matrix factorizations offer a practical method of computing the quiver and associated superpotential for a hypersurface singularity. This method also yields explicit geometrical interpretations of D-branes (i.e., quiver…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
In this work we consider the Takagi factorization of a matrix valued function depending on parameters. We give smoothness and genericity results and pay particular attention to the concerns caused by having either a singular value equal to…
In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
We introduce the $D$-decomposition, a non-orthogonal matrix factorization of the form $A \approx P D Q$, where $P \in \mathbb{R}^{n \times k}$, $D \in \mathbb{R}^{k \times k}$, and $Q \in \mathbb{R}^{k \times n}$. The decomposition is…
We observe that there is an equivalence between the singularity category of an affine complete intersection and the homotopy category of matrix factorizations over a related scheme. This relies in part on a theorem of Orlov. Using this…
We extend Massey products from cohomology to differential cohomology via stacks, organizing and generalizing existing constructions in Deligne cohomology. We study the properties and show how they are related to more classical Massey…
We discuss bosonic and supersymmetric Yang-Mills matrix models with compact semi-simple gauge group. We begin by finding convergence conditions for the partition and correlation functions. Moving on, we specialise to the SU(N) models with…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
This paper studies the universal first-order Massey product of a prefactorization algebra, which encodes higher algebraic operations on the cohomology. Explicit computations of these structures are carried out in the locally constant case,…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be…
Let $(S,\mathfrak n)$ be a regular local ring and $f$ a non-zero element of $\mathfrak n^2$. A theorem due to Kn\"orrer states that there are finitely many isomorphism classes of maximal Cohen-Macaulay $R=S/(f)$-modules if and only if the…