Personalized Cross-Silo Federated Learning on Non-IID Data
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Full frame distilled prediction
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.
- Candidate categories
- Metaresearch, Meta-epidemiology (narrow), Scholarly communication, Open science
- Consensus categories
- Open science
- Domain
- Candidate signal: noneConsensus signal: none
- Study design
- Candidate signal: Theoretical or conceptualConsensus signal: none
- Genre
- Candidate signal: EmpiricalConsensus signal: Empirical
- Teacher disagreement score
- 0.468
- Threshold uncertainty score
- 1.000
- Validation status
machine_predicted_unvalidated·codex-gemma-dda1882f352a
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.033 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.033 | 0.047 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
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.
- Teacher spread
- 0.203 · how far apart the two teachers sit on this one work
- Validation status
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
Abstract
Non-IID data present a tough challenge for federated learning. In this paper, we explore a novel idea of facilitating pairwise collaborations between clients with similar data. We propose FedAMP, a new method employing federated attentive message passing to facilitate similar clients to collaborate more. We establish the convergence of FedAMP for both convex and non-convex models, and propose a heuristic method to further improve the performance of FedAMP when clients adopt deep neural networks as personalized models. Our extensive experiments on benchmark data sets demonstrate the superior performance of the proposed methods.
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.
The record
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Topic
- Privacy-Preserving Technologies in Data
- Field
- Computer Science
- Canadian institutions
- McMaster UniversityHuawei Technologies (Canada)Simon Fraser University
- Funders
- Natural Sciences and Engineering Research Council of CanadaHong Kong Baptist University
- Keywords
- Computer scienceBenchmark (surveying)HeuristicPairwise comparisonConvergence (economics)Federated learningDeep learningMachine learningArtificial intelligenceArtificial neural networkData mining
- Has abstract in OpenAlex
- yes