Semi-Supervised Federated Learning Over Heterogeneous Wireless IoT Edge Networks: Framework and Algorithms
Bibliographic record
Abstract
Federated learning (FL) is a promising paradigm for future sixth-generation wireless systems to underpin network edge intelligence for smart cities applications. However, most of the data collected by the Internet of Things devices in such applications is unlabeled, necessitating the use of semi-supervised learning. Existing studies have introduced solutions to run semi-supervised FL; however, they overlooked the inherent critical impacts of the wireless characteristics at the network edge. We fill this gap by proposing novel solutions to run semi-supervised FL over wireless network edge, considering the limited computation and communication resources and deadline constraints and realizing that unlabeled data can be automatically labeled during the training rounds to improve the performance of the global model. The problem is first formulated as an optimization problem followed by a two-phase solution. In the first phase, we propose a bisection-based algorithm to find the transmit power and local processing speed that optimally fit the new injected labeled data. In the second phase, we propose three algorithms to control the local updates and injected samples that meet the deadline constraint. We analyze the performance of each algorithm concerning the tradeoffs between learning performance, training time, and total energy consumption. Targeting two applications in smart cities, human activity recognition and object detection, we conduct extensive simulations using realistic federated data sets under nonindependent and identically distributed settings. Numerical results show that the proposed algorithms effectively utilize unlabeled samples while accounting for the characteristics of wireless edge networks in smart cities.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.013 | 0.031 |
| Research integrity | 0.000 | 0.003 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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; both teacher heads agree on what is shown here.
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".