Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation
Not on the map. Why?
Abstract (arXiv)
This paper studies robust estimation for Independent Component Analysis (ICA) in the federated learning setting, where data are locally distributed across clients and may exhibit substantial heterogeneity. The goal is to recover a common global mixing matrix by aggregating local estimators computed by individual clients. The main difficulty is that local ICA estimators are identifiable only up to sign flips and column permutations and may have highly heterogeneous estimation quality. We propose a novel three-step aggregation method that first aligns the permutations across all local estimators via a particular spectral clustering approach, then aligns the signs within each estimated cluster via another tailored spectral approach, and finally applies the geometric median for robust aggregation. The proposed estimator is shown to remain accurate even when a substantial fraction of local estimators are of low quality or inconsistent, as long as each cluster contains a majority of accurate estimators. This contrasts with its analogue based on simple averaging, whose performance is determined by the worst local estimator. In the homogeneous setting, the robust estimator is also shown to be minimax optimal, up to a logarithmic factor, both when the number of clients remains fixed and when it diverges. The theoretical findings are corroborated by simulation studies and a real-data analysis.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 54 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
25 of 54 references.
References · 25
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2019Robust Aggregation for Federated Learningcited by 314
- 2019Tighter Theory for Local SGD on Identical and Heterogeneous Datacited by 266
- 2019On the Convergence of Local Descent Methods in Federated Learningcited by 150
- 2019Robust Federated Learning in a Heterogeneous Environmentcited by 88
- 2018Defending Against Saddle Point Attack in Byzantine-Robust Distributed Learningcited by 32
- 2016Polynomial-time Tensor Decompositions with Sum-of-Squarescited by 22
- 2023FedLPA: One-shot Federated Learning with Layer-Wise Posterior Aggregationcited by 22
- 2020Vintage Factor Analysis with Varimax Performs Statistical Inferencecited by 16
- 2022Non-IID Quantum Federated Learning with One-shot Communication Complexitycited by 15
- 2024FedFisher: Leveraging Fisher Information for One-Shot Federated Learningcited by 15
13 more
- 2014On the Optimality of Averaging in Distributed Statistical Learningcited by 14
- 2023Large Dimensional Independent Component Analysis: Statistical Optimality and Computational Tractabilitycited by 12
- 2024Task Arithmetic Through The Lens Of One-Shot Federated Learningcited by 12
- 2024FuseFL: One-Shot Federated Learning through the Lens of Causality with Progressive Model Fusioncited by 11
- 2024One-Shot Sequential Federated Learning for Non-IID Data by Enhancing Local Model Diversitycited by 8
- 2023Towards the Theory of Unsupervised Federated Learning: Non-asymptotic Analysis of Federated EM Algorithmscited by 7
- 2022Global Convergence of Federated Learning for Mixed Regressioncited by 6
- 2021Unique sparse decomposition of low rank matricescited by 4
- 2014Analyzing Tensor Power Method Dynamics in Overcomplete Regimecited by 3
- 2023Optimal vintage factor analysis with deflation varimaxcited by 2
- 2021Analog MIMO Communication for One-shot Distributed Principal Component Analysiscited by 1
- 2022Robust Unsupervised Multi-task and Transfer Learning on Gaussian Mixture Modelscited by 1
- 2024Byzantine-tolerant distributed learning of finite mixture modelscited by 1
Built on by
Not cited yet.