Extreme ratio between spectral and Frobenius norms of nonnegative tensors

@article{Cao2022ExtremeRB,
  title={Extreme ratio between spectral and Frobenius norms of nonnegative tensors},
  author={Sheng Cao and Simai He and Zhening Li and Zhen Wang},
  journal={ArXiv},
  year={2022},
  volume={abs/2206.07879}
}
One of the fundamental problems in multilinear algebra, the minimum ratio between the spectral and Frobenius norms of tensors, has received considerable attention in recent years. While most values are unknown for real and complex tensors, the asymptotic order of magnitude and tight lower bounds have been established. However, little is known about nonnegative tensors. In this paper, we present an almost complete picture of the ratio for nonnegative tensors. In particular, we provide a tight… 

Tables from this paper

References

SHOWING 1-10 OF 26 REFERENCES

On norm compression inequalities for partitioned block tensors

TLDR
It is proved that for the tensor spectral norm, the norm of the compressed tensor is an upper bound of the normOf the original tensor, and this result can be extended to a general class of Tensor spectral norms.

On orthogonal tensors and best rank-one approximation ratio

TLDR
A connection between the (non)existence of real orthogonal tensors of order three and the classical Hurwitz problem on composition algebras can be established: existence of Orthogonal Tensors of size is equivalent to the admissibility of the triple $[\ell,m,n]$ to the Hurwitzproblem.

Probabilistic bounds on best rank-one approximation ratio

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result

Nuclear norm of higher-order tensors

TLDR
An analogue of Banach's theorem for tensor spectral norm and Comon's conjecture for Tensor rank is established --- for a symmetric tensor, its symmetric nuclear norm always equals its nuclear norm.

The Best Rank-One Approximation Ratio of a Tensor Space

  • L. Qi
  • Mathematics, Computer Science
    SIAM J. Matrix Anal. Appl.
  • 2011
TLDR
It turns out that in the finite dimensional case this provides an upper bound for the quotient of the residual of the best rank-one approximation of any tensor in that Tensor space and the norm of that tensor.

Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions

  • Zhening Li
  • Computer Science, Mathematics
    SIAM J. Matrix Anal. Appl.
  • 2016
TLDR
When a tensor is partitioned into its matrix slices, the inequalities provide polynomial-time worst-case approximation bounds for computing the spectral norm and the nuclear norm of the tensor.

Maximum relative distance between symmetric rank-two and rank-one tensors

It is shown that the relative distance in Frobenius norm of a real symmetric order-d tensor of rank two to its best rank-one approximation is upper bounded by √ 1 − (1 − 1/d)d−1. This is achieved by

Some results concerning rank-one truncated steepest descent directions in tensor spaces

  • A. Uschmajew
  • Computer Science
    2015 International Conference on Sampling Theory and Applications (SampTA)
  • 2015
TLDR
This work presents a conceptual review of this approach to finding low-rank solutions to matrix or tensor optimization tasks by greedy rank-one methods, and provides some new insights.

Spectral norm of random tensors

TLDR
It is shown that the spectral norm of a random tensor (or higher-order array) scales as O(\sqrt{(\sum_{k=1}^{K}n_k)\log(K)}\right) under some sub-Gaussian assumption on the entries.