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

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

GAN-Powered Deep Distributional Reinforcement Learning for Resource Management in Network Slicing

Open access
Hua, Yuxiu, Li, Rongpeng, Zhao, Zhifeng, Chen, Xianfu, Zhang, Honggang · 2020 · IEEE Journal on Selected Areas in Communications

Abstract

Network slicing is a key technology in 5G communications system. Its purpose is to dynamically and efficiently allocate resources for diversified services with distinct requirements over a common underlying physical infrastructure. Therein, demand-aware resource allocation is of significant importance to network slicing. In this paper, we consider a scenario that contains several slices in a radio access network with base stations that share the same physical resources (e.g., bandwidth or slots). We leverage deep reinforcement learning (DRL) to solve this problem by considering the varying service demands as the environment state and the allocated resources as the environment action. In order to reduce the effects of the annoying randomness and noise embedded in the received service level agreement (SLA) satisfaction ratio (SSR) and spectrum efficiency (SE), we primarily propose generative adversarial network-powered deep distributional Q network (GAN-DDQN) to learn the action-value distribution driven by minimizing the discrepancy between the estimated action-value distribution and the target action-value distribution. We put forward a reward-clipping mechanism to stabilize GAN-DDQN training against the effects of widely-spanning utility values. Moreover, we further develop Dueling GAN-DDQN, which uses a specially designed dueling generator, to learn the action-value distribution by estimating the state-value distribution and the action advantage function. Finally, we verify the performance of the proposed GAN-DDQN and Dueling GAN-DDQN algorithms through extensive simulations.

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.

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

Integrity signals

Registry

Crossref · 10.1109/jsac.2019.2959185

Cites

10 of 10 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.

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.

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 10 references

Cited by

See all 240

Metadata

Authors
Hua, Y., Li, R., Zhao, Z., Chen, X., & Zhang, H.
Venue
IEEE Journal on Selected Areas in Communications
Published
2020-02
Volume
38
Issue
2
Pages
334-349
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W3002189898
Cited by
240
References
10
FWCI
13.36
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: GAN-Powered Deep Distributional Reinforcement Learning for Resource Management in Network Slicing. https://app.cochat.ai/papers/10.1109/jsac.2019.2959185
The paper
Hua, Y., Li, R., Zhao, Z., Chen, X., & Zhang, H. (2020). GAN-Powered Deep Distributional Reinforcement Learning for Resource Management in Network Slicing. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2019.2959185

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.