Fast and low-memory compressive sensing algorithms for low tucker-rank tensor approximation from streamed measurements

Authors:
Open Access
Publisher website
Google Scholar
Abstract
In this paper we consider the problem of recovering a low-rank Tucker approximation to a massive tensor based solely on structured random compressive measurements (i.e., a sketch). Crucially, the proposed random measurement ensembles are both designed to be compactly represented (i.e., low-memory), and can also be efficiently computed in one-pass over the tensor. Thus, the proposed compressive sensing approach may be used to produce a low-rank factorization of a huge tensor that is too large to store in memory with a total memory footprint on the order of the much smaller desired low-rank factorization. In addition, the compressive sensing recovery algorithm itself (which takes the compressive measurements as input, and then outputs a low-rank factorization) also runs in a time which principally depends only on the size of the sought factorization, making its runtime sub-linear in the size of the large tensor one is approximating. Finally, unlike prior works related to (streaming) algorithms for low-rank tensor approximation from such compressive measurements, we present a unified analysis of both Kronecker and Khatri-Rao structured measurement ensembles culminating in error guarantees comparing the error of our recovery algorithm’s approximation of the input tensor to the best possible low-rank Tucker approximation error achievable for the tensor by any possible algorithm. We further include an empirical study of the proposed approach that verifies our theoretical findings and explores various trade-offs of parameters of interest.
Keywords
Funding Information
  • Division of Mathematical Sciences (NSF DMS 2106472)
  • Division of Mathematical Sciences (NSF DMS 2106472)
  • Division of Mathematical Sciences (NSF DMS 2011140)
  • Division of Mathematical Sciences (NSF DMS 2108479)
  • Division of Mathematical Sciences (NSF DMS 2011140)

This publication has 38 references indexed in Scilit: