Orthogonal inductive matrix completion
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...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7197 https://ink.library.smu.edu.sg/context/sis_research/article/8200/viewcontent/2004.01653.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-8200 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-82002022-08-29T12:57:49Z Orthogonal inductive matrix completion LEDENT, Antoine ALVES, Rrodrigo KLOFT, Marius 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 that can incorporate user and item biases or community information in a joint and additive fashion. We analyze 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. 2021-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7197 info:doi/10.1109/TNNLS.2021.3106155 https://ink.library.smu.edu.sg/context/sis_research/article/8200/viewcontent/2004.01653.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Optimization Recommender systems Training Social networking (online) Predictive models Learning systems Machine learning recommender systems statistical learning Artificial Intelligence and Robotics |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Optimization Recommender systems Training Social networking (online) Predictive models Learning systems Machine learning recommender systems statistical learning Artificial Intelligence and Robotics |
spellingShingle |
Optimization Recommender systems Training Social networking (online) Predictive models Learning systems Machine learning recommender systems statistical learning Artificial Intelligence and Robotics LEDENT, Antoine ALVES, Rrodrigo KLOFT, Marius Orthogonal inductive matrix completion |
description |
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 that can incorporate user and item biases or community information in a joint and additive fashion. We analyze 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. |
format |
text |
author |
LEDENT, Antoine ALVES, Rrodrigo KLOFT, Marius |
author_facet |
LEDENT, Antoine ALVES, Rrodrigo KLOFT, Marius |
author_sort |
LEDENT, Antoine |
title |
Orthogonal inductive matrix completion |
title_short |
Orthogonal inductive matrix completion |
title_full |
Orthogonal inductive matrix completion |
title_fullStr |
Orthogonal inductive matrix completion |
title_full_unstemmed |
Orthogonal inductive matrix completion |
title_sort |
orthogonal inductive matrix completion |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2021 |
url |
https://ink.library.smu.edu.sg/sis_research/7197 https://ink.library.smu.edu.sg/context/sis_research/article/8200/viewcontent/2004.01653.pdf |
_version_ |
1770576268123701248 |