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

基于嵌入对齐的链式多重矩阵整合

Chain-linked multiple matrix integration via embedding alignment

Runbing Zheng, Minh Tang

AI总结:

本文提出链式多重矩阵整合(CMMI)方法,通过实体嵌入、重叠对齐与聚合,在仅有少量含噪重叠子矩阵的分块缺失场景下高效重建完整矩阵,并给出误差界与正态近似,模拟和实际数据验证了其有效性。

摘要:

受各科学领域对多源数据整合日益增长的需求驱动,本文研究数据呈现特定分块缺失结构时的矩阵补全问题——具体而言,只有少数代表完整矩阵(重叠)部分的含噪子矩阵可用。我们提出链式多重矩阵整合(CMMI)方法,以高效地结合从这些单个含噪子矩阵中提取的信息。CMMI 首先为每个观测子矩阵推导实体嵌入,然后利用子矩阵对之间的重叠实体对齐这些嵌入,最后聚合它们以重建整个目标矩阵。在温和的正则性条件下,我们建立了 CMMI 估计的逐元素误差界和正态近似。模拟研究和实际数据应用表明,即使在观测子矩阵之间的重叠极少的情况下,CMMI 在计算上也是高效的,并且能有效恢复完整矩阵。

英文摘要:

Motivated by the increasing demand for multi-source data integration in various scientific fields, in this paper we study matrix completion in scenarios where the data exhibits certain block-wise missing structures -- specifically, where only a few noisy submatrices representing (overlapping) parts of the full matrix are available. We propose the Chain-linked Multiple Matrix Integration (CMMI) procedure to efficiently combine the information that can be extracted from these individual noisy submatrices. CMMI begins by deriving entity embeddings for each observed submatrix, then aligns these embeddings using overlapping entities between pairs of submatrices, and finally aggregates them to reconstruct the entire matrix of interest. We establish, under mild regularity conditions, entrywise error bounds and normal approximations for the CMMI estimates. Simulation studies and real data applications show that CMMI is computationally efficient and effective in recovering the full matrix, even when overlaps between the observed submatrices are minimal.

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

↑