arXiv · 2611.10718
FedSGN: Federated Sparse Grassmann Newton Learning for IoT Anomaly Detection
Abstract
Anomaly detection plays a critical role in securing the Internet of things (IoT). Although existing federated principal component analysis (PCA) methods can learn the subspace of normal samples without sharing raw data, they often suffer from feature redundancy that may degrade detection performance. To address this limitation, we propose a novel and effective federated sparse Grassmann Newton (FedSGN) learning method for IoT anomaly detection. Technically, our FedSGN leverages the $\ell_{2,0}$-norm constraint on the global projection matrix to eliminate redundancy and introduces an orthogonality penalty to preserve the intrinsic structure. Moreover, we develop an augmented Lagrangian solver integrated with a semismooth Newton scheme to enable parallel client updates and Grassmann projection for robustness. Numerical experiments demonstrate that the proposed method achieves favorable overall detection performance while reducing communication overhead. The source code is publicly available at https://github.com/xianchaoxiu/FedSGN
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jingjing Liu, Xiansen Ju, Xianchao Xiu, Wanquan Liu. 2026-11-07. FedSGN: Federated Sparse Grassmann Newton Learning for IoT Anomaly Detection. https://searcharxiv.com/abs/2611.10718
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.