Spectral norm of random tensors

We show that the spectral norm of a random n1× n2× cdots × nK tensor (or higher-order array) scales as Oleft(√(sumk=1Knk)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.