Generalization analysis of deep nonlinear matrix completion
We provide generalization bounds for matrix completion with Schatten $p$ quasi-norm constraints, which is equivalent to deep matrix factorization with Frobenius constraints. In the uniform sampling regime, the sample complexity scales like $\widetilde{O}\left( rn\right)$ where $n$ is the size of the...
Saved in:
Main Authors: | LEDENT, Antoine, ALVES, Rodrigo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9303 https://ink.library.smu.edu.sg/context/sis_research/article/10303/viewcontent/ledent24a.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) -
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) -
On approximating matrix norms in data streams
by: Li, Yi, et al.
Published: (2021) -
An empirical study of the discreteness prior in low-rank matrix completion
by: ALVES, Rodrigo, et al.
Published: (2021)