Search Results for author:
Found 3 papers, 1 papers with code
Fast and Sample-Efficient Federated Low Rank Matrix Recovery from column-wise Linear and Quadratic Projections
Finally, it can also be efficiently federated with a communication cost of only $nr$ per node, instead of $nq$ for projected GD.
Information Theory Information Theory
Provable Low Rank Phase Retrieval
We study the Low Rank Phase Retrieval (LRPR) problem defined as follows: recover an $n \times q$ matrix $X^*$ of rank $r$ from a different and independent set of $m$ phaseless (magnitude-only) linear projections of each of its columns.
Phaseless Subspace Tracking
This work takes the first steps towards solving the "phaseless subspace tracking" (PST) problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
