Related papers: Nonsmooth rank-one symmetric matrix factorization …
Symmetric nonnegative matrix factorization (SymNMF) is a powerful tool for clustering, which typically uses the $k$-nearest neighbor ($k$-NN) method to construct similarity matrix. However, $k$-NN may mislead clustering since the neighbors…
We construct a pairing, which we call factorization homology, between framed manifolds and higher categories. The essential geometric notion is that of a vari-framing of a stratified manifold, which is a framing on each stratum together…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
We consider the decomposition of a compact-type symmetric space into a product of factors and show that the rank-one factors, when considered as totally geodesic submanifolds of the space, are isolated from inequivalent minimal…
In the traditional quantum theory, one-dimensional quantum spin models possess a factorization surface where the ground states are fully separable having vanishing bipartite as well as multipartite entanglement. We report that in the…
$\mathcal{PT}$ symmetry is a unique platform for light manipulation and versatile use in unidirectional invisibility, lasing, sensing, etc. Broken and unbroken $\mathcal{PT}$-symmetric states in non-Hermitian open systems are described by…
Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…
The symmetric projective varieties of rank one are all smooth and Fano by a classic result of Akhiezer. We classify the locally factorial (respectively smooth) projective symmetric $G$-varieties of rank 2 which are Fano. When $G$ is…
Non-Negative Matrix Factorization (NMF) is a widely used dimension reduction method that factorizes a non-negative data matrix into two lower dimensional non-negative matrices: One is the basis or feature matrix which consists of the…
In this article, we study algorithms for nonnegative matrix factorization (NMF) in various applications involving streaming data. Utilizing the continual nature of the data, we develop a fast two-stage algorithm for highly efficient and…
We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the…
Nonnegative matrix factorization (NMF) is a popular method used to reduce dimensionality in data sets whose elements are nonnegative. It does so by decomposing the data set of interest, $\mathbf{X}$, into two lower rank nonnegative matrices…
We prove that a symplectic matrix with entries in a ring with Bass stable rank one can be factored as a product of elementary symplectic matrices. This also holds for null-homotopic symplectic matrices with entries in a Banach algebra or in…
In this article the notion of the nondecreasing (ND) rank of a matrix or tensor is introduced. A tensor has an ND rank of r if it can be represented as a sum of r outer products of vectors, with each vector satisfying a monotonicity…
In this paper, we introduce and formalize a rank-one partitioning learning paradigm that unifies partitioning methods that proceed by summarizing a data set using a single vector that is further used to derive the final clustering…
In the non-negative matrix factorization (NMF) problem, the input is an $m\times n$ matrix $M$ with non-negative entries and the goal is to factorize it as $M\approx AW$. The $m\times k$ matrix $A$ and the $k\times n$ matrix $W$ are both…
Many matrices associated with fast transforms posess a certain low-rank property characterized by the existence of several block partitionings of the matrix, where each block is of low rank. Provided that these partitionings are known,…
Existing nonnegative matrix factorization methods focus on learning global structure of the data to construct basis and coefficient matrices, which ignores the local structure that commonly exists among data. In this paper, we propose a new…
We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains morethan 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low…
We consider the three-particle scattering S-matrix for the Landau-Lifshitz model by directly computing the set of the Feynman diagrams up to the second order. We show, following the analogous computations for the non-linear Schr\"{o}dinger…