Low-Cost Federated Broad Learning for Privacy-Preserved Knowledge Sharing in the RIS-Aided Internet of Vehicles
Bibliographic record
Abstract
High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles (IoVs). However, it is challenging to ensure high efficiency of local data learning models while preventing privacy leakage in a high mobility environment. In order to protect data privacy and improve data learning efficiency in knowledge sharing, we propose an asynchronous federated broad learning (FBL) framework that integrates broad learning (BL) into federated learning (FL). In FBL, we design a broad fully connected model (BFCM) as a local model for training client data. To enhance the wireless channel quality for knowledge sharing and reduce the communication and computation cost of participating clients, we construct a joint resource allocation and reconfigurable intelligent surface (RIS) configuration optimization framework for FBL. The problem is decoupled into two convex subproblems. Aiming to improve the resource scheduling efficiency in FBL, a double Davidon–Fletcher–Powell (DDFP) algorithm is presented to solve the time slot allocation and RIS configuration problem. Based on the results of resource scheduling, we design a reward-allocation algorithm based on federated incentive learning (FIL) in FBL to compensate clients for their costs. The simulation results show that the proposed FBL framework achieves better performance than the comparison models in terms of efficiency, accuracy, and cost for knowledge sharing in the IoV.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".