Group-Sparse Inductive Matrix Completion Through Transfer Learning
The emergence of big data has enabled the creation of significant models by allowing the storage of large data volumes. Transfer learning is a machine learning technique that transfers knowledge between different domains by utilizing pretrained models from the source domain to optimize the target domain. In contrast, inductive matrix completion is a method that leverages side information from multiple sources to improve task performance. This paper explores inductive matrix completion within the transfer learning framework, with our proposed approach assuming group sparsity for the difference between the core matrices of the target and source domains. Theoretical guarantees of our method are investigated to demonstrate the gains achieved through transfer learning compared with standard inductive matrix completion. Several synthetic experiments are conducted to evaluate the performance of the proposed approach and existing methods, demonstrating that our method outperforms others.
Authors
- Hengfang Wang (ORCID: https://orcid.org/0000-0002-0472-2073)
- Xiaojun Mao (ORCID: https://orcid.org/0000-0002-9362-508X)
- Zhonglei Wang
Institutions
- Fujian Normal University (CN)
- Shanghai Jiao Tong University (CN)
- Xiamen University (CN)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2025-09-16
- DOI
- https://doi.org/10.1109/tit.2025.3610522
- Primary Topic
- Machine Learning and ELM
- Type
- article
- Field-Weighted Citation Impact
- 0.00