MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Latent semantic indexing: a probabilistic analysis
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Clustering Large Graphs via the Singular Value Decomposition
Machine Learning
Fast monte-carlo algorithms for finding low-rank approximations
Journal of the ACM (JACM)
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
SIAM Journal on Computing
SIAM Journal on Computing
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An improved approximation algorithm for the column subset selection problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Column subset selection, matrix factorization, and eigenvalue optimization
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A fast and efficient algorithm for low-rank approximation of a matrix
Proceedings of the forty-first annual ACM symposium on Theory of computing
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
Proceedings of the forty-first annual ACM symposium on Theory of computing
Multi-view clustering via canonical correlation analysis
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Who moderates the moderators?: crowdsourcing abuse detection in user-generated content
Proceedings of the 12th ACM conference on Electronic commerce
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Low rank matrix-valued chernoff bounds and approximate matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Column subset selection via sparse approximation of SVD
Theoretical Computer Science
Randomized Algorithms for Matrices and Data
Foundations and Trends® in Machine Learning
Graph Sparsification by Effective Resistances
SIAM Journal on Computing
Sampling methods for the Nyström method
The Journal of Machine Learning Research
A fast solver for a class of linear systems
Communications of the ACM
A matrix hyperbolic cosine algorithm and applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Simple and deterministic matrix sketching
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Low rank approximation and regression in input sparsity time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Column Subset Selection Problem is UG-hard
Journal of Computer and System Sciences
| Hi-index | 0.02 |
We study random submatrices of a large matrix A. We show how to approximately compute A from its random submatrix of the smallest possible size O(rlog r) with a small error in the spectral norm, where r = ‖A‖2F/‖A‖22 is the numerical rank of A. The numerical rank is always bounded by, and is a stable relaxation of, the rank of A. This yields an asymptotically optimal guarantee in an algorithm for computing low-rank approximations of A. We also prove asymptotically optimal estimates on the spectral norm and the cut-norm of random submatrices of A. The result for the cut-norm yields a slight improvement on the best-known sample complexity for an approximation algorithm for MAX-2CSP problems. We use methods of Probability in Banach spaces, in particular the law of large numbers for operator-valued random variables.