Fine-grained generalization analysis of inductive matrix completion
In this paper, we bridge the gap between the state-of-the-art theoretical results for matrix completion with the nuclear norm and their equivalent in \textit{inductive matrix completion}: (1) In the distribution-free setting, we prove bounds improving the previously best scaling of \widetilde{O}(rd2...
Saved in:
Main Authors: | LEDENT, Antoine, ALVES, RODRIGO, LEI, Yunwen, KLOFT, Marius |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7201 https://ink.library.smu.edu.sg/context/sis_research/article/8204/viewcontent/IMC_NeurIPS_2021.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Generalization bounds for inductive matrix completion in low-noise settings
by: LEDENT, Antoine, et al.
Published: (2023) -
Uncertainty-adjusted recommendation via matrix factorization with weighted losses
by: ALVES, Rodrigo, et al.
Published: (2023) -
Generalization analysis of deep nonlinear matrix completion
by: LEDENT, Antoine, et al.
Published: (2024) -
Orthogonal inductive matrix completion
by: LEDENT, Antoine, et al.
Published: (2021) -
An empirical study of the discreteness prior in low-rank matrix completion
by: ALVES, Rodrigo, et al.
Published: (2021)