arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1811.07428cs.LGeess.SPstat.ML
收藏

压缩张量的核相容性

The core consistency of a compressed tensor

University of California, Riverside(加州大学河滨分校)

Georgios Tsitsikas, Evangelos E. Papalexakis

摘要:

大数据上的张量分解最近引起了极大的关注。其中最流行的方法是一类算法,它利用压缩来减少张量的大小,并可能并行计算。这种方法正常工作的基本要求是在压缩时保留低秩张量结构。代替高效和现实的手段计算和研究压缩对张量低秩的影响,我们研究压缩对核心一致性的影响;一个广泛使用的启发式算法,已被用作估计低秩的代理。我们提供了理论分析,在那里我们确定压缩的充分条件,使核心的一致性得到保留,我们进行了广泛的实验,验证我们的分析。此外,我们探讨流行的压缩方案,以及它们如何影响核心的一致性。

英文摘要:

Tensor decomposition on big data has attracted significant attention recently. Among the most popular methods is a class of algorithms that leverages compression in order to reduce the size of the tensor and potentially parallelize computations. A fundamental requirement for such methods to work properly is that the low-rank tensor structure is retained upon compression. In lieu of efficient and realistic means of computing and studying the effects of compression on the low rank of a tensor, we study the effects of compression on the core consistency; a widely used heuristic that has been used as a proxy for estimating that low rank. We provide theoretical analysis, where we identify sufficient conditions for the compression such that the core consistency is preserved, and we conduct extensive experiments that validate our analysis. Further, we explore popular compression schemes and how they affect the core consistency.

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

↑