Metraipolis › archive › dc_f5bf9577af14
Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis — arXiv:2608.08513
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08513
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:06:20.477Z
- SHA-256 of the archived text
be6e4e5cbb61c9363718c8e08f79d8ef033d212e14352586b70996819f99a992- Stable URL of this page
https://metraipolis.com/documento/dc_f5bf9577af14
How to cite
Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis — arXiv:2608.08513 — arXiv (en), https://arxiv.org/abs/2608.08513 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f5bf9577af14 (Metraipolis archive dc_f5bf9577af14, sha256 be6e4e5cbb61c9363718c8e08f79d8ef033d212e14352586b70996819f99a992)
BibTeX
@misc{dcf5bf9577af14,
title = {Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis — arXiv:2608.08513},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08513},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f5bf9577af14; sha256 be6e4e5cbb61c9363718c8e08f79d8ef033d212e14352586b70996819f99a992},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08513. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Approximate message passing (AMP)-type algorithms are widely used for signal recovery in high-dimensional noisy linear systems. Recently, a framework called memory AMP (MAMP) was introduced, offering a new approach to incorporating memory terms within AMP algorithms. Building on this, a low-complexity gradient descent MAMP (GD-MAMP) was proposed for right-unitarily invariant matrices. In this paper, we first address an overflow problem in GD-MAMP caused by intermediate variables exceeding the floating-point range, which typically occurs when the condition number is large. Second, we propose two low-complexity variants of GD-MAMP: one replaces full-length memory with partial memory, while the other reduces the number of matrix-vector products per iteration by $1/3$ (from three to two). Neither degrades the convergence speed notably. Third, we develop a general gradient-based formulation for designing MAMP algorithms. This formulation recovers warm-started conjugate gradient VAMP (WS-CG-VAMP) as a special case. Furthermore, we show that the computation of the orthogonalization parameters in this formulation can suffer from catastrophic cancellation, which explains the finite-precision instability of WS-CG-VAMP. Finally, we derive an equivalent reformulation, termed WS-CG-VAMP(r), which reduces the number of matrix-vector products by up to $50\%$. Measured by matrix-vector products, GD-MAMP converges faster for small condition numbers, whereas WS-CG-VAMP(r) converges faster for large ones under high-precision arithmetic but may diverge in IEEE double precision due to catastrophic cancellation. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.ST). Categorie arXiv: Information Theory (cs.IT) ; Signal Processing (eess.SP); Statistics Theory (math.ST). Pagina del lavoro: https://arxiv.org/abs/2608.08513 — 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-10-19T09:04:01.369Z dalla pagina https://arxiv.org/catchup/math.ST/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).