相关论文: One example of general unidentifiable tensors

Most currently used tensor regression models for high-dimensional data are based on Tucker decomposition, which has good properties but loses its efficiency in compressing tensors very quickly as the order of tensors increases, say greater…

Generalized latent factor analysis not only provides a useful latent embedding approach in statistics and machine learning, but also serves as a widely used tool across various scientific fields, such as psychometrics, econometrics, and…

We present a novel analysis of the dynamics of tensor power iterations in the overcomplete regime where the tensor CP rank is larger than the input dimension. Finding the CP decomposition of an overcomplete tensor is NP-hard in general. We…

Medical imaging involves high-dimensional data, yet their acquisition is obtained for limited samples. Multivariate predictive models have become popular in the last decades to fit some external variables from imaging data, and standard…

We derive transformation formulas for the generalized polarization tensors under rigid motions and scaling in three dimensions, and use them to construct an infinite number of invariants under those transformations. These invariants can be…

We present an example of a symmetric tensor of size $800\times 800\times 800$ which can be written a sum of $903$ simple tensors with complex entries but not as a sum of $903$ symmetric simple tensors.

In this article we prove the subrank of a generic tensor in $\mathbb{C}^{n,n,n}$ to be $Q(n) = \lfloor\sqrt{3n - 2}\rfloor$ by providing a lower bound to the known upper bound. More generally, we find the generic subrank of tensors of all…

One of the fundamental open problems in the field of tensors is the border Comon's conjecture: given a symmetric tensor $F\in(\mathbb{C}^n)^{\otimes d}$ for $d\geq 3$, its border and symmetric border ranks are equal. In this paper, we prove…

We consider the problem of learning mixtures of generalized linear models (GLM) which arise in classification and regression problems. Typical learning approaches such as expectation maximization (EM) or variational Bayes can get stuck in…

The decomposition locus of a tensor is the set of rank-one tensors appearing in a minimal tensor-rank decomposition of the tensor. For tensors lying on the tangential variety of any Segre variety, but not on the variety itself, we show that…

It is easily checkable if a given tensor is a B tensor, or a B$_0$ tensor or not. In this paper, we show that a symmetric B tensor can always be decomposed to the sum of a strictly diagonally dominated symmetric M tensor and several…

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a "splitting theorem" for sets of product tensors, in which the k-rank…

Let $m,n\geq 3$, $(m-1)(n-1)+2\leq p\leq mn$, and $u=mn-p$. The set $\mathbb{R}^{u\times n\times m}$ of all real tensors with size $u\times n\times m$ is one to one corresponding to the set of bilinear maps $\mathbb{R}^m\times…

In this paper, we show that the coefficients of the E-characteristic polynomial of a tensor are orthonormal invariants of that tensor. When the dimension is 2, some simplified formulas of the E-characteristic polynomial are presented. A re-…

This study clarifies the proper criteria to assess the modeling capacity of a general tensor model. The work analyze the problem based on the study of tensor ranks, which is not a well-defined quantity for higher order tensors. To process,…

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…

There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher, that parallels the Eckart-Young theorem for matrices. In this paper, we argue that the naive approach to this…

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…

We study asymmetric rank-one spiked tensor models in the high-dimensional regime, where the noise entries are independent and identically distributed with zero mean, unit variance, and finite fourth moment. This extends the classical…