arXiv (All)
open access
Fast Matrix Multiplication in fp8: Certified Coefficient Optimization and Measured Error
A Strassen-type algorithm has many realizations with the same exact product and multiplication count yet different fp8 error because basis changes reshape coefficient geometry, posing the question of which to run. No current account settles this: classical stability controls worst-case $\ell_1$ grow
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
- Stabilitätsuntersuchungen eisenbasierter Katalysatoren der Fischer-Tropsch-Synthese zu kurzkettigen Olefinen / Nick Alexander Lorenz ; Gutachter: Bastian J. M. Etzold, Tanja Franken#1145443
- LoopCoder-v2: Only Loop Once for Efficient Test-Time Computation Scaling#282798
- Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers#271792
- Scalable Approximate Selected Inversion Based on Single-Level Incomplete $LDL^T$ Factorization and Spectral Corrections for Large Sparse Systems#998898
- Bounding the Error of Value Functions in Sobolev Norm Yields Bounds on Suboptimality of Controller Performance#617799
Record · ID 1061980
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