Efficient Federated Low Rank Matrix Completion
<|reference_start|>Efficient Federated Low Rank Matrix Completion: In this work, we develop and analyze a Gradient Descent (GD) based solution, called Alternating GD and Minimization (AltGDmin), for efficiently solving the low rank matrix completion (LRMC) in a federated setting. LRMC involves recovering an $n \times q$ rank-$r$ matrix $\Xstar$ from a subset of its entries when $r \ll \min(n,q)$. Our theoretical guarantees (iteration and sample complexity bounds) imply that AltGDmin is the most communication-efficient solution in a federated setting, is one of the fastest, and has the second best sample complexity among all iterative solutions to LRMC. In addition, we also prove two important corollaries. (a) We provide a guarantee for AltGDmin for solving the noisy LRMC problem. (b) We show how our lemmas can be used to provide an improved sample complexity guarantee for AltMin, which is the fastest centralized solution.<|reference_end|>
@article{abbasi2024efficient,
    title={Efficient Federated Low Rank Matrix Completion},
    author={Ahmed Ali Abbasi and Namrata Vaswani},
    journal={arXiv preprint arXiv:2405.06569},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.06569},
    primaryClass={cs.LG eess.SP}
}