Metraipolis › archive › dc_fefee5f46f0d

Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation — arXiv:2505.20532

Source
arXiv (en)
Original
https://arxiv.org/abs/2505.20532
License (as archived)
CC0-1.0
Archived
2026-10-19T09:02:42.150Z
SHA-256 of the archived text
c215a44cbd01d96fe1614a0c4af3f9bc6b528580b40372ace50bc30253effa15
Stable URL of this page
https://metraipolis.com/documento/dc_fefee5f46f0d

How to cite

Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation — arXiv:2505.20532 — arXiv (en), https://arxiv.org/abs/2505.20532 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fefee5f46f0d (Metraipolis archive dc_fefee5f46f0d, sha256 c215a44cbd01d96fe1614a0c4af3f9bc6b528580b40372ace50bc30253effa15)
BibTeX
@misc{dcfefee5f46f0d,
  title = {Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation — arXiv:2505.20532},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2505.20532},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fefee5f46f0d; sha256 c215a44cbd01d96fe1614a0c4af3f9bc6b528580b40372ace50bc30253effa15},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2505.20532. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-11 in stat.ML).
Categorie arXiv: Machine Learning (cs.LG) ; Methodology (stat.ME); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2505.20532 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:01:32.140Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).