CHEN Lei
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks(Nanjing University of Posts and Telecommunications), Nanjing 210003, China;School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, ChinaCHEN Song-Can
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, ChinaNational Natural Science Foundation of China (61472186, 61572263, 61403208); National Science Foundation of Jiangsu Province (BK20161516, BK20151511); Postdoctoral Science Foundation of China (2015M581794); Project of Natural Science Research of Jiangsu University (15KJB520027); Postdoctoral Science Foundation of Jiangsu Province (1501023C); NUPTSF (NY214127, NY215097)
In recent years, with the great success of compressed sensing (CS) in the field of signal processing, matrix completion (MC), derived from CS, has increasingly become a hot research topic in the field of machine learning. Many researchers have done a lot of fruitful studies on matrix completion problem modeling and their optimization, and constructed relatively complete matrix completion theory. In order to better grasp the development process of matrix completion, and facilitate the combination of matrix completion theory and engineering applications, this article reviews the existing matrix completion models and their algorithms. First, it introduces the natural evolution process from CS to MC, and illustrates that the development of CS theory has laid the foundation for the formation of MC theory. Second, the article summarizes the existing matrix completion models into the four classes from the perspective of the relaxation of non-convex and non-smooth rank function, aiming to provide reasonable solutions for specific matrix completion applications; Third, in order to understand the inherent optimization techniques and facilitate solving new problem-dependent matrix completion model, the article studies the representative optimization algorithms suitable for various matrix completion models. Finally, article analyzes the existing problems in current matrix completion technology, proposes possible solutions for these problems, and discusses the future work.
陈蕾,陈松灿.矩阵补全模型及其算法研究综述.软件学报,2017,28(6):1547-1564
Copy