arXiv (All)
open access
Product-Aware Deterministic Rounding for Quantized Matrix Multiplication
Scalar rounding decisions interact through matrix multiplication. We study deterministic product-aware rounding after scales, clipping bounds, and grids are fixed, with each active scalar choosing between adjacent levels. For dynamic activation rounding, null-space reduction preserves the rela
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
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#625429
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#623156
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#459639
- Structured Divide-and-Conquer for the Definite Generalized Eigenvalue Problem#625472
- Structured Divide-and-Conquer for the Definite Generalized Eigenvalue Problem#623199
Record · ID 1115597
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