Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 254

The DOI matches its Crossref record; 156 of the 156 references it cites were found in a registry or an index.

Enhancing Deep Reinforcement Learning: A Tutorial on Generative Diffusion Models in Network Optimization

Open access
Du, Hongyang, Zhang, Ruichen, Liu, Yinqiu, Wang, Jiacheng, Lin, Yijing, Li, Zonghang, Niyato, Dusit, Kang, Jiawen, Xiong, Zehui, Cui, Shuguang, Ai, Bo, Zhou, Haibo, Kim, Dong In·2024·IEEE Communications Surveys & Tutorials

Abstract

Generative Diffusion Models (GDMs) have emerged as a transformative force in the realm of Generative Artificial Intelligence (GenAI), demonstrating their versatility and efficacy across various applications. The ability to model complex data distributions and generate high-quality samples has made GDMs particularly effective in tasks such as image generation and reinforcement learning. Furthermore, their iterative nature, which involves a series of noise addition and denoising steps, is a powerful and unique approach to learning and generating data. This paper serves as a comprehensive tutorial on applying GDMs in network optimization tasks. We delve into the strengths of GDMs, emphasizing their wide applicability across various domains, such as vision, text, and audio generation. We detail how GDMs can be effectively harnessed to solve complex optimization problems inherent in networks. The paper first provides a basic background of GDMs and their applications in network optimization. This is followed by a series of case studies, showcasing the integration of GDMs with Deep Reinforcement Learning (DRL), incentive mechanism design, Semantic Communications (SemCom), Internet of Vehicles (IoV) networks, etc. These case studies underscore the practicality and efficacy of GDMs in real-world scenarios, offering insights into network design. We conclude with a discussion on potential future directions for GDM research and applications, providing major insights into how they can continue to shape the future of network optimization.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/comst.2024.3400011

Cites

156 of 156 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 156 references

Cited by

See all 254

Metadata

Authors
Du, H., Zhang, R., Liu, Y., Wang, J., Lin, Y., Li, Z., Niyato, D., Kang, J., Xiong, Z., Cui, S., Ai, B., Zhou, H., & Kim, D. I.
Venue
IEEE Communications Surveys & Tutorials
Published
2024
Volume
26
Issue
4
Pages
2611-2646
ISSN
  • 1553-877X (ISSN-L)
  • 2373-745X
OpenAlex
W4396817538
Cited by
254
References
156
FWCI
35.31
Type
journal article
Language
en
Open access
green

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: Enhancing Deep Reinforcement Learning: A Tutorial on Generative Diffusion Models in Network Optimization. https://app.cochat.ai/papers/10.1109/comst.2024.3400011
The paper
Du, H., Zhang, R., Liu, Y., Wang, J., Lin, Y., Li, Z., Niyato, D., Kang, J., Xiong, Z., Cui, S., Ai, B., Zhou, H., & Kim, D. I. (2024). Enhancing Deep Reinforcement Learning: A Tutorial on Generative Diffusion Models in Network Optimization. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2024.3400011

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.