The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index; none of the 25 sources its claims cite is checked for support yet.
In-Edge AI: Intelligentizing Mobile Edge Computing, Caching and Communication by Federated Learning
Open accessAbstract
Recently, along with the rapid development of mobile communication technology, edge computing theory and techniques have been attracting more and more attention from global researchers and engineers, which can significantly bridge the capacity of cloud and requirement of devices by the network edges, and thus can accelerate content delivery and improve the quality of mobile services. In order to bring more intelligence to edge systems, compared to traditional optimization methodology, and driven by the current deep learning techniques, we propose to integrate the Deep Reinforcement Learning techniques and Federated Learning framework with mobile edge systems, for optimizing mobile edge computing, caching and communication. And thus, we design the “In-Edge AI” framework in order to intelligently utilize the collaboration among devices and edge nodes to exchange the learning parameters for a better training and inference of the models, and thus to carry out dynamic system-level optimization and application-level enhancement while reducing the unnecessary system communication load. “In-Edge AI” is evaluated and proved to have near-optimal performance but relatively low overhead of learning, while the system is cognitive and adaptive to mobile communication systems. Finally, we discuss several related challenges and opportunities for unveiling a promising upcoming future of “In-Edge AI.”
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proposes “In-Edge AI,” integrating Deep Reinforcement Learning and Federated Learning into mobile edge systems to optimize edge caching and computation offloading. It reports proof-of-concept simulations where DDQN with FL approaches centralized DDQN performance while reducing wireless transmission cost.
Key findings
- In edge caching, DDQN with FL achieved hit rates close to centralized DDQN for three edge nodes (E1, E2, E3) and outperformed LRU, LFU, and FIFO.
- In computation offloading, DDQN with FL achieved near centralized DDQN performance and was superior to mobile execution, edge node execution, and greedy execution for three UEs (m1, m2, m3).
- Centralized DDQN performed better at the beginning of training, but after several FL model merges, DDQN with FL became near to centralized DDQN.
- FL clients upload only model updates, reducing total wireless transmission compared with centralized DRL, where UEs must upload the whole training data.
Methods
- Two simulations were run: edge caching and computation offloading. Edge caching used Xender’s one-month trace (01/09/2016 to 30/09/2016) with 9,514 active mobile users, 188,447 content files, and 2,107,100 content requests, fitted by a Zipf distribution with ∂ = 1.58; 6 edge nodes cooperated, coordinated by a cloud server.
- Computation offloading assumed 5 MHz bandwidth divided into 10 wireless channels, 10 UEs as FL clients, channel gain quantized into 6 levels, and tasks generated by Bernoulli distribution with average arrival rate λ_T per time epoch.
- DRL used Double DQN with tanh activation and Adam optimizer; a single-layer fully-connected feedforward neural network with 200 neurons served as MainNet and TargetNet. Parameters: replay memory M = 5000, minibatch B = 200, discount γ = 0.9, exploration ε = 0.001, learning rate ζ = 0.005, target replacement period φ = 250. A centralized DRL baseline was assumed to receive all data.
Limitations
- The paper states FL cannot outperform centralized DL, only achieve near-best performance, and that FL trades advantages for heavier client computation load and more energy cost or burden on UEs and edge nodes; these remain open questions.
- The paper states privacy and security are not its focus, and that In-Edge AI is future-oriented: state-of-the-art edge chips support only elementary DL training, deploying a randomly initialized DRL model could paralyze the MEC system, and delay requirements remain challenging; transfer learning is proposed to alleviate training.
- The paper states the training-process comparison assumes an ideal wireless environment where massive centralized training data and lightweight FL updates can be uploaded within a discretized time epoch, whereas in practice massive training data cannot be uploaded without delay. It also assumes slowly changing content popularity, equal content sizes, and static popularity, user preference, and average request arrival rates over a relatively long period. Evident from the text: evaluation is simulation-based proof-of-concept, not a real-world deployment.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
32 Own interpretation · 18 Not checked yet · 9 Own result · 2 Sources not found · 2 No basis given
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“On the perspective of edge caching, E 1 , E 2 and E 3 are chosen to cache contents, and hit rates of them are improving and finally maintain within a certain range along with the process of training DRL agents.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Without FL framework, viz., using centralized DRL, UEs must upload the whole training data via wireless channels and thus consume more communication resources, which is demonstrated by Fig. 6(d).”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: In the framework of FL, every client only needs to upload the update of its model.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We perform experiments on investigating the scenarios of edge caching and computation offloading in mobile edge system, and the 'In-Edge AI' is evaluated and proved to have the abilities to achieve near-optimal performance.”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“We capture Xender's trace for one month (from 01/09/2016 to 30/09/2016), including 9,514 active mobile users, conveying 188,447 content files, and 2,107,100 content requests [13], of which the content popularity distribution can be well fitted by a Zipf distribution with ∂ = 1 . 58 .”
What the sources say
- Not matchedcites [13] [13] X. Li, X. Wang, P.-J. Wan, Z. Han, V. C.M. Leung, 'Hierarchical Edge Caching in Device-to-Device Aided Mobile Networks: Modeling, Optimization, and Design', IEEE Journal on Selected Areas in Communications , Special Issue on Caching for Communication Systems and Networks, Early Access, 2018. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, once the model merging of FL has been processed several times, the performance of DDQN with FL becomes near to that of centralized DDQN.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As illustrated in Fig. 6(c), the performance of centralized DDQN is better than that of DDQN with FL at the beginning of training.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In a word, the problem existed in the resource allocation optimization of the MEC system is ' lack of intelligence '.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: unclear — It is unclear whether it could be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“2) reacting cognitively to the mobile communication environment and conditions of cellular networks”
What the sources say
- Not checked yetcites [11] [11] H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-Efficient Learning of Deep Networks from Decentralized Data,' in Proceedings of the International Conference on Artificial Intelligence and Statistics , Apr. 2017. - source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“3) adapting well with heterogeneous UEs in a practical cellular network”
What the sources say
- Not checked yetcites [11] [11] H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-Efficient Learning of Deep Networks from Decentralized Data,' in Proceedings of the International Conference on Artificial Intelligence and Statistics , Apr. 2017. - source
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“2) Dynamic Conditions: dynamics of the integrated communication and computation system are not well addressed;”
What the sources say
- Not checked yetcites [3] [3] M. Chen and Y. Hao, 'Task Offloading for Mobile Edge Computing in Software Defined Ultra-Dense Network,' in IEEE J. Sel. Areas Commun. , vol. 36, no. 3, pp. 587-597, Mar. 2018 -
- Not checked yetcites [4] [4] Y. Mao, C. You, J. Zhang, K. Huang, K. B. Letaief, 'A Survey on Mobile Edge Computing: The Communication Perspective', in IEEE Commun. Surv. Tutorials , vol. 19, no.4, pp. 2322-2358, Aug. 2017. - source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 25
- Probably not a substantial claim. 21
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“'In-Edge AI' is evaluated and proved to have near-optimal performance but relatively low overhead of learning, while the system is cognitive and adaptive to the mobile communication systems.”
- Also stated in: § I. INTRODUCTION · p. 2 · plain
“we provide proof-of-concept evaluation and verify that the proposed scheme has advantages on the balance of performance and cost.”
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § I. INTRODUCTION · p. 2 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It can be easily seen that the specific performance of FL is near close to the results of centralized DDQN in terms of achieved hit rates of 3 clients (edge nodes), and outperform LRU, LFU, and FIFO.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the simulation of computation offloading, the average utilities of three UEs m 1 , m 2 and m 3 are increasing with the decreasing of training loss, and also maintain within a certain range at last.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In Fig. 6(b), it can be observed that the DDQN with FL achieves the near performance of centralized DDQN and is superior to another three baseline policies;”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Certainly, due to the limitation of federated optimization, FL could not outperform the centralized DL trained model, but could still achieve the near best performance, which will demonstrated in Section IV.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“edge nodes, i.e., base stations equipped with computation/storage capability, could deal with the computation and content requests of UEs, and consequently this scheme improves the Quality-of-Service (QoS) of Mobile Network Operators (MNOs) and the Quality-ofExperience (QoE) of UEs and relieves the load of backbone networks, and pressure of clouds (data centers) [2].”
What the sources say
- Not checked yetcites [2] [2] X. Wang, M. Chen, T. Taleb, A. Ksentini, V. C. M. Leung, 'Cache in the Air: Exploiting Content Caching and Delivery Techniques for 5G Systems,' in IEEE Communications , vol. 52, no. 2, pp. 131-139, Feb. 2014. -
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Federated Learning [11] is introduced as a framework for training DRL agents in a distributed manner while 1) largely reducing the amount of data which should be uploaded via the wireless uplink channel”
What the sources say
- Not checked yetcites [11] [11] H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-Efficient Learning of Deep Networks from Decentralized Data,' in Proceedings of the International Conference on Artificial Intelligence and Statistics , Apr. 2017. - source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“MEC circumvents the long propagation delays introduced by transmitting data from mobile devices to remote cloud computing infrastructures, and hence is able to support latency-critical mobile and Internet of Things (IoT) applications.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“3) Temporal Isolation: most of them do not consider the longterm effect of current decision on resource allocation except for Lyapunov optimization, viz., in a highly time-varying MEC system, most of proposed optimization algorithms is optimal or close-to-optimal only for a snapshot of the system.”
What the sources say
- Not checked yetcites [3] [3] M. Chen and Y. Hao, 'Task Offloading for Mobile Edge Computing in Software Defined Ultra-Dense Network,' in IEEE J. Sel. Areas Commun. , vol. 36, no. 3, pp. 587-597, Mar. 2018 -
- Not checked yetcites [4] [4] Y. Mao, C. You, J. Zhang, K. Huang, K. B. Letaief, 'A Survey on Mobile Edge Computing: The Communication Perspective', in IEEE Commun. Surv. Tutorials , vol. 19, no.4, pp. 2322-2358, Aug. 2017. - source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“But [7] is based on Q-Learning, which is not feasible for the practical MEC system where the stateaction space is tremendous”
What the sources say
- Not checked yetcites [7] [7] A. Sadeghi, F. Sheikholeslami, and G. B. Giannakis, 'Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities,' in IEEE J. Sel. Top. Signal Process. , vol. 12, no. 1, pp. 180-190, Feb. 2018. - source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“the emerging idea of Mobile Edge Computing (MEC) is proposed [1] as a novel paradigm for easing the burden of backbone networks by pushing the computation/storage resources to the proximity of the User Equipments (UEs).”
What the sources say
- Not matchedcites [1] [1] ETSI, 'Mobile Edge Computing - Introductory Technical White Paper', Sep. 2014. -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“none of these works has thought over 1) in what form the training data shall be gathered (whether in a distributed or a centralized way), 2) where the reinforcement learning agent should be placed and trained (whether in UEs, edge nodes or remote cloud infrastructures), 3) how the update process of reinforcement learning agents should be proceeded and collaborated, and 4) the privacy protection of”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“a recent new trend is to optimize wireless communication by Artificial Intelligence (AI) techniques [4] [5], include but not limited to the application of AI for Physical Layer (PHY), Data Link Layer, and traffic control [6].”
What the sources say
- Not checked yetcites [4] [4] Y. Mao, C. You, J. Zhang, K. Huang, K. B. Letaief, 'A Survey on Mobile Edge Computing: The Communication Perspective', in IEEE Commun. Surv. Tutorials , vol. 19, no.4, pp. 2322-2358, Aug. 2017. - source
- Not checked yetcites [5] [5] Q. Mao, F. Hu, and Q. Hao, 'Deep Learning for Intelligent Wireless Networks: A Comprehensive Survey,' in IEEE Commun. Surv. Tutorials , Early Access, 2018. - source
- Not checked yetcites [6] [6] F. Tang, B. Mao, Z. M. Fadlullah, N. Kato, O. Akashi, T. Inoue, and K. Mizutani, 'On Removing Routing Protocol from Future Wireless Networks: A Real-Time Deep Learning Approach for Intelligent Traffic Control,' in IEEE Wireless Communications , vol. 25, no. 1, pp. 154-160, Feb. 2018. - source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“the focus of [8] is on vehicular networks.”
What the sources say
- Not checked yetcites [8] [8] Y. He, N. Zhao, and H. Yin, 'Integrated Networking, Caching, and Computing for Connected Vehicles: A Deep Reinforcement Learning Approach,' IEEE Trans. Veh. Technol. , vol. 67, no. 1, pp. 44-55, Jan. 2018. -
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“1) the computation capability of a UE is relatively weak, and it will consume long time or is even impossible to train the DRL agent on large-scale data;”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: The computation capability of a UE is relatively weak.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This will cause more energy cost on UEs or burden the computation of both UEs and edge nodes, and these issues are still open questions.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Interestingly, this is the reverse direction of the aforementioned Federated Learning, but also a kind of application of the 'In-Edge AI'.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“3) if training data is transformed for privacy consideration, server-side proxy data is less relevant than on-device data.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
- Rests on an assumption: If training data is transformed for privacy, server-side proxy data is less relevant than on-device data.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Obviously, the DRL model should not be deployed directly while setting weights of neural networks at random. Otherwise, the MEC system will be paralyzed because the DRL model could only make random decisions at preliminary exploration.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“By incorporating this work, the requirement on computation capacity of UEs could be relaxed along with decreasing the inferring delay.”
What the sources say
- Not checked yetcites [14] [14] E. Li, Z. Zhou, X. Chen, 'Edge Intelligence: On-Demand Deep Learning Model Co-Inference with Device-Edge Synergy,' in ACM SIGCOMM, MECOMM Workshop , 2018. -
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Nevertheless, using additional computation could decrease the consumption of communication rounds needed to train a model. In addition, FL only asks a part of clients, in one round, to upload their updates, which handles the circumstance where clients are often unpredictably off-line.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: UEs are often unpredictably off-line or allocated with poor communication resources.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“each edge node can support AI tasks on system level dynamically, not only for its own but for the global optimization and balancing of the whole MEC system.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
In the paper
“However, most distributed DRL architectures, described by Fig. 4(b), could not handle unbalanced and non-IID data and cope with the privacy issues [11].”
What the sources say
- Not checked yetcites [11] [11] H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-Efficient Learning of Deep Networks from Decentralized Data,' in Proceedings of the International Conference on Artificial Intelligence and Statistics , Apr. 2017. - source
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“With the aid of FL framework, edge nodes equipped with AI computation in 'edge' could combine the cloud and massive UEs together and form a powerful AI entity with strong cognitive ability provided by massive UEs and edge nodes.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper may give no reason why it holds.
In the paper
“The information needs to be uploaded for FL is the minimal update necessary to improve the DRL agent. Further, techniques of secure aggregation and differential privacy could be applied naturally, which could avoid that privacy-sensitive data are contained in local updates.”
What the sources say
- Not checked yetcites [11] [11] H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, 'Communication-Efficient Learning of Deep Networks from Decentralized Data,' in Proceedings of the International Conference on Artificial Intelligence and Statistics , Apr. 2017. - source
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“2) the training data which should be uploaded to edge nodes or cloud is privacy-sensitive, and it might cause potential privacy accidents;”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
- Rests on an assumption: Training data that should be uploaded to edge nodes or cloud is privacy-sensitive.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Based on the pre-established DRL, the requirement of training (not inferring) is alleviated, i.e., the DRL agent could reach the satisfied accuracy level after a small number of mini-batches or even directly inferring.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
- Rests on an assumption: Learning takes long time of training as well as inferring according to the required accuracy level.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“And when the wireless environment or the pattern of UEs' requests is changed, the UE could also take advantage of the established DRL to adjust neural networks in its DRL model.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Specifically, powerful (both in computation and energy) UEs could decide to perform more mini-batches in training for further decreasing the communication cost and vice versa.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
- Rests on an assumption: In FL, additional computation could be used to decrease the number of communication rounds to train a model.
- Rests on an assumption: An effective way to add computation is increasing computation per UE, i.e., adding more local SGD updates per round.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Consequently, the performance of In-Edge AI shall not be easily affected by the unbalanced data and sometimes the poor communication environment.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
- Rests on an assumption: FL inherently could address key issues about the availability of UEs and edge nodes and the unbalanced and non-IID data.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, if using transfer learning, there shall be less time or computation consumption on the side of training.”
plainconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
- Rests on an assumption: Learning takes long time of training as well as inferring according to the required accuracy level.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Nonetheless, this may be solved if the DL model is not trained from scratch.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In-Edge AI is a tight confederation among mobile operators, SPs/CPs, and mobile users, while capable entities may contribute more to the overall optimization of the edge caching and computing tasks, but a large number of UEs may rely on the AI of edge nodes and other UEs.”
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“DRL can be treated as a type of specialized edge computing task at the service-level.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Then, the established DRL model could be distributed to mobile UEs.”
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Further, its ability of handling non-IDD data allows massive UEs in different wireless environments to train their own DL model without concerning about the negative effect.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
- Rests on an assumption: FL inherently could address key issues about the availability of UEs and edge nodes and the unbalanced and non-IID data.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Specifically, due to the fact that the coordinating server in FL only executes tasks of merging updates instead of taking over the whole training, the computation load of clients is inevitably heavier on account of the local training process.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“though keeping and training a DRL agent in every UE and edge node can achieve the best performance, it is only practical to apply distributed DRL in the MEC system, because there shall not have enough time and data for training.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
- Rests on an assumption: There is not enough time and data for training a DRL agent in every UE and edge node.
The paper relies on this without support.
A typical 5G node is expected to have 2000 or more configurable parameters.
“a typical 5G node is expected to have 2000 or more configurable parameters”
The authors state this as an assumption.
Content popularity changes slowly and all contents have the same size.
“we assume that the content popularity changes slowly and all contents have the same size.”
The authors state this as an assumption.
All content popularity, user preference and average arrival rate of requests are static during a relatively long period.
“We assume that all content popularity, user preference and average arrival rate of requests are static during a relatively long period.”
The authors state this as an assumption.
Edge node computing performance is much stronger than the UE's, so f_E is much greater than f_L.
“the formula f E ≫ f L holds (the computing performance of edge nodes is much stronger than the UE's).”
The paper relies on this without support.
Training data is large in quantity when considering massive UEs.
“the training data is large in quantity when considering massive UEs”
The paper relies on this without support.
Training data that should be uploaded to edge nodes or cloud is privacy-sensitive.
“the training data which should be uploaded to edge nodes or cloud is privacy-sensitive”
The paper relies on this without support.
If training data is transformed for privacy, server-side proxy data is less relevant than on-device data.
“if training data is transformed for privacy consideration, server-side proxy data is less relevant than on-device data.”
The paper relies on this without support.
The computation capability of a UE is relatively weak.
“the computation capability of a UE is relatively weak”
The paper relies on this without support.
The training process of a DRL agent may introduce extra energy consumption of a UE.
“the training process of a DRL agent may introduce extra energy consumption of a UE.”
The paper relies on this without support.
DRL techniques require intensive computation capacity for finding optimal solutions.
“DRL techniques require intensive computation capacity for finding the optimal solutions.”
The paper relies on this without support.
There is not enough time and data for training a DRL agent in every UE and edge node.
“there shall not have enough time and data for training.”
The paper relies on this without support.
UEs are often unpredictably off-line or allocated with poor communication resources.
“UEs are often unpredictably off-line or allocated with poor communication resources.”
The paper relies on this without support.
Some UEs may have more computation tasks and some may experience more states of mobile networks, resulting in varying amounts of training data among UEs.
“Some UEs may have more computation tasks to be handled and some may experience more states of mobile networks, resulting in varying amounts of training data among UEs.”
The paper relies on this without support.
FL distributes the quality of knowledge across a large number of devices without necessarily centralizing the training data.
“The core benefit of FL lies in distributing the quality of knowledge across a large number of devices without necessarily centralizing the training data.”
The paper relies on this without support.
Server-side proxy data is less relevant than on-device data.
“Server-side proxy data is less relevant than on-device data.”
The paper relies on this without support.
In the MEC system, massive UEs and edge nodes could act as perceptrons and acquire various, abundant and personalized data for updating the global DL model.
“In the MEC system, massive UEs and edge nodes could act as perceptrons and acquire various, abundant and personalized data for updating the global DL model.”
The paper relies on this without support.
FL inherently could address key issues about the availability of UEs and edge nodes and the unbalanced and non-IID data.
“FL inherently could address key issues about the availability of UEs and edge nodes and the unbalanced and non-IID data.”
The paper relies on this without support.
In FL, additional computation could be used to decrease the number of communication rounds to train a model.
“In FL, additional computation could be used to decrease the number of communication rounds to train a model.”
The paper relies on this without support.
An effective way to add computation is increasing computation per UE, i.e., adding more local SGD updates per round.
“An effective way to add computation is increasing computation per UE, i.e., adding more local SGD updates per round.”
The paper relies on this without support.
Learning takes long time of training as well as inferring according to the required accuracy level.
“Learning takes long time of training as well as inferring according to the required accuracy level.”
The paper relies on this without support.
In practice, massive training data are actually unable to be uploaded without any delay.
“In practice, massive training data are actually unable to be uploaded without any delay.”
The paper relies on this without support.
In the framework of FL, every client only needs to upload the update of its model.
“In the framework of FL, every client only needs to upload the update of its model.”
The paper relies on this without support.
In 5G, URLLC scenarios strongly desire very small delays and high reliability of the mobile system.
“In 5G, the defined Ultra-Reliable Low-Latency Communications (URLLC) scenarios strongly desire very small delays and high reliability of the mobile system.”
The paper relies on this without support.
General deep learning-based optimization and prediction schemes take quite long running time of recursions for converging to the results, which is inappropriate for mobile edge systems.
“However, general deep learning-based optimization and prediction schemes take quite long running time of recursions for converging to the results, which is inappropriate for mobile edge systems; particularly the system-level edge computing tasks desiring rapid responses in the scale of millisecond.”
The authors state this as an assumption.
The experiment assumes an ideal wireless environment.
“Nonetheless, this experiment assumes an ideal wireless environment.”
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
“Again, due to FL’s properties, imbalanced and non-IID information can be handled appropriately, ensuring that the AI system’s performance is not limited and that a large device in multiple contexts may be trained with their local data and local model without difficulty [211].”
From Federated learning-based AI approaches in smart healthcare: Concepts, taxonomies, challenges and open issues (2023) · cites this paper as [211]
In the citing paper
“In [9] an adaptive control scheme was proposed to adapt the global FL aggregation frequency.”
From Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanism (2020) · cites this paper as [9]
In the citing paper
“This adaptive control scheme offers a desirable tradeoff between global model aggregation and local model update to minimize the loss function with resource budget constraint.”
From Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanism (2020) · cites this paper as [9]
Citations
Cites
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357 · cited 4×
“By taking advantage of Deep Q-Learning and its improved version, e.g., Double DQN [12], the control policy Φ = (Φc(Υ),Φe(Υ)) could be trained and achieves increasing the utility of UEs for the long-term performance optimization.”
BackgroundInfluentialReinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 25,268
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215 · cited 14×
“Nonetheless, the privacy and security is not our focus in this work, more information about these issues could be found in references of [11] A. Integration of Federated Learning within Edge for In-Edge AI Between AI in cloud and AI in UEs, there is an “edge”.”
BackgroundMethodInfluentialReinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,825
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607 · cited 2×
“Several pioneer works have been proposed and realize quite good results in their assuming settings based on convex optimization, game theory and so on [3] [4] .”
BackgroundMethodDeep Reinforcement Learning with Double Q-Learning
Van Hasselt, H., Guez, A., & Silver, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10295 · Cited by 3,318 · cited 13×
“However, once the model merging of FL has been processed several times, the performance of DDQN with FL becomes near to that of centralized DDQN.”
MethodInfluentialTask Offloading for Mobile Edge Computing in Software Defined Ultra-Dense Network
Chen, M., & Hao, Y. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2815360 · Cited by 1,085 · cited 1×
“Several pioneer works have been proposed and realize quite good results in their assuming settings based on convex optimization, game theory and so on [3] [4] .”
BackgroundSelf-citationCache in the air: exploiting content caching and delivery techniques for 5G systems
Wang, X., Chen, M., Taleb, T., Ksentini, A., & Leung, V. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736753 · Cited by 1,063 · cited 1×
“, base stations equipped with computation/storage capability, could deal with the computation and content requests of UEs, and consequently this scheme improves the Quality-of-Service (QoS) of Mobile Network Operators (MNOs) and the Quality-ofExperience (QoE) of UEs and relieves the load of backbone networks, and pres…”
BackgroundSelf-citationDeep Learning for Intelligent Wireless Networks: A Comprehensive Survey
Mao, Q., Hu, F., & Hao, Q. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2846401 · Cited by 789 · cited 1×
“, a typical 5G node is expected to have 2000 or more configurable parameters, a recent new trend is to optimize wireless communication by Artificial Intelligence (AI) techniques [4] [5], include but not limited to the application of AI for Physical Layer (PHY), Data Link Layer, and traffic control [6].”
MethodWhen Mobile Blockchain Meets Edge Computing
Xiong, Z., Zhang, Y., Niyato, D. T., Wang, P., & Han, Z. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1701095 · Cited by 570
He, Y., Zhao, N., & Yin, H. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2760281 · Cited by 569 · cited 2×
“Particularly, related studies on edge computing and caching, such as [7] [8], have shown that reinforcement”
BackgroundMethodEdge Intelligence: On-Demand Deep Learning Model Co-Inference with Device-Edge Synergy
Li, E., Zhou, Z., & Chen, X. (2018) · Proceedings of the 2018 Workshop on Mobile Edge Communications · doi:10.1145/3229556.3229562 · Cited by 385 · cited 2×
“Besides, our work [14] aims to meet the challenge of running DL on resource-constrained mobile devices.”
BackgroundMethodSelf-citationOptimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities
Sadeghi, A., Sheikholeslami, F., & Giannakis, G. B. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2787979 · Cited by 257 · cited 2×
“Particularly, related studies on edge computing and caching, such as [7] [8], have shown that reinforcement”
BackgroundMethodTang, F., Mao, B., Fadlullah, Z. M., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1700244 · Cited by 247 · cited 1×
“, a typical 5G node is expected to have 2000 or more configurable parameters, a recent new trend is to optimize wireless communication by Artificial Intelligence (AI) techniques [4] [5], include but not limited to the application of AI for Physical Layer (PHY), Data Link Layer, and traffic control [6].”
MethodLi, X., Wang, X., Wan, P.-J., Han, Z., & Leung, V. C. M. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2844658 · Cited by 140 · cited 1×
“We capture Xender’s trace for one month (from 01/09/2016 to 30/09/2016), including 9,514 active mobile users, conveying 188,447 content files, and 2,107,100 content requests [13], of which the content popularity distribution can be well fitted by a Zipf distribution with ∂ = 1.”
MethodSelf-citationWhen Mobile Blockchain Meets Edge Computing: Challenges and Applications.Preprint
Xiong, Z., Zhang, Y., Niyato, D. T., Wang, P., & Han, Z. (2017) · arXiv (Cornell University) · Cited by 23
When Mobile Blockchain Meets Edge ComputingPreprint
Xiong, Z., Zhang, Y. A., Niyato, D. T., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.05938 · Cited by 6
Research works printed but not linked: 1
- 2014, Mobile Edge Computing – Introductory Technical White Paper
Cited by
Sorted by citations
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
“To account for the dynamic and time-varying conditions in a MEC system, the authors in [32] propose the use of DRL with FL to optimize caching and computation offloading”
BackgroundMethodResultEdge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing
Zhou, Z., Chen, X., Li, E., Zeng, L., Luo, K., & Zhang, J. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2918951 · Cited by 2,455
“Indeed, the marriage of edge computing and AI has given rise to a new research area, namely, “edge intelligence (EI)” or “edge AI” [9], [10].”
BackgroundSelf-citationFederated Learning With Differential Privacy: Algorithms and Performance Analysis
Wei, K., Li, J., Ding, M., Ma, C., Yang, H. H., Farokhi, F., Jin, S., Quek, T. Q. S., & Vincent Poor, H. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2988575 · Cited by 2,400
“However, FL also poses several key challenges, such as private information leakage, expensive communication costs between servers and clients, and device variability [9]–[15].”
BackgroundA review of applications in federated learning
Li, L., Fan, Y., Tse, M., & Lin, K.-Y. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106854 · Cited by 1,559
A Joint Learning and Communications Framework for Federated Learning Over Wireless Networks
Chen, M., Yang, Z., Saad, W., Yin, C., Poor, H. V., & Cui, S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3024629 · Cited by 1,547
“First, the works in [7], [19], and [22] only provided a high-level exposition of the challenges of communication in FL.”
BackgroundResultSelf-citation
Metadata
- Authors
- Wang, X., Han, Y., Wang, C., Zhao, Q., Chen, X., & Chen, M.
- Affiliations
- Tianjin University (CN)
- Huawei Technologies (China) (CN)
- Arizona State University (US)
- Huazhong University of Science and Technology (CN)
- Venue
- IEEE Network
- Published
- 2019-09
- Volume
- 33
- Issue
- 5
- Pages
- 156-165
- ISSN
- 0890-8044 (ISSN-L)
- 1558-156X
- OpenAlex
- W2962804345
- Semantic Scholar
- 6f89a632ceb8fcb81eac3d7b52e937099659cc6a
- Cited by
- 1,030
- References
- 17
- Citations by year
- 2026: 44 · 2025: 95 · 2024: 127 · 2023: 165 · 2022: 215 · 2021: 196 · 2020: 160 · 2019: 26
- FWCI
- 81.72
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Network (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Keywords
- mobile edge computing, federated learning, deep reinforcement learning, edge caching, content distribution, communication burden reduction, edge nodes, device collaboration, dynamic optimization
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.
A language model drew the claims from the paper on 2026-10-09, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-09 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
