Hierarchical Mean-Field Theory-based Off-Policy GRPO for Federated Edge Learning in Resource-Constrained Edge Computing

preprint OA: closed
📄 Open PDF Full text JSON View at publisher

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.
Full text 2,986 characters · extracted from oa-doi-fallback · 2 sections · click to expand

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. Supplementary Material File (cas-dc-sample.pdf) - Download - 2.34 MB Information & Authors Information Version history Copyright This work is licensed under a Non Exclusive No Reuse License.

Keywords

Authors Metrics & Citations Metrics Article Usage 286views 144downloads Citations Download citation Bing Ai, Yu Sun, Zijun Wu, et al. Hierarchical Mean-Field Theory-based Off-Policy GRPO for Federated Edge Learning in Resource-Constrained Edge Computing. Authorea. 20 June 2025. DOI: https://doi.org/10.22541/au.175042344.47117492/v1 DOI: https://doi.org/10.22541/au.175042344.47117492/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu.

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: oa-doi-fallback

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-07-10T06:41:27.906138+00:00