Advancing Federated Learning with Granular Computing
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.
Bibliographic record
Abstract
Over the recent years, we have been witnessing spectacular achievements of Artificial Intelligence (AI) and Machine Learning (ML), in particular. We have seen highly visible accomplishments encountered in natural language processing and computer vision impacting numerous areas of human endeavours. Being driven inherently by the technologically advanced learning and architectural developments, ML constructs are highly impactful coming with far reaching consequences; just to mention autonomous vehicles, health care imaging, decision-making processes in critical areas, among others. The quality of ML architectures and credibility of generated results are inherently implied by the nature, quality, and amount of available data. The credibility of ML models and confidence quantified their results are also of paramount concern to any critical application. In this study, we advocate that the credibility (confidence) of results produced by ML constructs is inherently expressed in the form of information granules. Several development scenarios are carefully revisited including those involving constructs in statistics (confidence and prediction intervals), probability (Gaussian process models), and granular parameters (fuzzy sets and interval techniques). We augment the commonly encountered and challenging category of applications of ML referred to as federated learning where the aspect of quality of the model and its results calls for a thorough assessment.
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 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.001 |
| 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.000 |
| 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 it