低CP秩随机压缩张量的可恢复性
On Recoverability of Randomly Compressed Tensors with Low CP Rank
摘要:
我们的兴趣在于压缩张量在\textit{canonical polyadic decomposition}(CPD)模型下的可恢复性。所考虑的问题在许多应用中是有动机的,例如,高光谱图像和视频压缩。以前的工作在有些特殊的假设下研究了这个问题-例如,张量的潜在因子是稀疏的或从绝对连续的分布中提取。我们提供了一个替代的结果:我们表明,如果张量被压缩的亚高斯线性映射,那么张量是可恢复的,如果测量的数量是在相同的数量级的模型参数-没有强假设的潜在因素。我们的证明是基于推导一个\textit{restricted isometry property}(R. I. P.)在CPD模型下,通过集合覆盖技术,从而表现出经典的压缩感知的味道。新的可恢复性结果丰富了对压缩CP张量恢复问题的理解,为恢复元素不一定连续或稀疏的张量提供了理论保证。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。