Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Proximal riemannian pursuit for large-scale trace-norm minimization|
Van Den Hengel, A.
|Citation:||Proceedings of the I29th IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2016), 2016 / vol.2016-December, pp.5877-5886|
|Series/Report no.:||IEEE Conference on Computer Vision and Pattern Recognition|
|Conference Name:||29th IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2016) (26 Jun 2016 - 01 Jul 2016 : Las Vegas, NV)|
|Mingkui Tan, Shijie Xiao, Junbin Gao, Dong Xu, Anton van den Hengel, Qinfeng Shi|
|Abstract:||Trace-norm regularization plays an important role in many areas such as computer vision and machine learning. When solving general large-scale trace-norm regularized problems, existing methods may be computationally expensive due to many high-dimensional truncated singular value decompositions (SVDs) or the unawareness of matrix ranks. In this paper, we propose a proximal Riemannian pursuit (PRP) paradigm which addresses a sequence of trace-norm regularized subproblems defined on nonlinear matrix varieties. To address the subproblem, we extend the proximal gradient method on vector space to nonlinear matrix varieties, in which the SVDs of intermediate solutions are maintained by cheap low-rank QR decompositions, therefore making the proposed method more scalable. Empirical studies on several tasks, such as matrix completion and low-rank representation based subspace clustering, demonstrate the competitive performance of the proposed paradigms over existing methods.|
|Rights:||© 2016 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
|RA_hdl_105570.pdf||Restricted Access||278.5 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.