arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1103.4435cs.ITmath.IT
收藏

有限域上张量秩极小化的信息论界

Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields

Amin Emad, Olgica Milenkovic

摘要:

本文研究了一组随机线性测量的无噪声和有噪声低秩张量完备化问题。在我们的推导中,我们假设张量的条目属于任意大小的有限域,并且重建基于秩最小化框架。导出的结果表明,精确重建所需的最小测量数的上界由一个三次张量的秩,阶和维数的乘积。此外,这个条件也是唯一极小化的充分条件。类似的界限适用于噪声秩最小化场景,除了取决于信道错误概率的缩放函数。

英文摘要:

We consider the problem of noiseless and noisy low-rank tensor completion from a set of random linear measurements. In our derivations, we assume that the entries of the tensor belong to a finite field of arbitrary size and that reconstruction is based on a rank minimization framework. The derived results show that the smallest number of measurements needed for exact reconstruction is upper bounded by the product of the rank, the order and the dimension of a cubic tensor. Furthermore, this condition is also sufficient for unique minimization. Similar bounds hold for the noisy rank minimization scenario, except for a scaling function that depends on the channel error probability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑