Active subspace: Toward scalable low-rank learning

Neural Computation

Volumn 24, Issue 12, 2012, Pages 3371-3394

  Liu, Guangcan ^a   Yan, Shuicheng ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84874199238     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00369     Document Type: Article

References (32)

1. Bach, F. (2008). Consistency of trace norm minimization. Journal of Machine Learning Research, 9, 1019-1048.
2. Burer, S.,& Monteiro, R. (2005). Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103, 427-444.
3. Cai, J., Candés, E., & Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956-1982.
4. Cai, J., & Osher, S. (2010). Fast singular value thresholding without singular value decomposition (UCLA Tech. Rep.). Los Angeles: University of California, Los Angeles.
5. Candès, E., Li, X., Ma, Y., & Wright, J. (2009). Robust principal component analysis? Journal of the ACM, 58(3), 1-37.
6. Cand̀es, E., & Plan, Y. (2010). Matrix completion with noise. IEEE Proceedings, 98, 925-936.
7. Candès, E., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717-772.
8. Chandrasekaran, V., Sanghavi, S., Parrilo, P., & Willsky, A. (2009). Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization, 21(2), 572-596.
9. Edelman, A., Arias, T., & Smith, S. (1999). The geometry of algorithms with orthogonality constraints. SIAM Journal onMatrix Analysis and Applications, 20, 303-353.
10. Fazel, M. (2002). Matrix rank minimization with applications. Unpublished doctoral dissertation, Stanford University.
11. Halko, N., Martinsson, P., & Tropp, J. (2011). Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2), 217-288.
12. Higham, N. (1995). Matrix procrustes problems (Tech. Rep.). Manchester: Department of Mathematics, Manchester University.
13. Jaggi, M., & Sulovský, M. (2010). A simple algorithm for nuclear norm regularized problems. In Proceedings of the Twelfth International Conference onMachine Learning (pp. 471-478). Madison,WI: Omnipress.
14. Lee, K. C., Ho, J., & Kriegman, D. (2005). Acquiring linear subspaces for face recognition under variable lighting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(5), 684-698.
15. Lin, Z., Chen, M., Wu, L., & Ma, Y. (2009). The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices (Tech. Rep., UILU-ENG-09-2215). Champaign: Department of Electrical and Computer Engineering, University of Illinois.
16. Lin, Z., Liu,R.,& Su, Z. (2011). Linearized alternating direction method with adaptive penalty for low-rank representation. In J. Shawe-Taylor, R. S. Zemel, P. Bartlett, F.C.N. Pereira,& K.Q.Weinberger (Eds.), Advances in neural information processing systems, 24 (pp. 612-620). Red Hook, NY: Curran.
17. Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2012). Robust recovery of subspace structures by low-rank representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 99, 28-42.
18. Liu, G., Lin, Z., & Yu, Y. (2010). Robust subspace segmentation by low-rank representation. In Proceedings of the 27th International Conference on Machine Learning (pp. 663-670). Madison,WI: Omnipress.
19. Min, K., Zhang, Z.,Wright, J., & Ma, Y. (2010). Decomposing background topics from keywords by principal component pursuit. In Proceedings of the 28th Conference on Information and Knowledge Management (pp. 269-278). New York: ACM.
20. Nocedal, J., & Wright, S. (2006). Numerical optimization. Berlin: Springer-Verlag
21. Shalev-Shwartz, S., Gonen, A.,& Shamir,O. (2011). Large-scale convex minimization with a low-rank constraint. In Proceedings of the 28th International Conference on Machine Learning (pp. 329-336). Madison, WI: Omnipress.
22. Shen, Y., Wen, Z., & Zhang, Y. (2011). Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization (Tech. Rep.). Houston, TX: Department of Computational and Applied Mathematics, Rice University.
23. Srebro,N., Alon,N.,& Jaakkola, T. (2005). Generalization error bounds for collaborative prediction with low-rank matrices. In L. K. Saul, Y.Weiss, & L. Bottou (Eds.), Advances in Neural Information Processing Systems, 17 (pp. 5-27). Cambridge, MA: MIT Press.
24. Tomioka, R., Suzuki, T., Sugiyama, M., & Kashima, H. (2010). A fast augmented Lagrangian algorithm for learning low-rank matrices. In Proceedings of the 27th International Conference on Machine Learning (pp. 1087-1094). Madison, WI: Omnipress.
25. Tseng, P. (2008). On accelerated proximal gradient methods for convex-concave optimization. Manuscript submitted for publication.
26. Weimer, M., Karatzoglou, A., Le, Q., & Smola, A. (2007). Cofi rank: Maximum margin matrix factorization for collaborative ranking. In J. C. Platt, D. Köller, Y. Singer, & S. T. Roweis (Eds.), Advances in Neural Information Processing Systems, 20. Cambridge, MA: MIT Press.
27. Williams, C., & Seeger, M. (2000). The effect of the input density distribution on kernel-based classifiers. In Proceedings of the 17th International Conference on Machine Learning (pp. 1159-1166). San Francisco: Morgan Kaufmann.
28. Wright, J., Ganesh, A., Rao, S., Peng, Y., & Ma, Y. (2009). Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In Y. Bengio, D. Schuurmans, J. D. Lafferty, C.K.I. Williams, & A. Culotta (Eds.), Advances in neural information processing systems, 22 (pp. 2080-2088). Red Hook, NY: Curran.
29. Yang, J., & Yuan, X. (forthcoming). An inexact alternating direction method for trace norm regularized least squares problem. Mathematics of Computation.
30. Zhang, Y. (2010). Recent advances in alternating direction methods: Practice and theory (tutorial).Houston, TX: Department of Computational and Applied Mathematics, Rice University.
31. Zhang, Z., Liang, X., Ganesh, A.,& Ma, Y. (2012). TILT: Transform invariant low-rank textures. International Journal of Computer Vision, 99(1), 314-328.
32. Zhu, G., Yan, S.,& Ma, Y. (2010). Image tag refinement towards low-rank, content-tag prior and error sparsity. In Proceedings of the 18th ACM Conference on Multimedia. New York: ACM.