MoFLeuR: Motion-based Federated Learning Gesture Recognition
Bibliographic record
Abstract
In recent years, Deep Neural Networks (DNNs) have been widely used for Human Gesture Recognition (HGR) based on the information obtained from inertial sensors, such as accelerometers and gyroscopes, available on smart Internet of Things (IoT) devices. Most of the recent works on HGR using motion data rely on gathering a dataset, that faces two major challenges: a ) the datasets are originally stored on the smart devices at the end-users, and gathering them in one place is not feasible due to communication limitations, and b ) clients are reluctant to share their private data with a central server due to privacy concerns. In this paper, we address these issues and propose a privacy-preserving framework based on Federated Learning (FL) for HGR using motion data, called Motion-based Federated Learning Gesture Recognition (MoFLeuR). Furthermore, we consider different types of data heterogeneity which have destructive effects on the performance of the global model. Accordingly, we propose a communication and computation-efficient client selection method that chooses the clients to mitigate the impact of data heterogeneity in the training process. In the proposed framework, clients are not requested to share sensitive information about their local datasets with the edge server in the FL process. Simulation results show that the proposed MoFLeuR algorithm improves the performance of the global model in the presence of different degrees of data heterogeneity, and it outperforms the baseline algorithms in terms of different metrics, namely accuracy, convergence speed, and communication and computation efficiency.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".