Greedy Approach for Low-Rank Matrix Recovery
Numerical Analysis
2013-04-16 v1 Information Theory
Numerical Analysis
math.IT
Abstract
We describe the Simple Greedy Matrix Completion Algorithm providing an efficient method for restoration of low-rank matrices from incomplete corrupted entries. We provide numerical evidences that, even in the simplest implementation, the greedy approach may increase the recovery capability of existing algorithms significantly.
Keywords
Cite
@article{arxiv.1304.4162,
title = {Greedy Approach for Low-Rank Matrix Recovery},
author = {Alexander Petukhov and Inna Kozlov},
journal= {arXiv preprint arXiv:1304.4162},
year = {2013}
}