dorsal/arxiv
View SchemaEngineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
| Authors | Joel Andersson, Matti Karppa |
|---|---|
| Categories | |
| ArXiv ID | 2601.09477vv1 |
| URL | https://arxiv.org/abs/2601.09477 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
We present an implementation of Pagh's compressed matrix multiplication algorithm, a randomized algorithm that constructs sketches of matrices to compute an unbiased estimate of their product. By leveraging fast polynomial multiplication via the FFT, the algorithm achieves high performance when the product matrix is sparse or contains only a small number of entries with magnitudes significantly larger than the rest. We show empirically that the algorithm is practical and can outperform state-of-the-art DGEMM implementations when the product matrix has few nonzero entries or is otherwise dominated by a small subset of elements with large magnitude. As a minor theoretical contribution, we replace the FFT with the Fast Walsh-Hadamard Transform (FWHT) in sketched multiplication, preserving all correctness and variance guarantees of the original algorithm. Experiments with our carefully engineered multithreaded CPU implementation for dense double-precision matrices on 64-core CPU nodes across a range of synthetic benchmarks, exhibiting variable sparsity patterns, show that the FWHT variant is up to 4 times faster than the FFT-based version. Under favorable sparsity and magnitude patterns in the product matrix, our FWHT-based implementation achieves a speedup of up to 40 over DGEMM from Intel MKL, with low probability of error in the estimates. Our implementation is released as free software and comes with NumPy-compatible Python bindings.
{
"annotation_id": "11fd7497-a544-4cc3-aea4-81917034e273",
"date_created": "2026-02-17T05:53:20.415000Z",
"date_modified": "2026-02-17T05:53:20.415000Z",
"file_hash": "3857d57da40dce6c802feae4b7b4ec28aa26eab4ecccb8d878cfa1b64a2b0593",
"private": false,
"record": {
"abstract": "We present an implementation of Pagh\u0027s compressed matrix multiplication algorithm, a randomized algorithm that constructs sketches of matrices to compute an unbiased estimate of their product. By leveraging fast polynomial multiplication via the FFT, the algorithm achieves high performance when the product matrix is sparse or contains only a small number of entries with magnitudes significantly larger than the rest. We show empirically that the algorithm is practical and can outperform state-of-the-art DGEMM implementations when the product matrix has few nonzero entries or is otherwise dominated by a small subset of elements with large magnitude. As a minor theoretical contribution, we replace the FFT with the Fast Walsh-Hadamard Transform (FWHT) in sketched multiplication, preserving all correctness and variance guarantees of the original algorithm.\n Experiments with our carefully engineered multithreaded CPU implementation for dense double-precision matrices on 64-core CPU nodes across a range of synthetic benchmarks, exhibiting variable sparsity patterns, show that the FWHT variant is up to 4 times faster than the FFT-based version. Under favorable sparsity and magnitude patterns in the product matrix, our FWHT-based implementation achieves a speedup of up to 40 over DGEMM from Intel MKL, with low probability of error in the estimates. Our implementation is released as free software and comes with NumPy-compatible Python bindings.",
"arxiv_id": "2601.09477",
"authors": [
"Joel Andersson",
"Matti Karppa"
],
"categories": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform",
"url": "https://arxiv.org/abs/2601.09477",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "245d8fe1-d44d-4e28-8692-e7d5c06f4e04",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}