Jun 23, 2016 · Our algorithm solves RMC using nearly optimal number of observations as well as nearly optimal number of corruptions. Our result also implies ...
Abstract. In this paper, we consider the problem of Ro- bust Matrix Completion (RMC) where the goal is to recover a low-rank matrix by observing.
Nearly Optimal Robust Matrix Completion. • Let A be a m × n matrix with n ≥ m. Suppose Ω ⊆ [m] × [n] is obtained by sampling each element with probability.
Abstract. In this paper, we consider the problem of Ro- bust Matrix Completion (RMC) where the goal is to recover a low-rank matrix by observing.
Abstract. In this paper, we consider the problem of Ro- bust Matrix Completion (RMC) where the goal is to recover a low-rank matrix by observing.
Jun 24, 2016 · Abstract. In this paper, we consider the problem of Robust Matrix Completion (RMC) where the goal is to recover a low-rank matrix by ...
Aug 6, 2017 · Our algorithm solves RMC using nearly optimal number of observations while tolerating a nearly optimal number of corruptions. Our result also ...
This paper proposes a simple projected gradient descent method to estimate the low-rank matrix that alternately performs a projected gradient ascent step ...
Apr 3, 2019 · Yeshwanth Cherapanamjeri, Kartik Gupta, Prateek Jain: Nearly Optimal Robust Matrix Completion. ICML 2017: 797-805.