相关论文: Approximate Real Symmetric Tensor Rank

We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…

This paper studies how to compute all real eigenvalues of a symmetric tensor. As is well known, the largest or smallest eigenvalue can be found by solving a polynomial optimization problem, while the other middle eigenvalues can not. We…

We analyze rank decompositions of the $3\times 3$ matrix multiplication tensor over $\mathbb{Z}/2\mathbb{Z}$. We restrict our attention to decompositions of rank $\le 21$, as only those decompositions will yield an asymptotically faster…

Let $W$ be a finite dimensional vector space over a field with characteristic not equal to 2. Denote by $\text{Sym}(V)$ and $\text{Skew-Sym}(V)$ the subspaces of symmetric and skew-symmetric tensors of a subspace $V$ of $W\otimes W$,…

In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion. We introduce a class of tensor norms by allowing for different levels of coherence, which…

This note demonstrates that we can stably recover all symmetric Toeplitz matrices $\pmb{X}_0\in\mathbb{R}^{n\times n}$ of rank at most $r$ from a number of rank-one subgaussian measurements on the order of $r\log^{2} n$ with an…

In this paper we discuss the notion of singular vector tuples of a complex valued $d$-mode tensor of dimension m_1 x ... x m_d. We show that a generic tensor has a finite number of singular vector tuples, viewed as points in the…

In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can,…

Given a tensor $f$ in a Euclidean tensor space, we are interested in the critical points of the distance function from $f$ to the set of tensors of rank at most $k$, which we call the critical rank-at-most-$k$ tensors for $f$. When $f$ is a…

We consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in…

We study the case of a real homogeneous polynomial $P$ whose minimal real and complex decompositions in terms of powers of linear forms are different. We prove that, if the sum of the complex and the real ranks of $P$ is at most $…

In this paper we focus on the problem of completion of multidimensional arrays (also referred to as tensors) from limited sampling. Our approach is based on a recently proposed tensor-Singular Value Decomposition (t-SVD) [1]. Using this…

The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial time algorithms…

We study the optimization problem for decomposing $d$ dimensional fourth-order Tensors with $k$ non-orthogonal components. We derive \textit{deterministic} conditions under which such a problem does not have spurious local minima. In…

Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…

Low-rank tensor approximations have shown great potential for uncertainty quantification in high dimensions, for example, to build surrogate models that can be used to speed up large-scale inference problems (Eigel et al., Inverse Problems…

This paper studies a tensor-structured linear regression model with a scalar response variable and tensor-structured predictors, such that the regression parameters form a tensor of order $d$ (i.e., a $d$-fold multiway array) in…

Statistical methods relating tensor predictors to scalar outcomes in a regression model generally vectorize the tensor predictor and estimate the coefficients of its entries employing some form of regularization, use summaries of the tensor…

Symmetric trace-free tensors are used in many areas of physics, including electromagnetism, relativistic celestial mechanics and geodesy, as well as in the study of gravitational radiation and gravitational lensing. Their use allows…

For the antisymmetric tensors the paper examines a low-rank approximation which is represented via only three vectors. We describe a suitable low-rank format and propose an alternating least squares structure-preserving algorithm for…