Generalization bounds for inductive matrix completion in low-noise settings
We study inductive matrix completion (matrix completion with side information) under an i.i.d. subgaussian noise assumption at a low noise regime, with uniform sampling of the entries. We obtain for the first time generalization bounds with the following three properties: (1) they scale like the sta...
Saved in:
Main Authors: | LEDENT, Antoine, ALVES, Rodrigo, LEI, Yunwen, GUERMEUR, Yann, KLOFT, Marius |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7951 https://ink.library.smu.edu.sg/context/sis_research/article/8954/viewcontent/26018_Article_Text_30081_1_2_20230626.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Fine-grained generalization analysis of 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) -
Orthogonal inductive matrix completion
by: LEDENT, Antoine, et al.
Published: (2021) -
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)