Latency Minimization for STAR-RIS-Aided Federated Learning Networks With Wireless Power Transfer
Bibliographic record
Abstract
Simultaneous transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) introduces revolutionary capabilities by reaching full space coverage for wireless signals, significantly enhancing the efficiency and reliability of Internet of Things (IoT) networks compared to traditional RIS. In this article, we propose a novel framework that leverages STAR-RIS into wirelessly powered federated learning (FL) networks with a multiantenna access point, aiming to minimize system latency. A multivariable nonconvex optimization problem is formulated to optimize phase shift vectors of STAR-RIS, beamforming matrices, time, power, and computation frequency for each user in all phases of FL. Block coordinate descent (BCD) over the combination of an 1-D search algorithm and interior point method is employed to optimize time, power, computation frequency, phase shift vectors of STAR-RIS, and active beamforming matrix in the uplink transmission phase, while semi-definite relaxation via BCD addresses phase shift vectors of STAR-RIS and beamforming matrices optimization in harvesting and downlink transmission phases. On this basis, the optimized downlink transmission time and power are derived. The convergence of the proposed algorithm and the superiority of its performance compared to benchmark schemes are validated through comprehensive simulations. Our findings indicate the potential of FL, multiantenna aggregation server, and STAR-RIS in ushering in a new era of intelligent and efficient IoT networks.
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.000 | 0.000 |
| 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.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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; a candidate call from one teacher head, 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".