Yeshwanth Cherapanamjeri

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we consider the problem of Robust Matrix Completion (RMC) where the goal is to recover a low-rank matrix by observing a small number of its entries out of which a few can be arbitrarily corrupted. We propose a simple projected gradient descent method to estimate the low-rank matrix that alternately performs a projected gradient descent step(More)
  • 1