FedSynHAR: a framework based on feature-enhanced adaptive pruning-mutual distillation for federated human activity recognition

Deep-learning-based human activity recognition (HAR) has been widely studied and applied in recent years, but it raises privacy concerns. Federated learning (FL) enables collaborative training without sharing raw data, thereby protecting user privacy. However, FL for HAR is challenged by three coupled factors: non-IID data across clients, aggregation under heterogeneous local models, and stringent computation and bandwidth budgets on edge hardware. To address these factors, this work introduces FedSynHAR, a lightweight FL framework that combines Gradient-Importance-based Adaptive Pruning (GIAP) with Channel-guided Feature-level Mutual Distillation (CFMD). GIAP prunes both server and client networks based on gradient importance, reducing computational and communication overhead; CFMD uses channel importance to guide mutual distillation between local and proxy models and mitigates pruning-induced degradation to improve robustness under non-IID conditions. Experiments on UCI-HAR and PAMAP2 demonstrate the effectiveness of FedSynHAR for federated HAR. On UCI-HAR, FedSynHAR converges about 2× faster than FedAvg, achieves 94.91% accuracy under non-IID settings, and reduces overhead by up to two orders of magnitude. Results on PAMAP2 further support the robustness of FedSynHAR under stronger heterogeneity.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-06-17
DOI
https://doi.org/10.1038/s41598-026-58066-0
Primary Topic
Context-Aware Activity Recognition Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FedSynHAR: a framework based on feature-enhanced adaptive pruning-mutual distillation for federated human activity recognition

Rongze Fan, Cheng Wang
Scientific Reports
Context-Aware Activity Recognition Systems
article

FedSynHAR: a framework based on feature-enhanced adaptive pruning-mutual distillation for federated human activity recognition

Rongze Fan, Cheng Wang
article en

Abstract

Deep-learning-based human activity recognition (HAR) has been widely studied and applied in recent years, but it raises privacy concerns. Federated learning (FL) enables collaborative training without sharing raw data, thereby protecting user privacy. However, FL for HAR is challenged by three coupled factors: non-IID data across clients, aggregation under heterogeneous local models, and stringent computation and bandwidth budgets on edge hardware. To address these factors, this work introduces FedSynHAR, a lightweight FL framework that combines Gradient-Importance-based Adaptive Pruning (GIAP) with Channel-guided Feature-level Mutual Distillation (CFMD). GIAP prunes both server and client networks based on gradient importance, reducing computational and communication overhead; CFMD uses channel importance to guide mutual distillation between local and proxy models and mitigates pruning-induced degradation to improve robustness under non-IID conditions. Experiments on UCI-HAR and PAMAP2 demonstrate the effectiveness of FedSynHAR for federated HAR. On UCI-HAR, FedSynHAR converges about 2× faster than FedAvg, achieves 94.91% accuracy under non-IID settings, and reduces overhead by up to two orders of magnitude. Results on PAMAP2 further support the robustness of FedSynHAR under stronger heterogeneity.

Scientific Reports
Fuzhou University (CN)
Zero hunger
Openalex Percentile: Top 6%
Context-Aware Activity Recognition Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.