Scollr summary
What this paper is about
A novel algorithm named Group Relative Policy Optimization Based on Hierarchical Mean-Field Theory (OGRPO-HMF) is proposed, which can jointly optimize the local training of nodes and the global model aggregation of servers to comprehensively enhance the efficiency and performance of FEL.
Full abstract
Read the full abstract
The proliferation of edge devices, data continuously generated at the network edge has given risen to the generation of potential privacy disclosure concerns. Federated edge learning (FEL) in the mobile edge computing (MEC) systems, as a distributed machine learning architecture, can be customized efficiently in response to these challenges by sharing only model parameters instead of raw data. In the realistic scenarios, however, bias to the global model is an issue largely due to the nodes with different data distributions and resource constraints. By leveraging the possibility of loitering behavior of nodes on the training data and the integration of learning algorithm performance as intermediaries to well cope with data imbalance in a hyperopic manner, it enables great potentials in low-latency and energy-efficient FEL model performance. Toward this end, this paper is dedicated to addressing issues related to participant laziness and effective incentives from the perspective of optimizing the local training process and global aggregation simultaneously. Specially, the mixed model of two-stage leader-follower Stackelberg game and incentive mechanism is embraced to address the relations between an aggregator and nodes for energy-efficient resource management. Then we systematically analyze the existence of Nash Equilibrium. An efficient off-policy-based group relative policy optimization with hierarchical mean-field theory(OGRPO-HMF) has been proposed to optimize the local training process and global aggregation simultaneously. To evaluate the effectiveness of our proposed OGRPO-HMF algorithm, we compare its overall performance with the state-of-the-art counterparts. Our experimental results over different datasets demonstrate the superiority of OGRPO-HMF in reducing the average loss on all training samples and total training time by ensuring the model accuracy.
Direct answer
What can I do from this paper page?
Use this page to scan "Hierarchical Mean-Field Theory-based Off-Policy GRPO for Federated Edge Learning in Resource-Constrained Edge Computing" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Privacy-Preserving Technologies in Data research, save the paper, or map adjacent work.
Research areas
Follow related topics
Citation
BibTeX
@article{Ai2026Hierarchical,
title = {Hierarchical Mean-Field Theory-based Off-Policy GRPO for Federated Edge Learning in Resource-Constrained Edge Computing},
author = {B. Ai and Yu Sun and Yi-Xiang Wang and Mengyuan Jiang and Mengyuan Jiang and Ming Tan and Siyu Zhu},
journal = {Cognitive Computation},
year = {2026},
doi = {10.1007/s12559-026-10630-6},
url = {https://doi.org/10.1007/s12559-026-10630-6}
}
FAQ
Using this paper in a discovery workflow
How do I find related work for this paper?
Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.
How can I keep up with new Privacy-Preserving Technologies in Data research papers?
Follow Privacy-Preserving Technologies in Data research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.
Can I cite this paper from this page?
This page includes a static BibTeX block for Hierarchical Mean-Field Theory-based Off-Policy GRPO for Federated Edge Learning in Resource-Constrained Edge Computing. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.
Follow this research in Scollr
Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.
Get the app