Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Beiyu Dong

dblp:374/3542 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0004-5774-4956ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › distributed training › edge training
device-cloud collaborative learning
0.912025
Adaptive Incentivize for Federated Learning With Cloud-Edge Collaboration Under Multi-Level Information Sharing · IEEE Trans. Computers 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
Adaptive Incentivize for Federated Learning With Cloud-Edge Collaboration Under Multi-Level Information Sharing · IEEE Trans. Computers 2025
Algorithmic game theory and mechanism design › mechanism design
incentive mechanism design
0.912025
Adaptive Incentivize for Federated Learning With Cloud-Edge Collaboration Under Multi-Level Information Sharing · IEEE Trans. Computers 2025
Edge and fog computing
edge-cloud collaboration
0.312025
Adaptive Incentivize for Federated Learning With Cloud-Edge Collaboration Under Multi-Level Information Sharing · IEEE Trans. Computers 2025

Methods — techniques the papers use, named apart from their topics

weighted potential game · 2.6potential game · 2.6
YearPublicationVenuePosition
2025 Adaptive Incentivize for Federated Learning With Cloud-Edge Collaboration Under Multi-Level Information Sharing
abstract
Federated Learning with Cloud-Edge Collaboration (FL-CEC) has emerged as a cutting-edge paradigm in distributed learning. Efficient resource investment incentive mechanisms are crucial to encouraging clients in FL-CEC to contribute the necessary data and computational resources for training. However, existing studies are inadequate in meeting the incentive design requirements under multi-level information-sharing scenarios. Moreover, current works often rely on specific functional relationships between resource investment and global model accuracy. To bridge these gaps, this paper investigates the incentive problem for data and computational resource investment under multi-level information-sharing levels. We design a resource investment incentive mechanism based on a weighted potential game without depending on any specific functional relationship between data investment and model accuracy. Furthermore, we propose four algorithms to solve resource investment strategies for different levels of information sharing. The complexity and convergence rates of the proposed algorithms are thoroughly analyzed. Finally, we construct a simulation incentive platform on the Aliyun. Extensive evaluations demonstrate that the proposed scheme effectively enhances social welfare, and improves collaborative training accuracy and efficiency.
Shijing Yuan, Beiyu Dong, Jie Li 0002, Song Guo 0001, Hongyang Chen 0001, Chentao Wu, Jie Wu 0001, Wei Zhao 0001
IEEE Trans. Computers2
2024 Adaptive Incentive for Cross-Silo Federated Learning in IIoT: A Multiagent Reinforcement Learning Approach
abstract
In the Industrial Internet of Things (IIoT), cross-silo federated learning (CSFL) enables entities, such as manufacturers and suppliers to train global models for optimizing production processes while ensuring data privacy. A well-designed incentive mechanism is essential to persuade clients to contribute data resources. However, existing methodologies overlook the dynamic nature of the training process, where the accuracy of the globally trained model and the client’s data ownership change over time. Furthermore, the majority of previous research assumes a defined functional relationship between the data contribution and the model accuracy, which is infeasible in realistic and dynamic training environments. To address these challenges, we design a novel adaptive mechanism for CSFL that inspires organizations to contribute data resources in a dynamic training environment with the aim of maximizing their long-term payoffs. This mechanism leverages multiagent reinforcement learning (MARL) to ascertain near-optimal data contribution strategies from potential game histories without necessitating private organizational information or a precise accuracy function. Experimental results indicate that our mechanism achieves adaptive incentive in dynamic environments and effectively enhances the long-term payoffs of organizations.
Shijing Yuan, Beiyu Dong, Hongtao Lv, Hongyang Chen 0001, Chentao Wu, Song Guo 0001, Yue Ding 0001, Jie Li 0002
IEEE Internet Things J.2