ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1206.6470
  4. Cited By
A Combinatorial Algebraic Approach for the Identifiability of Low-Rank
  Matrix Completion

A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion

27 June 2012
Franz J. Király
Ryota Tomioka
ArXivPDFHTML

Papers citing "A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion"

3 / 3 papers shown
Title
Restricted strong convexity and weighted matrix completion: Optimal
  bounds with noise
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
S. Negahban
Martin J. Wainwright
172
521
0
10 Sep 2010
A Gradient Descent Algorithm on the Grassman Manifold for Matrix
  Completion
A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion
Raghunandan H. Keshavan
Sewoong Oh
88
393
0
27 Oct 2009
Matrix Completion from a Few Entries
Matrix Completion from a Few Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
326
1,242
0
20 Jan 2009
1