The following pages link to Compressed matrix multiplication (Q5892191):
Displaying 17 items.
- Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching (Q2108486) (← links)
- A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition (Q2161453) (← links)
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Fast Output-Sensitive Matrix Multiplication (Q3452839) (← links)
- Faster Kernel Ridge Regression Using Sketching and Preconditioning (Q4588937) (← links)
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time (Q4603728) (← links)
- (Q4633051) (← links)
- (Q5009621) (← links)
- Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Structured Random Sketching for PDE Inverse Problems (Q5146630) (← links)
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
- Sketching for Principal Component Regression (Q5380270) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
