An Alternating Minimization Algorithm for Federated Sparse Orthogonal Nonnegative Matrix Factorization
Abstract
In this paper, we develop an alternating minimization algorithm for federated sparse orthogonal nonnegative matrix factorization (ONMF) with emphases on controlling client drift. To reduce communication frequency, clients perform multiple local updates between communication rounds, biasing updates toward their respective local objectives and giving rise to client drift, particularly under data heterogeneity. In federated sparse ONMF, global nonsmooth regularization further complicates drift control, as proximal mappings generally do not commute with averaging. To address these challenges, we develop an effective optimization algorithm that introduces variable splitting to decouple proximal operator evaluation from communication, allowing clients to handle joint sparsity regularization locally. In addition, the algorithm incorporates a correction term into the local gradients to adjust the update directions and mitigate client drift. We theoretically establish that the proposed algorithm achieves sublinear convergence to a bounded residual error under some mild conditions. Numerical experiments demonstrate favorable convergence behavior on a synthetic dataset and competitive clustering performance on real-world multi-view datasets.
Related
- Strong NP-Hardness of Rank-2 Nonnegative Matrix Factorization
- From proximal alternating minimization techniques to composite proximal gradient
- Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization
- Robust Principal Component Analysis via ℓ0 Alternating Minimization
- Piñeiro mixed orthogonal polynomials and bidiagonal factorization
BibTeX
@misc{zhu2026alternating,
title = {{An Alternating Minimization Algorithm for Federated Sparse Orthogonal Nonnegative Matrix Factorization}},
author = {Yanjiao Zhu and Xianchao Xiu and Yongyang Xiong and Wanquan Liu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.21455},
eprint = {2610.21455},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.21455},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - An Alternating Minimization Algorithm for Federated Sparse Orthogonal Nonnegative Matrix Factorization
AU - Yanjiao Zhu
AU - Xianchao Xiu
AU - Yongyang Xiong
AU - Wanquan Liu
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2610.21455
UR - https://arxiv.org/abs/2610.21455
AB - In this paper, we develop an alternating minimization algorithm for federated sparse orthogonal nonnegative matrix factorization (ONMF) with emphases on controlling client drift. To reduce communication frequency, clients perform multiple local updates between communication rounds, biasing updates toward their respective local objectives and giving rise to client drift, particularly under data heterogeneity. In federated sparse ONMF, global nonsmooth regularization further complicates drift control, as proximal mappings generally do not commute with averaging. To address these challenges, we develop an effective optimization algorithm that introduces variable splitting to decouple proximal operator evaluation from communication, allowing clients to handle joint sparsity regularization locally. In addition, the algorithm incorporates a correction term into the local gradients to adjust the update directions and mitigate client drift. We theoretically establish that the proposed algorithm achieves sublinear convergence to a bounded residual error under some mild conditions. Numerical experiments demonstrate favorable convergence behavior on a synthetic dataset and competitive clustering performance on real-world multi-view datasets.
ER -