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(教育部社会计算与认知智能重点实验室)
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.
Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
Guangdong University of Technology(广东工业大学);RIKEN Brain Science Institute(理化学研究所脑科学研究所);Systems Research Institute, Polish Academy of Science(波兰科学院系统研究所)
On Large-Scale Dynamic Topic Modeling with Nonnegative CP Tensor Decomposition
Southern Methodist University(南卫理公会大学);Grinnell College(格林内尔学院);University of California, Los Angeles(加利福尼亚大学洛杉矶分校);Colorado State University(科罗拉多州立大学);California State University, Channel Islands(加利福尼亚州立大学海峡群岛分校);Occidental College(西方学院);Boston Medical Center(波士顿医疗中心)
National Institute of Informatics(国立信息学研究所);JST, PRESTO(日本科学技术振兴机构先驱研究项目);RIKEN Center for Brain Science(理化学研究所脑科学中心);The University of Tokyo(东京大学);NIMS(日本物质材料研究机构);RIKEN AIP(理化学研究所先进智能项目中心)
Improved SVD-based Initialization for Nonnegative Matrix Factorization using Low-Rank Correction
Graduate School of Science and Engineering(研究生院);PAF-Karachi Institute of Economics and Technology(卡拉奇经济和技术学院);Department of Mathematics and Operational Research(数学与运筹学系)
FCNCP: A Coupled Nonnegative CANDECOMP/PARAFAC Decomposition Based on Federated Learning
School of Biomedical Engineering, Faculty of Medicine, Dalian University of Technology(大连理工大学医学院生物医学工程学院);Key Laboratory of Integrated Circuit and Biomedical Electronic System, Liaoning Province, Dalian University of Technology(大连理工大学辽宁省集成电路与生物医学电子系统重点实验室);Stem Cell Clinical Research Center, the First Affiliated Hospital of Dalian Medical University(大连医科大学附属第一医院干细胞临床研究中心);Dalian Innovation Institute of Stem Cell and Precision Medicine(大连干细胞与精准医学创新研究院);Key Laboratory of Social Computing and Cognitive Intelligence (Dalian University of Technology), Ministry of Education, China(教育部社会计算与认知智能重点实验室(大连理工大学))