相关论文: Identifiability for a class of symmetric tensors

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…

In data processing and machine learning, an important challenge is to recover and exploit models that can represent accurately the data. We consider the problem of recovering Gaussian mixture models from datasets. We investigate symmetric…

A linear relation, i.e., a multivalued operator $T$ from a Hilbert space ${\mathfrak H}$ to a Hilbert space ${\mathfrak K}$ has Lebesgue type decompositions $T=T_{1}+T_{2}$, where $T_{1}$ is a closable operator and $T_{2}$ is an operator or…

For any irreducible non-degenerate variety $X\subset \mathbb{P}^r$, we give a criterion for the $(k,s)$-identifiability of $X$. If $k\leq s-1 <r$, then the $(k,s)$-identifiability holds for $X$ if and only if the $s$-identifiability holds…

Canonical Polyadic Decomposition (CPD) of a third-order tensor is a minimal decomposition into a sum of rank-$1$ tensors. We find new mild deterministic conditions for the uniqueness of individual rank-$1$ tensors in CPD and present an…

The analysis and visualization of tensor fields is a very challenging task. Besides the cases of zeroth- and first-order tensors, most techniques focus on symmetric second-order tensors. Only a few works concern totally symmetric tensors of…

A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization and tensor complementarity…

Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace…

In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…

Motivated by the search for a deeper understanding of tensor rank, in view of its computational complexity applications, we investigate a possible path to determine the maximum symmetric rank in given degree and dimension. We work in terms…

The second order Killing and conformal tensors are analyzed in terms of their spectral decomposition, and some properties of the eigenvalues and the eigenspaces are shown. When the tensor is of type I with only two different eigenvalues,…

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…

Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…

Let n_d denote the degree d Veronese embedding of a projective space P^r. For any symmetric tensor P, the 'symmetric tensor rank' sr(P) is the minimal cardinality of a subset A of P^r, such that n_d(A) spans P. Let S(P) be the space of all…

It is well-known that a symmetric matrix with its entries $\pm1$ is not positive definite. But this is not ture for symmetric tensors (hyper-matrix). In this paper, we mainly dicuss the positive (semi-)definiteness criterion of a class of…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

We introduce the ``skew apolarity lemma'' and we use it to give algorithms for the skew-symmetric rank and the decompositions of tensors in {$\bigwedge^dV_{\mathbb{C}}$ with $d\leq 3$ and $\dim V_{\mathbb{C}} \leq 8$}. New algorithms to…

Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…

We report about the state of the art on complex and real generic identifiability of tensors, we describe some of our recent results obtained in [6] and we present perspectives on the subject.