UAV-Assisted Federated Learning With Robust Resource and Trajectory Optimization Under Location Uncertainties
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Federated learning (FL) has emerged as a promising solution to facilitate the deployment of artificial intelligence (AI) on wireless devices. However, heterogeneity of wireless devices, including disparities in computation capabilities, data sizes, and energy constraints, introduces delays in the FL completion time, particularly due to inefficient communication and slow updates from resource-constrained devices. To address this issue, we propose an unmanned aerial vehicle (UAV)-assisted FL framework that integrates UAV as a central server, collaborating with the devices to facilitate the model training process. Accordingly, we jointly consider computation and transmission strategies, as well as the task assignment and UAV trajectory to minimize the completion time of the FL process. Particularly, we consider the location uncertainties associated with the devices, along with the consequent chance-constrained aggregation process, to achieve a robust learning process. We employ the Bernstein-type inequalities to reformulate the probabilistic-form optimization into its deterministic counterpart. Then we solve the problem under a block coordinate descent framework. Simulation results demonstrate that the proposed approach significantly reduces the completion time of FL and achieves robust performance guarantee in the presence of location deviations.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it