Digital AirComp-Assisted Federated Edge Learning with Adaptive Quantization
Bibliographic record
Abstract
Federated edge learning (FEEL) has been introduced for training machine learning models on distributed datasets for applications such as human monitoring. However, some challenges exist concerning the number of communication rounds and communication energy consumption involved in transmiting gradients during the training process. Moreover, over-the-air computation (AirComp) technology has gained attention recently, benefiting from superposition characteristic of wireless channels to compute functions over the air. While primarily designed for analog systems, there is potential for applying this technology in digital systems with embedded modulation schemes. This paper addresses these challenges by proposing a digital AirComp system for federated learning aggregation. The system employs a multi-bit quantization scheme to modulate gradients, adhering to a maximum transmission power constraint. An adaptive quantization scheme is also introduced, which considers the impact of quantization error and the error induced by additive white Gaussian noise. We derive closed-form expressions for pre-processing coefficients at devices and post-processing scaler at the access point (AP) to minimize the mean-squared error between high-precision and quantized qradients under the maximum transmission power constraint. Finally, the performance of the proposed scheme is evaluated in terms of achieved test accuracy, mean-squared error (MSE), and energy consumption, demonstrating its potential effectiveness compared to the benchmark schemes.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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; 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".