Orthogonal Inductive Matrix Completion

Abstract

We propose orthogonal inductive matrix completion (OMIC), an interpretable approach to matrix completion based on a sum of multiple orthonormal side information terms, together with nuclear-norm regularization. The approach allows us to inject prior knowledge about the singular vectors of the ground truth matrix. We optimize the approach by a provably converging algorithm, which optimizes all components of the model simultaneously. We study the generalization capabilities of our method in both the distribution-free setting and in the case where the sampling distribution admits uniform marginals, yielding learning guarantees that improve with the quality of the injected knowledge in both cases. As particular cases of our framework, we present models which can incorporate user and item biases or community information in a joint and additive fashion. We analyse the performance of OMIC on several synthetic and real datasets. On synthetic datasets with a sliding scale of user bias relevance, we show that OMIC better adapts to different regimes than other methods. On real-life datasets containing user/items recommendations and relevant side information, we find that OMIC surpasses the state-of-the-art, with the added benefit of greater interpretability.

To appear in Transactions of Neural Networks and Learning Systems (TNNLS)

References in corpus (13)

• Semi-Supervised Classification with Graph Convolutional Networks
• Deep Convolutional Networks on Graph-Structured Data
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
• Matrix Completion on Graphs
• Machine Learning in Thermodynamics: Prediction of Activity Coefficients by Matrix Completion
• Community Detection with Side Information: Exact Recovery under the Stochastic Block Model
• Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions
• MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs
• Collective Matrix Completion
• Generalization error bounds for kernel matrix completion and extrapolation
• Matrix Completion from Non-Uniformly Sampled Entries
• Low-rank Matrix Completion in a General Non-orthogonal Basis