Product-Aware Deterministic Rounding for Quantized Matrix Multiplication XC2HE3KXPM
| URI | m2://res/XC2HE3KXPM |
|---|---|
| Kind | preprint |
| Creators | Piyush Sao, Narasinga Miniskar, Pedro Valero-Lara, Keita Teranishi, Sudip Seal |
| Date | 2026-09-11 |
| Subjects | arxiv cs.LG, arxiv cs.DS, arxiv cs.IT, arxiv math.IT |
| Scope | border |
Expressions
e1: version, preprint
| Date | 2026-09-11 |
|---|---|
| Ids | arXiv 2609.31641 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Conditional-expectation completion | statement | lemma 3.2 | arxiv |
| Precision-aware parameterization | problem | problem 8.1 | arxiv |
| Verifiable spectral tails | problem | problem 8.3 | arxiv |
| Static product-loss objective | statement | theorem 4.1 | arxiv |
| Null-space reduction to at most $r$ fractional coordinates | statement | lemma 3.1 | arxiv |
| Gram--Schmidt walk from an arbitrary fractional start | statement | corollary A.1 | arxiv |
| Unclipped subtractive-dither reference | statement | lemma 2.2 | arxiv |
| Same-grid stochastic-rounding reference | statement | lemma 2.1 | arxiv |
| Rounding in an unrestricted PSD quadratic loss is strongly NP-complete | statement | theorem 5.2 | arxiv |
| Reusable dynamic rounding | problem | problem 8.2 | arxiv |
| JWGFD5JQVX | statement | theorem | arxiv |
| Heavy-row enumeration | statement | corollary 3.5 | arxiv |
| Rank-one zero-error rounding is weakly NP-complete | statement | theorem 5.1 | arxiv |
| Target start | statement | corollary 3.4 | arxiv |
| Dynamic additive approximation | statement | theorem 3.3 | arxiv |
Catalogue records
- arxiv: 2609.31641 (work)