Low-Rank Matrix Completion: A Contemporary Survey

Abstract

As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest. Over the years, there have been lots of works on this topic but it might not be easy to grasp the essential knowledge from these studies. This is mainly because many of these works are highly theoretical or a proposal of new LRMC technique. In this paper, we give a contemporary survey on LRMC. In order to provide better view, insight, and understanding of potentials and limitations of LRMC, we present early scattered results in a structured and accessible way. Specifically, we classify the state-of-the-art LRMC techniques into two main categories and then explain each category in detail. We next discuss issues to be considered when one considers using LRMC techniques. These include intrinsic properties required for the matrix recovery and how to exploit a special structure in LRMC design. We also discuss the convolutional neural network (CNN) based LRMC algorithms exploiting the graph structure of a low-rank matrix. Further, we present the recovery performance and the computational complexity of the state-of-the-art LRMC techniques. Our hope is that this survey article will serve as a useful guide for practitioners and non-experts to catch the gist of LRMC.

References in corpus (13)

• Semi-Supervised Classification with Graph Convolutional Networks
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Message Passing Algorithms for Compressed Sensing
• Deep Convolutional Networks on Graph-Structured Data
• Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
• Generalized Orthogonal Matching Pursuit
• Fog Computing based Radio Access Networks: Issues and Challenges
• An overview of low-rank matrix recovery from incomplete observations
• Overview of Full-Dimension MIMO in LTE-Advanced Pro
• No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
• A Neural Autoregressive Approach to Collaborative Filtering
• Joint CSIT Acquisition Based on Low-Rank Matrix Completion for FDD Massive MIMO Systems
• Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix Estimation

Cited by in corpus (2)

• Discrete-Aware Matrix Completion via Proximal Gradient
• On the rank of Z_2-matrices with free entries on the diagonal