Efficient low rank matrix approximation via orthogonality pursuit and ℓ2 regularization

Siyuan Li, Jiawan Zhang, Xiaojie Guo

Abstract

Low rank matrix approximation, in the presence of missing data and outliers, has previously shown its significance as a theoretic foundation in a wide spectrum of tabulated information processing applications. To fit low rank models, minimizing the nuclear norm of matrices is a popular scheme, the computational load of which, however, is heavy. While bilinear factorization can largely mitigate the computational complexity. Unfortunately, without a known or precisely estimated target rank, this strategy often performs vulnerably when the given data is dirty. This paper attempts to simultaneously achieve the computational efficiency as well as the robustness to mild rank initialization and gross corruptions. Moreover, several Augmented Lagrange Multiplier based solvers and a heuristic rank estimator are customized to seek the optimal solution. Theoretical analysis on convergence and complexity, and experiments on both synthetic and real data are provided to reveal the efficacy of our method and show its superiority over the state-of-the-art alternatives.
BibTeX
@inproceedings{li2017efficient,
  author = {Siyuan Li and Jiawan Zhang and Xiaojie Guo},
  title = {{Efficient low rank matrix approximation via orthogonality pursuit and ℓ<sup>2</sup> regularization}},
  booktitle = {ICME},
  year = {2017},
  doi = {10.1109/icme.2017.8019314},
}

Loading related content...

Figure