Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization (Q6136234): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix estimation by universal singular value thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: When do neural networks outperform kernel methods?* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank

Latest revision as of 17:36, 2 August 2024

scientific article; zbMATH DE number 7732339
Language Label Description Also known as
English
Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization
scientific article; zbMATH DE number 7732339

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references