Effective Tensor Sketching via Sparsification

From MaRDI portal
Publication:4963971



Abstract: In this paper, we investigate effective sketching schemes via sparsification for high dimensional multilinear arrays or tensors. More specifically, we propose a novel tensor sparsification algorithm that retains a subset of the entries of a tensor in a judicious way, and prove that it can attain a given level of approximation accuracy in terms of tensor spectral norm with a much smaller sample complexity when compared with existing approaches. In particular, we show that for a kth order dimescdotsimesd cubic tensor of {it stable rank} rs, the sample size requirement for achieving a relative error varepsilon is, up to a logarithmic factor, of the order rs1/2dk/2/varepsilon when varepsilon is relatively large, and rsd/varepsilon2 and essentially optimal when varepsilon is sufficiently small. It is especially noteworthy that the sample size requirement for achieving a high accuracy is of an order independent of k. To further demonstrate the utility of our techniques, we also study how higher order singular value decomposition (HOSVD) of large tensors can be efficiently approximated via sparsification.













This page was built for publication: Effective Tensor Sketching via Sparsification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963971)