Related papers: Robust Eigenvectors of Symmetric Tensors
We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
Sparse incidence tensors can represent a variety of structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent…
Word embedding is a powerful tool in natural language processing. In this paper we consider the problem of word embedding composition \--- given vector representations of two words, compute a vector for the entire phrase. We give a…
In this work, we consider the optimization formulation for symmetric tensor decomposition recently introduced in the Subspace Power Method (SPM) of Kileel and Pereira. Unlike popular alternative functionals for tensor decomposition, the SPM…
We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…
We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only…
Let $\mathcal{A}$ be an order $t$ dimension $m\times n\times \cdots \times n$ tensor over complex field. In this paper, we study some {generalized inverses} of $\mathcal{A}$, the {$k$-T-idempotent tensors} and the idempotent tensors based…
High-dimensional data in the form of tensors are challenging for kernel classification methods. To both reduce the computational complexity and extract informative features, kernels based on low-rank tensor decompositions have been…
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e., it is a sum of…
In this paper, the generalized eigenvalue complementarity problem for tensors (GEiCP-T) is addressed, which arises from the stability analysis of finite dimensional mechanical systems and find applications in differential dynamical systems.…
A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…
In this paper, we consider higher order paired symmetric tensors and strongly paired symmetric tensors. Elasticity tensors and higher order elasticity tensors in solid mechanics are strongly paired symmetric tensors. A (strongly) paired…
We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
A Waring decomposition of a (homogeneous) polynomial f is a minimal sum of powers of linear forms expressing f. Under certain conditions, such a decomposition is unique. We discuss some algorithms to compute the Waring decomposition, which…
Motivated by symmetric Cauchy matrices, we define symmetric Cauchy tensors and their generating vectors in this paper. Hilbert tensors are symmetric Cauchy tensors. An even order symmetric Cauchy tensor is positive semi-definite if and only…
The problem of symmetric rank-one approximation of symmetric tensors is important in Independent Components Analysis, also known as Blind Source Separation, as well as polynomial optimization. We analyze the symmetric rank-one approximation…
In this work, we present a new characterization of symmetric $H^+$-tensors. It is known that a symmetric tensor is an $H^+$-tensor if and only if it is a generalized diagonally dominant tensor with nonnegative diagonal elements. By…
Nonnegative tensor factorization has applications in statistics, computer vision, exploratory multiway data analysis and blind source separation. A symmetric nonnegative tensor, which has a symmetric nonnegative factorization, is called a…