Related papers: Tensor Rank: Some Lower and Upper Bounds

We define three types of upper (and lower) triangular blocked tensors, which are all generalizations of the triangular blocked matrices. We study some basic properties and characterizations of these three types of triangular blocked…

Modeling of multidimensional signal using tensor is more convincing than representing it as a collection of matrices. The tensor based approaches can explore the abundant spatial and temporal structures of the mutlidimensional signal. The…

We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…

Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…

The tensor train (TT) rank has received increasing attention in tensor completion due to its ability to capture the global correlation of high-order tensors ($\textrm{order} >3$). For third order visual data, direct TT rank minimization has…

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

In recent studies, the tensor ring (TR) rank has shown high effectiveness in tensor completion due to its ability of capturing the intrinsic structure within high-order tensors. A recently proposed TR rank minimization method is based on…

Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one…

Attempts of studying implicit regularization associated to gradient descent (GD) have identified matrix completion as a suitable test-bed. Late findings suggest that this phenomenon cannot be phrased as a minimization-norm problem, implying…

In low-rank tensor completion tasks, due to the underlying multiple large-scale singular value decomposition (SVD) operations and rank selection problem of the traditional methods, they suffer from high computational cost and high…

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…

We study extensions of compressive sensing and low rank matrix recovery (matrix completion) to the recovery of low rank tensors of higher order from a small number of linear measurements. While the theoretical understanding of low rank…

Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…

We study invariant operators in general tensor models. We show that representation theory provides an efficient framework to count and classify invariants in tensor models. In continuation and completion of our earlier work, we present two…

In this paper, we consider the estimation of a low Tucker rank tensor from a number of noisy linear measurements. The general problem covers many specific examples arising from applications, including tensor regression, tensor completion,…

We show that the border support rank of the tensor corresponding to two-by-two matrix multiplication is seven over the complex numbers. We do this by constructing two polynomials that vanish on all complex tensors with format…

In this paper we propose a tensor-based nonlinear model for high-order data classification. The advantages of the proposed scheme are that (i) it significantly reduces the number of weight parameters, and hence of required training samples,…

Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…