Efficient Federated Low Rank Matrix Recovery via Alternating GD and Minimization: A Simple Proof
arXiv:2306.17782 · doi:10.1109/TIT.2024.3365795
Abstract
This note provides a significantly simpler and shorter proof of our sample complexity guarantee for solving the low rank column-wise sensing problem using the Alternating Gradient Descent (GD) and Minimization (AltGDmin) algorithm. AltGDmin was developed and analyzed for solving this problem in our recent work. We also provide an improved guarantee.