Optimal Wireless Resource Allocation With Random Edge Graph Neural Networks
Open accessThe DOI matches its Crossref record; 40 of the 41 references it cites were found in a registry or an index.
Abstract
We consider the problem of optimally allocating resources across a set of transmitters and receivers in a wireless network. The resulting optimization problem takes the form of constrained statistical learning, in which solutions can be found in a model-free manner by parameterizing the resource allocation policy. Convolutional neural networks architectures are an attractive option for parameterization, as their dimensionality is small and does not scale with network size. We introduce the random edge graph neural network (REGNN), which performs convolutions over random graphs formed by the fading interference patterns in the wireless network. The REGNN-based allocation policies are shown to retain an important permutation equivariance property that makes them amenable to transference to different networks. We further present an unsupervised model-free primal-dual learning algorithm to train the weights of the REGNN. Through numerical simulations, we demonstrate the strong performance REGNNs obtain relative to heuristic benchmarks and their transference capabilities.
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
“Graph neural network (GNN) has recently been shown to be able to harness the benefits of generalizability, interpretability, robustness, scalability, superior performance, real-time and distributed implementation for learning to optimize nonconvex problems, including power control [270], beamforming [23], and phase shift design [25].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [270]
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946 · cited 2×
“In fast fading scenarios the instantaneous value of the reward r(t) in (1) is not directly experienced by end users.”
BackgroundBertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(1999) · Cited by 5,147
Wide & Deep Learning for Recommender Systems
Cheng, H.-T., Koc, L., Harmsen, J., Shaked, T., Chandra, T., Aradhye, H., Anderson, G., Corrado, G., Chai, W., Ispir, M., et al. (2016) · Proceedings of the 1st Workshop on Deep Learning for Recommender Systems · doi:10.1145/2988450.2988454 · Cited by 3,535
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
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 · cited 1×
“Some simplification is attained by working in the Lagrangian dual domain [1], [2] and subsequently using dual descent methods [3]–[5], or, alternatively, with heuristic optimization and scheduling methods [6]–[9].”
MethodDeep Convolutional Networks on Graph-Structured Data
Henaff, M., Bruna, J., & LeCun, Y. (2015) · arXiv · doi:10.48550/arxiv.1506.05163 · Cited by 1,255
Learning to Optimize: Training Deep Neural Networks for Interference Management
Sun, H., Chen, X., Shi, Q., Hong, M., Fu, X., & Sidiropoulos, N. D. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2866382 · Cited by 874
Shi, Q., Razaviyayn, M., Luo, Z.-Q., & He, C. (2011) · 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2011.5946304 · Cited by 873
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
“…been shown to be able to harness the benefits of generalizability, interpretability, robustness, scalability, superior performance, real-time and distributed implementation for learning to optimize nonconvex problems, including power control [270], beamforming [23], and phase shift design [25].”
BackgroundShe, C., Sun, C., Gu, Z., Li, Y., Yang, C., Poor, H. V., & Vucetic, B. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3053601 · Cited by 405
“The details on the model-free unsupervised deep learning method can be found in [63], [232], [233], and [242].”
BackgroundMethodShen, Y., Shi, Y., Zhang, J., & Letaief, K. B. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3036965 · Cited by 367
“cannot be solved by existing methods in [10], [13], [14].”
BackgroundMethodInfluentialGraph-based deep learning for communication networks: A survey
Jiang, W. (2022) · Computer Communications · doi:10.1016/j.comcom.2021.12.015 · Cited by 284
“To handle this problem, multiple GNN-based solutions are proposed [83, 58, 40, 57, 42, 112, 82, 32, 84].”
BackgroundNetwork Digital Twin: Context, Enabling Technologies, and Opportunities
Almasan, P., Ferriol-Galmes, M., Paillisse, J., Suarez-Varela, J., Perino, D., Lopez, D., Perales, A. A. P., Harvey, P., Ciavaglia, L., Wong, L., et al. (2022) · IEEE Communications Magazine · doi:10.1109/mcom.001.2200012 · Cited by 180
“In this context, GNN models have recently shown promising results for generalization across network-related data structured as graphs [2], [6].”
BackgroundMethodInfluential
Metadata
- Authors
- Eisen, M., & Ribeiro, A.
- Affiliations
- Intel (United States) (US)
- University of Pennsylvania (US)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2020
- Volume
- 68
- Pages
- 2977-2991
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2971598376
- Cited by
- 327
- References
- 41
- Citations by year
- 2026: 31 · 2025: 53 · 2024: 59 · 2023: 60 · 2022: 56 · 2021: 44 · 2020: 23
- FWCI
- 15.72
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- ARL DCIST CRA (W911NF-17-2-0181)
- Intel Science and Technology Center for Wireless Autonomous Systems
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Keywords
- wireless resource allocation, graph neural networks, permutation equivariance, model-free reinforcement learning, random graphs, convolutional neural 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: Optimal Wireless Resource Allocation With Random Edge Graph Neural Networks. https://app.cochat.ai/papers/10.1109/tsp.2020.2988255
- The paper
- Eisen, M., & Ribeiro, A. (2020). Optimal Wireless Resource Allocation With Random Edge Graph Neural Networks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2020.2988255
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.