Optimal Approximate Matrix Product in Terms of Stable Rank

DOI10.4230/LIPIcs.ICALP.2016.11zbMath1404.65032arXiv1507.02268OpenAlexW2963624229MaRDI QIDQ4598143

Jelani Nelson, Michael B. Cohen, David P. Woodruff

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1507.02268

zbMATH Keywords

stable rankregressionlow rank approximationapproximate matrix multiplicationsubspace embeddings

Mathematics Subject Classification ID

Related Items (14)

Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering ⋮ Sharper Bounds for Regularized Data Fitting ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions ⋮ Optimal sampling algorithms for block matrix multiplication ⋮ An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ Unnamed Item ⋮ Randomized Nyström Preconditioning ⋮ Sketching for Principal Component Regression ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ Robust high-dimensional factor models with applications to statistical machine learning ⋮ Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably ⋮ Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching

This page was built for publication: Optimal Approximate Matrix Product in Terms of Stable Rank