Compressed matrix multiplication

DOI10.1145/2493252.2493254zbMath1322.65055arXiv1108.1320OpenAlexW2201600774MaRDI QIDQ5892191

Rasmus Pagh

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

approximationsparse recoverymatrix multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Approximation algorithms (68W25)

Related Items (17)

Randomized numerical linear algebra: Foundations and algorithms ⋮ Fast Output-Sensitive Matrix Multiplication ⋮ A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition ⋮ Efficiently correcting matrix products ⋮ Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ Detecting the large entries of a sparse covariance matrix in sub-quadratic time ⋮ Unnamed Item ⋮ Sketching for Principal Component Regression ⋮ Structured Random Sketching for PDE Inverse Problems ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ Tight Bounds for the Subspace Sketch Problem with Applications ⋮ Unnamed Item ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

This page was built for publication: Compressed matrix multiplication