Inductive Matrix Completion with Feature Selection

M. Burkina, I. Nazarov, M. Panov, G. Fedonin, B. Shirokikh

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

Abstract: We consider the problem of inductive matrix completion, i.e., the reconstruction of a matrix using side features of its rows and columns. In numerous applications, however, side information of this kind includes redundant or uninformative features, so feature selection is required. An approach based on matrix factorization with group LASSO regularization on the coefficients of the side features is proposed, which combines feature selection with matrix completion. It is proved that the theoretical sample complexity for the proposed approach is lower than for methods without sparsifying. A computationally efficient iterative procedure for simultaneous matrix completion and feature selection is proposed. Experiments on synthetic and real-world data demonstrate that, due to the feature selection procedure, the proposed approach outperforms other methods.

Original languageEnglish
Pages (from-to)719-732
Number of pages14
JournalComputational Mathematics and Mathematical Physics
Volume61
Issue number5
DOIs
Publication statusPublished - May 2021

Keywords

  • group sparsity
  • inductive matrix completion
  • sample complexity

Fingerprint

Dive into the research topics of 'Inductive Matrix Completion with Feature Selection'. Together they form a unique fingerprint.

Cite this