{"type":"ScholarlyArticle","title":"Online Robust Low Rank Matrix Recovery","authors":[{"name":"Xiaojie Guo","slug":"xiaojie-guo","given":"Xiaojie","family":"Guo","affiliation":"State Key Laboratory of Information Security Institute of Information Engineering , Chinese Academy of Sciences"}],"abstract":"Low rank matrix recovery has shown its importance as a theoretic foundation in many areas of information processing. Its solutions are usually obtained in batch mode that requires to load all the data into memory during processing, and thus are hardly applicable on large scale data. Moreover, a fraction of data may be severely contaminated by outliers, which makes accurate recovery significantly more challenging. This paper proposes a novel online robust low rank matrix recovery method to address these difficulties. In particular, we first introduce an online algorithm to solve the problem of low rank matrix completion. Then we move on to low rank matrix recovery from observations with intensive outliers. The outlier support is robustly estimated from a perspective of mixture model. Experiments on both synthetic and real data are conducted to demonstrate the efficacy of our method and show its superior performance over the state-of-the-arts.","doi":null,"url":"https://ijcai.org/proceedings/2015/498","pdf":"https://ijcai.org/proceedings/2015/0498.pdf","markdown":"https://ijcai.org/proceedings/2015/498.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/498","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Special Track on Machine Learning","track":"Special Track on Machine Learning","number":498,"pages":{"first":3540,"last":3545},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Balzano et al., 2011] L. Balzano, R. Nowak, and B. Recht. Online identification and tracking of subspaces from highly incomplete information. arXiv:1006.4046, 2011.","title":"Online identification and tracking of subspaces from highly incomplete information","authors":"L Balzano, R Nowak, B Recht","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bertsekas, 1999] D. Bertsekas. Nonlinear Programming. Athena Scientific, 1999.","title":"Nonlinear Programming","authors":"D Bertsekas","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bottou and Bousquet, 2008] L. Bottou and O. Bousquet. The trade-offs of large scale learning. In Proceedings of NIPS, pages 161-168, 2008.","title":"The trade-offs of large scale learning","authors":"Bousquet Bottou, ] L Bottou, O Bousquet","year":"2008","venue":"Proceedings of NIPS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Candès et al., 2011] E. Candès, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of the ACM, 58(3):1-37, 2011.","title":"Robust principal component analysis","authors":"E Candès, X Li, Y Ma, J Wright","year":"2011","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chandrasekaran et al., 2011] V. Chandrasekaran, S. Sang- havi, P. Parrilo, and A. Willsky. Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization, 21(2):572-596, 2011.","title":"Rank-sparsity incoherence for matrix decomposition","authors":"V Chandrasekaran, S Sanghavi, P Parrilo, A Willsky","year":"2011","venue":"SIAM Journal on Optimization","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen et al., 2014] C. Chen, X. Zheng, Y. Wang, F. Hong, and Z. Lin. Context-aware collaborative topic regression with social matrix factorization for recommender systems. In Proceedings of AAAI, pages 9-15, 2014.","title":"Context-aware collaborative topic regression with social matrix factorization for recommender systems","authors":"C Chen, X Zheng, Y Wang, F Hong, Z Lin","year":"2014","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dempster et al., 1977] A. Dempster, N. Laird, and D. Ru- bin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, 39(1):1-38, 1977.","title":"Maximum likelihood from incomplete data via the em algorithm","authors":"A Dempster, N Laird, D Rubin","year":"1977","venue":"Journal of the Royal Statistical Society","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Feng et al., 2013] J. Feng, H. Xu, and S. Yan. Online robust pca via stochastic optimization. In Proceedings of NIPS, pages 1-9, 2013.","title":"Online robust pca via stochastic optimization","authors":"J Feng, H Xu, S Yan","year":"2013","venue":"Proceedings of NIPS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gu et al., 2014] S. Gu, L. Zhang, W. Zuo, and X. Feng. Weighted nuclear norm minimization with applications to image denoising. In Proceedings of CVPR, pages 2862- 2869, 2014.","title":"Weighted nuclear norm minimization with applications to image denoising","authors":"S Gu, L Zhang, W Zuo, X Feng","year":"2014","venue":"Proceedings of CVPR","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Guo et al., 2013] X. Guo, X. Cao, X. Chen, and Y. Ma. Video editing with temporal, spatial and appearance con- sistency. In Proceedings of CVPR, pages 2283-2290, 2013.","title":"Video editing with temporal, spatial and appearance consistency","authors":"Guo","year":"2013","venue":"Proceedings of CVPR","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Guo et al., 2014a] X. Guo, X. Cao, and Y. Ma. Robust sep- aration of reflection from multiple images. In Proceedings of CVPR, pages 2195-2202, 2014.","title":"Robust separation of reflection from multiple images","authors":"Guo","year":"2014","venue":"Proceedings of CVPR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Guo et al., 2014b] X. Guo, X. Wang, L. Yang, X. Cao, and Y. Ma. Robust foreground detection using smoothness and arbitrariness constraints. In Proceedings of ECCV, pages 535-550, 2014.","title":"Robust foreground detection using smoothness and arbitrariness constraints","authors":"Guo","year":"2014","venue":"Proceedings of ECCV","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[He et al., 2012] J. He, L. Balzano, and A. Szlam. Incremen- tal gradient on the grassmannian for online foreground and background separation in subsampled video. In Proceed- ings of CVPR, pages 1568-1575, 2012.","title":"Incremental gradient on the grassmannian for online foreground and background separation in subsampled video","authors":"J He, L Balzano, A Szlam","year":"2012","venue":"Proceedings of CVPR","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jamali and Ester, 2011] M. Jamali and M. Ester. A transitiv- ity aware matrix factorization model for recommendation in social networks. In Proceedings of IJCAI, pages 2644- 2649, 2011.","title":"A transitivity aware matrix factorization model for recommendation in social networks","authors":"M Jamali, M Ester","year":"2011","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/440"},{"position":15,"raw":"[Liu et al., 2013] J. Liu, X. Tai, H. Huang, and Z. Huan. A weighted dictionary learning model for denoising images corrupted by mixed noise. IEEE TIP, 22(3):1108-1120, 2013.","title":"A weighted dictionary learning model for denoising images corrupted by mixed noise","authors":"J Liu, X Tai, H Huang, Z Huan","year":"2013","venue":"IEEE TIP","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Mairal et al., 2010] J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. JMLR, 11(1):19-60, 2010.","title":"Online learning for matrix factorization and sparse coding","authors":"Mairal","year":"2010","venue":"JMLR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Park et al., 2013] S. Park, Y. Kim, and S. Choi. Hierarchi- cal bayesian matrix factorization with side information. In Proceedings of IJCAI, pages 1593-1599, 2013.","title":"Hierarchical bayesian matrix factorization with side information","authors":"S Park, Y Kim, S Choi","year":"2013","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/237"},{"position":18,"raw":"K. Pearson. On lines and planes of closest fit to systems of points in space. Philosophical Magazine, 1901.","title":"On lines and planes of closest fit to systems of points in space","authors":"K Pearson","year":"1901","venue":"Philosophical Magazine","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Recht et al., 2010] B. Recht, M. Fazel, and P. Parrilo. Guar- anteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3):471- 501, 2010.","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","authors":"B Recht, M Fazel, P Parrilo","year":"2010","venue":"SIAM Review","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Salakhutdinov and Mnih, 2008] R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In Proceed- ings of NIPS, pages 1-8, 2008.","title":"Probabilistic matrix factorization","authors":"R Salakhutdinov, A Mnih","year":"2008","venue":"Proceedings of NIPS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Shen and Wu, 2012] X. Shen and Y. Wu. A unified ap- proach to salient object detection via low rank matrix re- covery. In Proceedings of CVPR, pages 853-860, 2012.","title":"A unified approach to salient object detection via low rank matrix recovery","authors":"Wu Shen, X Shen, Y Wu","year":"2012","venue":"Proceedings of CVPR","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Shi et al., 2013] J. Shi, N. Wang, Y. Xia, D. Yeung, I. King, and J. Jia. SCMF: Spase covariance matrix factorization for collaborative filtering. In Proceedings of IJCAI, 2013.","title":"SCMF: Spase covariance matrix factorization for collaborative filtering","authors":"J Shi, N Wang, Y Xia, D Yeung, I King, J Jia","year":"2013","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wang and Zhang, 2012] S. Wang and Z. Zhang. Coloriza- tion by matrix completion. In Proceedings of AAAI, pages 1169-1174, 2012.","title":"Colorization by matrix completion","authors":"S Wang, Z Zhang","year":"2012","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Wang et al., 2012] N. Wang, T. Yao, J. Wang, and D. Yeung. A probabilistic approach to robust matrix factorization. In Proceedings of ECCV, pages 126-139, 2012.","title":"A probabilistic approach to robust matrix factorization","authors":"N Wang, T Yao, J Wang, D Yeung","year":"2012","venue":"Proceedings of ECCV","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Xu et al., 2010] H. Xu, C. Caramanis, and S. Sanghavi. Principle component analysis with contaminated data: The high dimensional case. In Proceedings of COLT, 2010.","title":"Principle component analysis with contaminated data: The high dimensional case","authors":"H Xu, C Caramanis, S Sanghavi","year":"2010","venue":"Proceedings of COLT","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Zhang et al., 2012] Z. Zhang, A. Ganesh, X. Liang, and Y. Ma. TILT: Transform invariant low-rank textures. IJCV, 99(1):1-24, 2012.","title":"TILT: Transform invariant low-rank textures","authors":"Z Zhang, A Ganesh, X Liang, Y Ma","year":"2012","venue":"IJCV","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}