A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1984492644
@@ Property / OpenAlex ID: W1984492644 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0407
@@ Property / arXiv ID: 1006.0407 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast computation of low rank matrix approximations
+Normal rank
@@ Property / cites work @@
+Fast computation of low-rank matrix approximations
+Normal rank
@@ Property / cites work @@
+A Fast Random Sampling Algorithm for Sparsifying Matrices
+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 @@
+The Power of Convex Relaxation: Near-Optimal Matrix Completion
+Normal rank
@@ Property / cites work @@
+Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Q3998992
@@ Property / cites work: Q3998992 / rank @@
+Normal rank