arXiv (All)
open access
An Alternating Minimization Algorithm for Federated Sparse Orthogonal Nonnegative Matrix Factorization
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 t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
- An Efficient Newton Algorithm for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence#370329
- Costs of Arbitrary Real Matrix Factorizations for Pure-DP Continual Counting#422210
- Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integration#1075991
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
Record · ID 1356791
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive