Efficient Federated Low Rank Matrix Recovery via Alternating GD and Minimization: A Simple Proof
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909326169341952 |
|---|---|
| author | Vaswani, Namrata |
| author_facet | Vaswani, Namrata |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_17782 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Efficient Federated Low Rank Matrix Recovery via Alternating GD and Minimization: A Simple Proof Vaswani, Namrata Information Theory 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. |
| title | Efficient Federated Low Rank Matrix Recovery via Alternating GD and Minimization: A Simple Proof |
| topic | Information Theory |
| url | https://arxiv.org/abs/2306.17782 |