AoI-Driven Client Scheduling for Federated Learning: A Lagrangian Index Approach
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) is a distributed learning framework where clients jointly train a global model without sharing their local datasets. In randomized client sampling, a subset of clients are uniformly chosen to participate in training in each communication round of FL. Recent research has shown that by jointly considering the age of information (AoI) and channel state information (CSI) of each client, the convergence of FL can be improved. In this paper, we formulate a joint AoI and CSI-based client scheduling problem as a constrained Markov decision process. We propose a low-complexity and scalable algorithm based on the Lagrangian index approach. Simulation results show that the proposed Lagrangian index-based approach achieves near-optimal performance. For FL tasks with the CIFAR-10 dataset, our results show that the proposed algorithm can speed up the convergence of FL by 40%, by reducing the duration of uplink transmission, when compared with two state-of-the-art FL algorithms.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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