Metraipolis › archive › dc_90aaddfa9a40

Spectral-NFP: Certified Low-Rank Curvature Majorization for Accelerating WMMSE — arXiv:2609.27369

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27369
License (as archived)
CC0-1.0
Archived
2026-10-08T12:11:56.856Z
SHA-256 of the archived text
45338369b1a6756147348ccf6019f2e41914ad2ed0bea612e2495aa3c6952850
Stable URL of this page
https://metraipolis.com/documento/dc_90aaddfa9a40

How to cite

Spectral-NFP: Certified Low-Rank Curvature Majorization for Accelerating WMMSE — arXiv:2609.27369 — arXiv (en), https://arxiv.org/abs/2609.27369 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_90aaddfa9a40 (Metraipolis archive dc_90aaddfa9a40, sha256 45338369b1a6756147348ccf6019f2e41914ad2ed0bea612e2495aa3c6952850)
BibTeX
@misc{dc90aaddfa9a40,
  title = {Spectral-NFP: Certified Low-Rank Curvature Majorization for Accelerating WMMSE — arXiv:2609.27369},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27369},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_90aaddfa9a40; sha256 45338369b1a6756147348ccf6019f2e41914ad2ed0bea612e2495aa3c6952850},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27369. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Weighted sum-rate maximization in multicell multiple-input multiple-output (MIMO) networks is commonly addressed by the weighted minimum mean-square error (WMMSE) algorithm or fractional programming (FP), both of which, after fixing their auxiliary variables, solve a power-constrained quadratic transmit problem that requires costly dense operations for large arrays. Replacing the underlying curvature matrix with a scaled identity can avoid the matrix inverse operation and thereby reduce complexity, but it discards the curvature eigenvalue structure and yields a loose lower bound. We propose Spectral-NFP, which retains selected dominant curvature eigenpairs and uses a scaled identity matrix to bound the curvature on the remaining subspace from above. The retained rank thus traces a continuous path from NFP to the exact WMMSE transmit update. With the surrogate curvature fixed, Spectral-NFP can be interpreted as Euclidean projected-gradient ascent after a linear coordinate transformation, admitting Nesterov-type acceleration. We derive a lower bound on the one-step transmit-objective gain of Spectral-NFP relative to WMMSE, expressed in terms of the curvature eigenvalues. Under an idealized Wishart model, we analyze this bound in both finite dimensions and the large-system limit, obtaining an asymptotic rank-selection rule. Experimental results show that retaining at most 20% of the transmit dimension, and often less than 10%, achieves more than 99% of the WMMSE WSR. In large-array settings, the measured update time is below 20% of that required by WMMSE.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.27369 — 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-08T12:10:03.913Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).