cs.LGNov 6, 2026

Consensus-Constrained Dual-Federated Optimization with Client-Side Dynamic Weighting for Distributed Android Device Threat Defense

Authors: Mohammad Mashreghi, Mohammad Hossein Badiei, Md. Jalil Piran

Organizations: Department of Electrical and Computer Engineering, University of Tehran, Tehran 1417614411, Iran · Department of Computer Science and Engineering, Sejong University, Seoul 05006, South Korea

Abstract

Smartphones, smart-home hubs, and wearables are increasingly exposed to sophisticated Android malware, while centralized threat-detection pipelines raise privacy and scalability concerns. Federated learning (FL) enables collaborative model training without collecting raw client data, but partial participation and variation in local model quality can destabilize global optimization. In this article, we propose DW-FedADMM, a federated optimization framework that combines primal-dual coordination with performance-dependent client-side weighting. The dynamic coefficient modulates each participating client's local state before the augmented-Lagrangian update, while the dual variables regulate disagreement between local and global model states. We evaluate DW-FedADMM on three Android malware benchmarks, namely Drebin, Malgenome, and TUANDROMD, with 5, 10, and 15 clients holding IID data shards, partial client participation, and communication budgets of 5 and 10 rounds. Each configuration is repeated with ten random seeds. DW-FedADMM obtains the highest seed-averaged accuracy on Drebin (97.64% +/- 0.20%) and the best mean accuracy in 9 of the 18 dataset-client-round configurations, including 7 of the 9 configurations with a 10-round budget. Pooled over all configurations, it reaches 95.42% accuracy, 94.62% F1-score, 96.06% precision, and 99.45% AUC, compared with 95.32%, 94.51%, 95.56%, and 99.41% for FedADMM, while also giving the lowest mean false-positive rate and the smallest client update norm among the six compared methods. Both primal-dual methods are well ahead of the averaging- and proximal-based baselines on Malgenome and TUANDROMD, where the latter often remain at the majority-class solution when clients are fragmented. The gain of dynamic weighting over FedADMM is most pronounced on Drebin and with the longer communication budget, where it also reduces the variation across seeds.

Figures & tables

Explore similar work

CardsList
  1. When Clients Are Orchestrated: Strategic Gradient Manipulation to Defeat Federated Learning Servers with Efficient Defense

    Sep 22, 2026Mohamed Shaaban, Ahmed Abdelnaby, Mohamed ElmahallawyFederated LearningByzantine-Robust Federated Learning

  2. Enhanced Detective: A Dual-Stage Proactive Defense Against Internal Poisoning Attacks in Financial Fraud Detection Using Federated Learning

    Oct 13, 2026Maria-Ioana-Andrea Ivan, Orhan Ermis, Ruxandra F. OlimidFederated Learning AggregationFederated Learning

  3. DP-FedAdamW: An Efficient Optimizer for Differentially Private Federated Large Models

    Feb 23, 2026Jin Liu, Yinbin Miao, Ning Xi +1Differentially Private Federated LearningFederated Learning