Deep Linear Networks for Matrix Completion—an Infinite Depth Limit (Q6084954): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Learning deep linear neural networks: Riemannian gradient flows and convergence to global minimizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of an analytic singular value decomposition of a matrix valued function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2748505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of many large random matrices and gradients in deep neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Barriers on Convex Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778802 / rank
 
Normal rank

Revision as of 09:45, 21 August 2024

scientific article; zbMATH DE number 7773364
Language Label Description Also known as
English
Deep Linear Networks for Matrix Completion—an Infinite Depth Limit
scientific article; zbMATH DE number 7773364

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references