-
Notifications
You must be signed in to change notification settings - Fork 0
aabbas02/LowRankMatrixCompletion
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This repository contains code to reproduce experiments in three low rank matrix completion papers: [1] Efficient Federated Low Rank Matrix Completion Paper URL: https://ieeexplore.ieee.org/abstract/document/10975055/ [2] Byzantine-Resilient Federated Alternating Gradient Descent and Minimization for Partly-Decoupled Low Rank Matrix Learning Paper URL: https://icml.cc/virtual/2025/poster/44370 The code for a subset (real data experiments only) is included here. [3] Locally Permuted Low Rank Column-wise Sensing Paper URL: https://arxiv.org/pdf/2509.09820 For [1], - Use the default branch "trsnsctns". - For a distributed python implementation using AWS EC-2 instances, please contact the author Ahmed Ali Abbasi at email: ahmedabbasi000@gmail.com For [2], switch to the branch "robustMtrxCompltn" For [3], switch to the branch "withPermutation" To be done: merge the different branches and include instructions on how to run the code.
About
AltGDMin compared with three other benchmark methods for the Low Rank Matrix Completion
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published