FedLFP: Communication-Efficient Personalized Federated Learning on Non-IID Data in Mobile Edge Computing Environments
Bibliographic record
Abstract
Mobile Edge Computing (MEC) facilitates computing and storage at edge nodes near user devices, reducing latency and optimizing bandwidth. Federated Learning (FL) complements MEC by enabling privacy-preserving collaborative model training across edge nodes without sharing raw data. However, in MEC environments, FL faces challenges such as communication inefficiency and data heterogeneity (Non-IID), which degrade model performance and hinder convergence. To address these issues, we propose FedLFP, a communication-efficient personalized federated learning approach using label-free prototypes for Non-IID data in MEC. FedLFP employs three key strategies: (1) a Label-Free Prototype strategy to reduce communication costs and mitigate privacy risks, (2) a centroid prototype and combined clustering weight strategy to improve global prototype quality by considering data quantity and confidence levels, and (3) a multifaceted weighted contrastive learning strategy to enhance local representation learning and global alignment. We evaluated FedLFP on Android malware recognition using the KronoDroid dataset and standard image classification tasks, with eight configurations representing practical Non-IID settings. Experimental results show that FedLFP consistently outperforms thirteen state-of-the-art FL methods in accuracy, communication and computational efficiency. Additionally, we provide theoretical guarantees for the convergence of FedLFP under Non-IID conditions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.004 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".