Relaxed leverage sampling for low-rank matrix completion (Q2628266): Difference between revisions

@@ Property / cites work @@
+Completing Any Low-rank Matrix, Provably
@@ Property / cites work: Completing Any Low-rank Matrix, Provably / rank @@
+Normal rank
@@ Property / cites work @@
+Exact matrix completion via convex optimization
@@ Property / cites work: Exact matrix completion via convex optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Recovering Low-Rank Matrices From Few Coefficients in Any Basis
+Normal rank
@@ Property / cites work @@
+Sparse Approximate Solutions to Linear Systems
@@ Property / cites work: Sparse Approximate Solutions to Linear Systems / rank @@
+Normal rank
@@ Property / cites work @@
+A Simpler Approach to Matrix Completion
@@ Property / cites work: A Simpler Approach to Matrix Completion / rank @@
+Normal rank
@@ Property / cites work @@
+Robust principal component analysis?
@@ Property / cites work: Robust principal component analysis? / rank @@
+Normal rank
@@ Property / cites work @@
+Relative-Error $CUR$ Matrix Decompositions
@@ Property / cites work: Relative-Error $CUR$ Matrix Decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+CUR matrix decompositions for improved data analysis
+Normal rank
@@ Property / cites work @@
+The Power of Convex Relaxation: Near-Optimal Matrix Completion
+Normal rank
@@ Property / cites work @@
+Relaxed leverage sampling for low-rank matrix completion
+Normal rank
@@ Property / cites work @@
+User-friendly tail bounds for sums of random matrices
+Normal rank