Minimax Rank$1$ Matrix Factorization
[edit]
Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, PMLR 108:34263436, 2020.
Abstract
We consider the problem of recovering a rankone matrix when a perturbed subset of its entries is revealed. We propose a method based on least squares in the logspace and show its performance matches the lower bounds that we derive for this problem in the smallperturbation regime, which are related to the spectral gap of a graph representing the revealed entries. Unfortunately, we show that for larger disturbances, potentially exponentially growing errors are unavoidable for any consistent recovery method. We then propose a second algorithm relying on encoding the matrix factorization in the stationary distribution of a certain Markov chain. We show that, under the stronger assumption of known upper and lower bounds on the entries of the true matrix, this second method does not have exponential error growth for large disturbances. Both algorithms can be implemented in nearly linear time.
Related Material


