Efficient Federated Low Rank Matrix Recovery via Alternating GD and Minimization: A Simple Proof
Copyright policy )Efficient Federated Low Rank Matrix Recovery via Alternating GD and Minimization: A Simple Proof
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.
- Iowa State University United States
FOS: Computer and information sciences, Iterative numerical methods for linear systems, Numerical optimization and variational techniques, Computer Science - Information Theory, Information Theory (cs.IT), Learning and adaptive systems in artificial intelligence
FOS: Computer and information sciences, Iterative numerical methods for linear systems, Numerical optimization and variational techniques, Computer Science - Information Theory, Information Theory (cs.IT), Learning and adaptive systems in artificial intelligence
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!