arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.02415math.STstat.MEstat.TH
收藏

关于多维数据分析中协方差分离性

On Separability of Covariance in Multiway Data Analysis

University of California, Davis(加州大学戴维斯分校);University of Michigan(密歇根大学)

Dogyoon Song, Alfred O. Hero

AI总结:

本文研究多维数据协方差的分离性问题,通过量子信息理论证明通用多维协方差通常不可分离,且最佳分离近似为NP难问题,但标准算法能逼近最优解。

摘要:

多维数据分析旨在揭示多索引数组中的模式,多维协方差在许多应用中起关键作用。然而,多维协方差的高维性带来显著计算挑战。为克服此问题,提出了因子化协方差模型,假设多维协方差可表示为克罗内克积之和。本文探讨此类分离模型的可表示性、验证及近似问题,不考虑统计估计或有限样本性质。我们将判断给定协方差是否可分解为分离多维形式的问题等价于量子态分离性问题。利用量子信息理论结果,证明通用多维协方差通常并非分离,并且确定最佳分离近似是NP难问题。这些发现表明,因子化协方差模型可能过于限制且难以拟合,除非有额外结构假设。然而,我们的数值实验表明,标准迭代算法,如Frank-Wolfe和梯度下降,通常能逼近最佳分离近似。尽管NP难性涉及最坏情况计算复杂性,克罗内克可分离近似多维协方差仍可能适用于分析许多现实数据集。

英文摘要:

Multiway data analysis aims to uncover patterns in data structured as multi-indexed arrays, with multiway covariance playing a crucial role in many applications. However, the high dimensionality of multiway covariance presents significant computational challenges. To overcome these challenges, factorized covariance models have been proposed that rely on a separability assumption: the multiway covariance can be accurately expressed as a sum of Kronecker products of mode-wise covariances. This paper addresses the representability, certification, and approximation of such separable models, leaving statistical estimation or finite-sample properties aside. We reduce the question of whether a given covariance can be decomposed into a separable multiway form to an equivalent question about the separability of quantum states. Leveraging results from quantum information theory, we show that generic multiway covariances are typically \emph{not} separable and that determining the best separable approximation is NP-hard. These findings suggest that factorized covariance models can be overly restrictive and difficult to fit without additional structural assumptions. Nevertheless, our numerical experiments indicate that standard iterative algorithms, namely Frank-Wolfe and gradient descent, often converge close to the best separable approximation. As NP-hardness concerns worst-case computational complexity, Kronecker-separable approximations to multiway covariance could still be tractable to apply for analyzing many real-world datasets.

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

↑