Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation
Open accessThe DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Abstract
We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we depart from classical purely model-based approaches and propose a hybrid method that retains key modeling elements in conjunction with data-driven components. More precisely, we put forth a neural network architecture inspired by the algorithmic unfolding of the iterative weighted minimum mean squared error (WMMSE) method, that we denote by unfolded WMMSE (UWMMSE). The learnable weights within UWMMSE are parameterized using graph neural networks (GNNs), where the time-varying underlying graphs are given by the fading interference coefficients in the wireless network. These GNNs are trained through a gradient descent approach based on multiple instances of the power allocation problem. We show that the proposed architecture is permutation equivariant, thus facilitating generalizability across network topologies. Comprehensive numerical experiments illustrate the performance attained by UWMMSE along with its robustness to hyper-parameter selection and generalizability to unseen scenarios such as different network densities and network sizes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“To reduce the model and sample complexity, as well as improve the performance and interpretability, unfolded neural networks were developed in [267]- [269] to parameterize the iterative policy via unfolding one iteration of the existing structured algorithm into one layer of a neural network.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [267]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Semi-supervised classification with graph convolutional networks
Kipf, T. N., & Welling, M. (2016) · arXiv · doi:10.48550/arxiv.1609.02907 · Cited by 24,853
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Spectral Networks and Locally Connected Networks on Graphs
Bruna, J., Zaremba, W., Szlam, A., & LeCun, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6203 · Cited by 3,983
Learning Fast Approximations of Sparse Coding
Gregor, K., & LeCun, Y. (2010) · International Conference on Machine Learning · Cited by 2,401
Shi, Q., Razaviyayn, M., Luo, Z.-Q., & He, C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2147784 · Cited by 2,129 · cited 9×
“Intuitively, since the optimal power allocation is a fixed point of the classical WMMSE iteration [14], one would expect deeper layers of the UWMMSE to more closely resemble its classical counterpart.”
BackgroundMethodInfluentialDeep Learning in Mobile and Wireless Networking: A Survey
Zhang, C., Patras, P., & Haddadi, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2904897 · Cited by 1,768
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
Defferrard, M., Bresson, X., & Vandergheynst, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.09375 · Cited by 1,673
Dual methods for nonconvex spectrum optimization of multicarrier systems
Yu, W., & Lui, R. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2006.877962 · Cited by 1,572
Research works printed but not linked: 1
- 10.1109/vtcfall.2019.8891178 · doi:10.1109/vtcfall.2019.8891178
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“neural networks were developed in [267], [268], [269] to”
MethodGraph-based deep learning for communication networks: A survey
Jiang, W. (2022) · Computer Communications · doi:10.1016/j.comcom.2021.12.015 · Cited by 284
Graph Neural Networks for Wireless Communications: From Theory to Practice
Shen, Y., Zhang, J., Song, S. H., & Letaief, K. B. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3219840 · Cited by 230
A Survey of Recent Advances in Optimization Methods for Wireless Communications
Liu, Y., Chang, T., Hong, M., Wu, Z., So, A. M., Jorswieck, E. A., & Yu, W. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3443759 · Cited by 225
Graph Filters for Signal Processing and Machine Learning on Graphs
Isufi, E., Gama, F., Shuman, D. I., & Segarra, S. (2024) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2024.3349788 · Cited by 217
Self-citation
Metadata
- Authors
- Chowdhury, A., Verma, G., Rao, C., Swami, A., & Segarra, S.
- Affiliations
- Rice University (US)
- DEVCOM Army Research Laboratory (US)
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2021-09
- Volume
- 20
- Issue
- 9
- Pages
- 6004-6017
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W3088683473
- Cited by
- 162
- References
- 59
- Citations by year
- 2026: 17 · 2025: 24 · 2024: 31 · 2023: 34 · 2022: 34 · 2021: 20
- FWCI
- 8.75
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Wireless Communications (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Funders
- Army Research Office and was accomplished (W911NF-19-2-0269)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
- Keywords
- power allocation, graph neural networks, ad hoc networks, permutation equivariance, single-hop networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation. https://app.cochat.ai/papers/10.1109/twc.2021.3071480
- The paper
- Chowdhury, A., Verma, G., Rao, C., Swami, A., & Segarra, S. (2021). Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2021.3071480
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.