On Recoverability of Randomly Compressed Tensors with Low CP Rank
Our interest lies in the recoverability properties of compressed tensors under the \textit{canonical polyadic decomposition} (CPD) model. The considered problem is well-motivated in many applications, e.g., hyperspectral image and video compression. Prior work studied this problem under somewhat special assumptions---e.g., the latent factors of the tensor are sparse or drawn from absolutely continuous distributions. We offer an alternative result: We show that if the tensor is compressed by a subgaussian linear mapping, then the tensor is recoverable if the number of measurements is on the same order of magnitude as that of the model parameters---without strong assumptions on the latent factors. Our proof is based on deriving a \textit{restricted isometry property} (R.I.P.) under the CPD model via set covering techniques, and thus exhibits a flavor of classic compressive sensing. The new recoverability result enriches the understanding to the compressed CP tensor recovery problem; it offers theoretical guarantees for recovering tensors whose elements are not necessarily continuous or sparse.
Code (0)
등록된 구현이 없습니다.
Tasks
Compressive SensingVideo CompressionSimilar Papers 제목 키워드 기반
GrateTile: Efficient Sparse Tensor Tiling for CNN Processing
We propose GrateTile, an efficient, hardwarefriendly data storage scheme for sparse CNN feature maps (activations). It divides data into uneven-sized subtensors and, with small indexing overhead, stores them in a compres…
Block Hankel Tensor ARIMA for Multiple Short Time Series Forecasting
This work proposes a novel approach for multiple time series forecasting. At first, multi-way delay embedding transform (MDT) is employed to represent time series as low-rank block Hankel tensors (BHT). Then, the higher-…
Time SeriesTime Series AnalysisTime Series ForecastingMulti-dimensional Signal Recovery using Low-rank Deconvolution
In this work we present Low-rank Deconvolution, a powerful framework for low-level feature-map learning for efficient signal representation with application to signal recovery. Its formulation in multi-linear algebra inh…
Hyperspectral Super-Resolution via Interpretable Block-Term Tensor Modeling
This work revisits coupled tensor decomposition (CTD)-based hyperspectral super-resolution (HSR). HSR aims at fusing a pair of hyperspectral and multispectral images to recover a super-resolution image (SRI). The vast ma…
Super-ResolutionTensor DecompositionCross: Efficient Low-rank Tensor Completion
The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries,…