Guest Editorial Introduction to the Special Section on Collaborative Machine Learning for Next-Generation Intelligent Applications
Bibliographic record
Abstract
The papers in this special issue focus on collaborative machine learning for next generation intelligent applications. As a distributed learning technology, collaborative machine learning (CML) has been recently introduced to collaboratively train a model among multiple networking agents by using on-device computation. By integrating the high-potential CML with advanced emerging technologies, next-generation intelligent applications will provide more efficient, intelligent, and secure services, which may dramatically enhance the life experience of humans and revolutionize modern business. However, there are still many open challenges in this area. CML needs significant research efforts on theories, algorithms, architecture, and experiences of system deployment and maintenance. This special issue aims to offer a platform for researchers from both academia and industry to publish recent research findings and to discuss opportunities, challenges, and solutions related to collaborative machine learning.
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.005 | 0.013 |
| Meta-epidemiology (narrow) | 0.003 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.002 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.007 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.009 | 0.016 |
| Insufficient payload (model declined to judge) | 0.018 | 0.015 |
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".