Federated Self-Supervised Learning Based on Prototypes Clustering Contrastive Learning for Internet of Vehicles Applications
Bibliographic record
Abstract
Federated learning (FL) is a novel paradigm for distribute edge intelligence for the Internet-of-Vehicles (IoV) application, which can enable superior performance in model training without the need to share local data. However, in the actual architecture of FL, the existence of nonindependent and identically distributed (non-IID) data at the edge device, along with the involvement of randomly participating distributed nodes, can result in model bias and a subsequent decrease in overall performance. To solve this problem, a new federated self-supervised learning method based on prototypes clustering contrastive learning (FedPCC) is proposed, which can effectively addresses the issue of asynchronous edge training and global model bias by introducing an unsupervised prototypes layer. The prototypes layer maps edge features to a global space and performs clustering, facilitating the new aggregation method of global prototypes on the server. Then, models from other components are aggregated based on data weight. Besides that, during the parameter deployment phase, we replace the prototype layer to acquire global knowledge, while employing momentum updates to preserve the local knowledge of the other components. Finally, to assess the efficacy of our proposed approach, we carried out comprehensive experiments across the various data sets. The findings show that our method gains state-of-the-art performance, which also validates its effectiveness.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| 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".