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

耦合非负张量分解的快速学习:基于最优梯度和低秩近似

Fast Learnings of Coupled Nonnegative Tensor Decomposition Using Optimal Gradient and Low-rank Approximation

Stem Cell Clinical Research Center, The First Affiliated Hospital of Dalian Medical University(大连医科大学附属第一医院干细胞临床研究中心);Dalian Innovation Institute of Stem Cell and Precision Medicine(大连干细胞与精准医学创新研究院);Faculty of Information Technology, University of Jyväskylä(于韦斯屈莱大学信息技术学院);School of Biomedical Engineering, Faculty of Medicine, Dalian University of Technology(大连理工大学医学院生物医学工程学院);Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology), Ministry of Education(教育部社会计算与认知智能重点实验室)

Xiulin Wang, Jing Liu, Fengyu Cong

AI总结:

针对多块张量联合分解中共享信息挖掘困难及计算负担大的问题,提出CoNCPD-APG及结合低秩近似的lraCoNCPD-APG算法,在合成、人脸及EEG数据上验证了高效性与优越性。

摘要:

张量分解是一种在信号处理、机器学习和各种其他领域广泛应用的基础技术。然而,传统的张量分解方法在联合分析多块张量时面临局限性,因为它们往往难以有效地探索张量之间的共享信息。在本研究中,我们首先引入一种新颖的耦合非负CANDECOMP/PARAFAC分解算法,该算法通过交替近端梯度方法(CoNCPD-APG)进行优化。该算法专门设计用于应对联合分解部分或完全链接的不同张量的挑战,同时提取公共成分、个体成分和核心张量。鉴于在高维张量数据上优化非负约束所固有的计算挑战,我们进一步提出了lraCoNCPD-APG算法。通过将低秩近似与所提出的CoNCPD-APG方法相结合,该算法能够显著降低计算负担而不牺牲分解质量,特别是对于多块大规模张量。在合成数据、真实人脸图像数据和两种脑电图(EEG)数据上进行的仿真实验证明了所提出算法在耦合非负张量分解问题中的实用性和优越性。我们的结果强调了我们的方法在从复杂的多块张量数据中揭示有意义模式和结构方面的有效性,从而为未来的应用提供了宝贵的见解。

英文摘要:

Tensor decomposition is a fundamental technique widely applied in signal processing, machine learning, and various other fields. However, traditional tensor decomposition methods encounter limitations when jointly analyzing multi-block tensors, as they often struggle to effectively explore shared information among tensors. In this study, we first introduce a novel coupled nonnegative CANDECOMP/PARAFAC decomposition algorithm optimized by the alternating proximal gradient method (CoNCPD-APG). This algorithm is specially designed to address the challenges of jointly decomposing different tensors that are partially or fully linked, while simultaneously extracting common components, individual components and, core tensors. Recognizing the computational challenges inherent in optimizing nonnegative constraints over high-dimensional tensor data, we further propose the lraCoNCPD-APG algorithm. By integrating low-rank approximation with the proposed CoNCPD-APG method, the proposed algorithm can significantly decrease the computational burden without compromising decomposition quality, particularly for multi-block large-scale tensors. Simulation experiments conducted on synthetic data, real-world face image data, and two kinds of electroencephalography (EEG) data demonstrate the practicality and superiority of the proposed algorithms for coupled nonnegative tensor decomposition problems. Our results underscore the efficacy of our methods in uncovering meaningful patterns and structures from complex multi-block tensor data, thereby offering valuable insights for future applications.

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

↑