arXiv · 1407.1870
Spectral norm of random tensors
Abstract
We show that the spectral norm of a random $n_1\times n_2\times \cdots \times n_K$ tensor (or higher-order array) scales as $O\left(\sqrt{(\sum_{k=1}^{K}n_k)\log(K)}\right)$ under some sub-Gaussian assumption on the entries. The proof is based on a covering number argument. Since the spectral norm is dual to the tensor nuclear norm (the tightest convex relaxation of the set of rank one tensors), the bound implies that the convex relaxation yields sample complexity that is linear in (the sum of) the number of dimensions, which is much smaller than other recently proposed convex relaxations of tensor rank that use unfolding.
Explore related subjects
Keep this discovery
Ryota Tomioka, Taiji Suzuki. 2014-07-07. Spectral norm of random tensors. https://arxiv.org/abs/1407.1870
Cite the original work for its findings. Save a collection to share your selection of sources.