Metraipolis › archive › dc_cbfc43270a09
EvoCG: Self-Evolving Precision Control for Faster Conjugate Gradient — arXiv:2611.04469
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04469
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:34:46.937Z
- SHA-256 of the archived text
854118bb0b1319e37facce0c203fb0508aecb515b596b7bc17616106deca3545- Stable URL of this page
https://metraipolis.com/documento/dc_cbfc43270a09
How to cite
EvoCG: Self-Evolving Precision Control for Faster Conjugate Gradient — arXiv:2611.04469 — arXiv (en), https://arxiv.org/abs/2611.04469 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cbfc43270a09 (Metraipolis archive dc_cbfc43270a09, sha256 854118bb0b1319e37facce0c203fb0508aecb515b596b7bc17616106deca3545)
BibTeX
@misc{dccbfc43270a09,
title = {EvoCG: Self-Evolving Precision Control for Faster Conjugate Gradient — arXiv:2611.04469},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04469},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cbfc43270a09; sha256 854118bb0b1319e37facce0c203fb0508aecb515b596b7bc17616106deca3545},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04469. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Modern GPUs offer far higher throughput in low precision than in FP64, but exploiting this in conjugate gradient (CG) solvers is difficult because tolerance to reduced precision evolves with the Krylov state. We present EvoCG, a mixed-precision CG solver that treats tile-wise precision as an online control action rather than a fixed setting: a reinforcement-learning policy in the iteration loop selects per-tile precision from the evolving solver state, made profitable by co-design with a Tile-CSC unified mixed-precision SpMV kernel and a low-overhead in-loop runtime. Across 47 SPD matrices from eight scientific domains, EvoCG is the fastest solver overall, with geometric-mean speedups of 2.52x, 3.06x, 2.48x, 1.93x, and 6.99x over cuSPARSE, PETSc, Ginkgo, Mille-FP64, and Mille-Mixed. On the same substrate, it improves time-to-solution over EvoCG-FP64 by 1.28x at only 11.4% more iterations and 1.09% overhead, with FP64-recomputed final true-residual norms nearly identical to those of FP64, and extends to Jacobi-preconditioned CG without retraining, yielding a further 1.15x geometric-mean speedup over EvoCG-FP64. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2611.04469 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:27:17.002Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).