No article text was recorded for this version.
fast matrix multiplication overhead
Version 1 of 130 papers30 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Faster Algorithms for Schatten-p Low Rank Approximation
- Blog: Run-Time Efficient RNN Compression for Inference on Edge Devices
- Blog: John Ellipsoids via Lazy Updates
- Blog: TR-2012001: Algebraic Algorithms
- Blog: Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More
- Blog: Solving Empirical Risk Minimization in the Current Matrix Multiplication Time
- Blog: Triangular Factorization and Inversion by Fast Matrix Multiplication
- Blog: Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
- Blog: Random Projections for $k$-means Clustering
- Blog: List-Decodable Mean Estimation in Nearly-PCA Time
- Blog: Efficient algorithms for computing a minimal homology basis
- Blog: Solving Dense Linear Systems Faster than via Preconditioning
- Blog: Discrepancy Minimization in Input-Sparsity Time
- Blog: Improving the Leading Constant of Matrix Multiplication
- Blog: Training (Overparametrized) Neural Networks in Near-Linear Time
- Blog: Solving Tall Dense Linear Programs in Nearly Linear Time
- Blog: Products of ordinary differential operators by evaluation and interpolation
- Blog: Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
- Blog: TAL Recognition in O(M(n2)) Time
- Blog: Clones: CLOsed queueing Networks Exact Sampling
- Blog: Faster Dynamic Range Mode
- Blog: Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs
- Blog: Probabilistic Polynomials and Hamming Nearest Neighbors
- Blog: Algorithms and hardness results for parallel large margin learning
- Blog: Discrepancy Minimization in Input-Sparsity Time
- Blog: Principal Component Projection and Regression in Nearly Linear Time through Asymmetric SVRG.
- Blog: Adaptive Cholesky Gaussian Processes
- Blog: A simple criterion for structurally fixed modes
- Blog: FFT-based Dynamic Subspace Selection for Low-Rank Adaptive Optimization of Large Language Models
- Blog: Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
History & citation
Current · Permanent link
- This direction split from The Practicality Gap of Subcubic Matrix Algorithms (90% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_fast_matrix_multiplication_overhead_20add94b,
title = {fast matrix multiplication overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fast-matrix-multiplication-overhead/rdr_20add94bb4a244f99ecd32b9e0461b18},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_fast_matrix_multiplication_overhead_20add94b_v1,
title = {fast matrix multiplication overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fast-matrix-multiplication-overhead/rdr_20add94bb4a244f99ecd32b9e0461b18/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}