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...

Full description

Saved in:
Bibliographic Details
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
Be the first to leave a comment!
You must be logged in first