arXiv (All)
open access
A Nuclear-Norm Lower Bound for Dithered Scalar Quantization of Matrix Products
We consider the problem of minimizing error in quantized matrix multiplication $C=AB$. Scalar quantization of the factors introduces rounding errors whose scale depends on the maximum absolute entries -- the ranges -- of their rows and columns. These ranges determine the quantization grid steps. To
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lanczos with compression for symmetric eigenvalue problems#635753
- Lanczos with compression for symmetric eigenvalue problems#633404
- High-Rate Quantized Matrix Multiplication II#180656
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#625429
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#623156
Record · ID 972692
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive