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

分区独立成分分析中的累积量张量

Cumulant Tensors in Partitioned Independent Component Analysis

Marina Garrote-López, Monroe Stephenson

AI总结:

本文探讨了独立成分分析(ICA)的扩展框架PICA,在仅源信号各分区相互独立的替代条件下,从代数视角研究混合矩阵的可识别性,推广了先前基于累积量张量零限制的可识别性结果。

摘要:

在本研究中,我们探讨了分区独立成分分析(Partitioned Independent Component Analysis, PICA),它是成熟的独立成分分析(ICA)框架的扩展。传统上,ICA侧重于从由混合矩阵定义的线性组合中提取独立源信号向量。我们旨在全面理解ICA中该混合矩阵的可识别性。对我们的研究至关重要的一点是,Mesters和Zwiernik的最新进展放宽了这些严格的独立性要求,研究了基于累积量张量零限制的混合矩阵可识别性。在本文中,我们采用替代的独立性条件,特别是PICA情形,其中仅源信号的各分区是相互独立的。我们从代数视角研究了这一情形,我们的主要结果推广了先前关于混合矩阵可识别性的结果。

英文摘要:

In this work, we explore Partitioned Independent Component Analysis (PICA), an extension of the well-established Independent Component Analysis (ICA) framework. Traditionally, ICA focuses on extracting a vector of independent source signals from a linear combination of them defined by a mixing matrix. We aim to provide a comprehensive understanding of the identifiability of this mixing matrix in ICA. Significant to our investigation, recent developments by Mesters and Zwiernik relax these strict independence requirements, studying the identifiability of the mixing matrix from zero restrictions on cumulant tensors. In this paper, we assume alternative independence conditions, in particular, the PICA case, where only partitions of the sources are mutually independent. We study this case from an algebraic perspective, and our primary result generalizes previous results on the identifiability of the mixing matrix.

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

↑