# Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation

The completion of low rank matrices from few entries is a task with many practical applications. We consider here two aspects of this problem: detectability, i.e. the ability to estimate the rank $r$ reliably from the fewest possible random entries, and performance in achieving small reconstruction error... (read more)

PDF Abstract NeurIPS 2015 PDF NeurIPS 2015 Abstract

No code implementations yet. Submit your code now