The paper introduces Coupled Tensor‑Tensor Completion (CTTC), a new framework that incorporates side information in tensor form to enhance tensor completion tasks. CTTC leverages hidden connections among multimodal tensors and is grounded in distance metric learning and group theory. Experiments on the DTD and LINCS datasets show that CTTC outperforms existing methods such as HaLRTC, CTRC, Cell, and NTDDR in both runtime and root‑sum‑of‑squares error for drug effect prediction.
By Maryam Bagherian, Albert Hung, Ivo Dinov, Joshua Welch
The paper introduces Coupled Tensor‑Tensor Completion (CTTC), a new framework that incorporates side information in tensor form to enhance tensor completion tasks. CTTC leverages hidden connections among multimodal tensors and is grounded in distance metric learning and group theory. Experiments on the DTD and LINCS datasets show that CTTC outperforms existing methods such as HaLRTC, CTRC, Cell, and NTDDR in both run‑time and root‑sum‑of‑errors accuracy for predicting drug effects.
arXiv:2412. 07041v4 Announce Type: replace-cross Abstract: Recovering incomplete multidimensional tensor-structured data is a fundamental task in many real-world applications.
By Mengying Lei, Lijun Sun
arXiv:2607. 27507v1 Announce Type: new Abstract: Matrix factorisation is a fundamental tool for exploiting low-dimensional structure in high-dimensional data, with applications such as data compression, denoising, structure discovery, interpretable representation learning, and dimensionality reduction.
By Tingting Mu
arXiv:2506.04166v3 Announce Type: replace
Abstract: Nearest neighbor (NN) methods have re-emerged as competitive tools for matrix completion, offering strong empirical performance and recent theoreti...
By Caleb Chin, Aashish Khubchandani, Harshvardhan Maskara, Kyuseong Choi, Jacob Feitelberg, Albert Gong, Manit Paul, Tathagata Sadhukhan, Dwaipayan Saha, Anish Agarwal, Raaz Dwivedi
arXiv:2607. 20084v1 Announce Type: cross Abstract: Non--negative matrix factorization (NMF) has become an established dimensionality reduction technique for extracting latent structures from non--negative data and has found widespread applications in fields such as bioinformatics, text mining, image analysis, and recommender systems.
By Volkan Sevin\c{c}, Nikolas Kontemeniotis, Theodoros Perdikis, Michail Tsagris
arXiv:2606. 00584v1 Announce Type: cross Abstract: This paper proposes Spectra-Guided Neural Tucker Factorization (SG-NTF) for High-Dimensional and Incomplete (HDI) tensor completion.
By Fusheng Wang, Yikai Hou
arXiv:2609.39613v1 Announce Type: new
Abstract: Missing data are a fundamental challenge in statistical analysis and machine learning, as the choice of imputation method substantially impacts downstr...
By Jinwei Li, Michelle Bruch, Daniel Tenbrinck
arXiv:2603.02720v2 Announce Type: replace
Abstract: Recently, tensor decompositions have attracted increasing attention. Fundamentally, different interactions among factors induce distinct tensor dec...
By Ting-Wei Zhou, Xi-Le Zhao, Sheng Liu, Wei-Hao Wu, Yu-Bang Zheng, Deyu Meng
arXiv:2608. 14951v1 Announce Type: new Abstract: Low-rank matrix decompositions can uncover patterns and structure in data and have a number of different applications across many disciplines.
By Ying-Qiu Zheng, Alex Fung, Stephen M Smith, Rogier B Mars, Saad Jbabdi
Tensor Completion using Subspace Information (TCSI) is an algorithm that leverages side information by estimating a subspace and reformulating tensor completion as a matrix regression problem. Theoretical analysis shows that accurate subspace information reduces sample complexity to nearly linear in the uncoupled ambient dimensions and relaxes signal-to-noise ratio requirements compared to existing guarantees. Numerical simulations and an application to reconstructing global Total Electron Content (TEC) maps demonstrate lower reconstruction errors than competing methods.
By Jingyang Li, Michael K. Ng
arXiv:2607. 09546v1 Announce Type: new Abstract: We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework.
By Beno\^it Loucheur, P. -A. Absil, Michel Journ\'ee