On Unbiased Low-Rank Approximation with Minimum Distortion

Leighton Pate Barnes, Stephen Cameron, Benjamin Howard

We describe an algorithm for sampling a low-rank random matrix $Q$ that best approximates a fixed target matrix $P\in {\mathbb{C}}^{n\times m}$ in the following sense: $Q$ is unbiased…