MétaCan
Menu
← Back to cohort

SAFL: Structure-Aware Personalized Federated Learning via Client-Specific Clustering and SCSI-Guided Model Pruning

2025· article· W7124168874 on OpenAlexfundno aff
Nan Li, Xiaolu Wang, Xiao Du, Puyu Cai, Ting Wang

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPruningFederated learningCluster analysisPersonalizationBenchmark (surveying)Similarity (geometry)Data modeling

Abstract

fetched live from OpenAlex

Federated Learning (FL) enables collaborative model training across distributed clients while preserving data privacy. However, conventional FL approaches often struggle to deliver accurate and personalized models in the presence of non-IID data. Although model pruning has been proposed to improve model adaptability, existing methods relying solely on local data often yield sub-optimal sub-models due to limited task-specific information. To address this, we propose SAFL (Structure-Aware Federated Learning), a novel framework that enhances personalization by integrating client clustering with Similar Client Structure Information (SCSI)-guided pruning. SAFL adopts a two-stage process: it first clusters clients based on data similarity and uses aggregated structural insights to guide pruning; then, clients train the resulting sub-models and participate in heterogeneous model aggregation. Extensive experiments on benchmark datasets demonstrate that SAFL achieves superior accuracy and model compactness compared to existing methods, particularly under non-IID settings. These results highlight the effectiveness of structure-aware pruning and collaboration in advancing personalized federated 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 imitation

Not 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.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0040.004
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0020.001

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.

Opus teacher head0.039
GPT teacher head0.290
Teacher spread0.251 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicPrivacy-Preserving Technologies in Data→French-language works237,207→