MétaCan
Menu
Back to cohort

Robust transmission design for federated learning through over-the-air computation

2025· article· en· W4408564533 on OpenAlex
Hamideh Zamanpour Abyaneh, Saba Asaad, Amir Masoud Rabiei

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueChina Communications · 2025
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceComputationTransmission (telecommunications)Robustness (evolution)Distributed computingComputer networkHuman–computer interactionArtificial intelligenceTelecommunicationsAlgorithm

Abstract

fetched live from OpenAlex

Over-the-air computation (AirComp) enables federated learning (FL) to rapidly aggregate local models at the central server using waveform superposition property of wireless channel. In this paper, a robust transmission scheme for an AirComp-based FL system with imperfect channel state information (CSI) is proposed. To model CSI uncertainty, an expectation-based error model is utilized. The main objective is to maximize the number of selected devices that meet mean-squared error (MSE) requirements for model broadcast and model aggregation. The problem is formulated as a combinatorial optimization problem and is solved in two steps. First, the priority order of devices is determined by a sparsity-inducing procedure. Then, a feasibility detection scheme is used to select the maximum number of devices to guarantee that the MSE requirements are met. An alternating optimization (AO) scheme is used to transform the resulting nonconvex problem into two convex subproblems. Numerical results illustrate the effectiveness and robustness of the proposed scheme.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Open science
Consensus categoriesOpen science
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.691
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0020.000
Scholarly communication0.0000.001
Open science0.0220.018
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.094
GPT teacher head0.334
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it