Convex sparse coding, subspace learning, and semi-supervised extensions

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 567-573

  Zhang, Xinhua ^a   Yu, Yaoliang ^a   White, Martha ^a   Huang, Ruitong ^a   Schuurmans, Dale ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED FEATURES; FEATURE DISCOVERY; FUNDAMENTAL PROBLEM; INPUT RECONSTRUCTION; OPTIMAL SOLUTIONS; OPTIMALITY; SEMI-SUPERVISED; SEMI-SUPERVISED LEARNING; SPARSE CODING; SUBSPACE LEARNING;

LEARNING ALGORITHMS; OPTIMAL SYSTEMS; OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

EID: 80055040894     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. Argyriou, A.; Evgeniou, T.; and Pontil, M. 2008. Convex multi-task feature learning. Mach. Learn. 73:243-272.
2. Bach, F.; Mairal, J.; and Ponce, J. 2008. Convex sparse matrix factorizations. arXiv:0812.1869v1.
3. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge U. Press.
4. Bradley, D., and Bagnell, J. 2008. Differentiable sparse coding. In NIPS 22.
5. Bradley, D., and Bagnell, J. 2009. Convex coding. In UAI.
6. Candes, E., and Recht, B. 2008. Exact matrix completion via convex optimization. Found. Comput. Math. 9:717-772.
7. Candes, E.; Li, X.; Ma, Y.; and Wright, J. 2009. Robust principal component analysis? arXiv:0912.3599.
8. Collins, M.; Dasgupta, S.; and Schapire, R. 2001. A generalization of principal component analysis to the exponential family. In NIPS.
9. Comon, P. 1994. Independent component analysis, a new concept? Signal Processing 36(3):287-314.
10. Elad, M., and Aharon, M. 2006. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. on Image Processing 15:3736-3745. (Pubitemid 44811686)
11. Goldberg, A.; Zhu, X.; Recht, B.; Xu, J.; and Nowak, R. 2010. Transduction with matrix completion: Three birds with one stone. In NIPS 23.
12. 2 models. In NIPS 15.
13. Hendrickx, J., and Olshevsky, A. 2010. Matrix p-norms are NP-hard to approximate if p ≠ 1,2, ∞. SIAM J. Matrix Anal.Appl. 31(5):2802-2812.
14. Hinton, G. 2007. Learning multiple layers of representations. Trends in Cognitive Sciences 11:428-434.
15. Horn, R., and Johnson, C. 1985. Matrix Analysis. Cambridge.
16. Jenatton, R.; Mairal, J.; Obozinski, G.; and Bach, F. 2010. Proximal methods for sparse hierarchical dictionary learning. In ICML.
17. Jia, Y.; Salzmann, M.; and Darrell, T. 2010. Factorized latent spaces with structured sparsity. In NIPS 23.
18. Lee, H.; Raina, R.; Teichman, A.; and Ng, A. 2009. Exponential family sparse coding with application to self-taught learning. In IJCAI.
19. Mairal, J.; Bach, F.; Ponce, J.; Sapiro, G.; and Zisserman, A. 2008. Supervised dictionary learning. In NIPS 21.
20. Nowozin, S., and Bakir, G. 2008. A decoupled approach to exemplar-based unsupervised learning. In ICML.
21. Olshausen, B., and Field, D. 1997. Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision Research 37:3311-3325. (Pubitemid 27493805)
22. Pataki, G. 1998. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2):339-358. (Pubitemid 128508667)
23. Pereira, F., and Gordon, G. 2006. The support vector decomposition machine. In ICML.
24. Raina, R.; Battle, A.; Lee, H.; Packer, B.; and Ng, A. 2007. Self-taught learning: Transfer learning from unlabeled data. In ICML.
25. Recht, B.; Fazel, M.; and Parrilo, P. 2007. Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Review 52(3):471-501.
26. Rish, I.; Grabarnik, G.; Cecchi, G.; Pereira, F.; and Gordon, G. 2007. Closed-form supervised dimensionality reduction with generalized linear models. In ICML.
27. Rockafellar, R. 1970. Convex Analysis. Princeton U. Press.
28. Salakhutdinov, R., and Srebro, N. 2010. Collaborative filtering in a non-uniform world: Learning with the weighted trace norm. In NIPS 23.
29. Srebro, N.; Rennie, J.; and Jaakkola, T. 2004. Maximum-margin matrix factorization. In NIPS 17.
30. Steinberg, D. 2005. Computation of matrix norms with applications to robust optimization. Master's thesis, Technion.
31. van der Maaten, L., and Hinton, G. 2008. Visualizing data using t-SNE. JMLR 9:2579-2605.
32. Weinberger, K., and Saul, L. 2006. Unsupervised learning of image manifolds by semidefinite programming. IJCV 70(1):77-90. (Pubitemid 43855868)
33. Xu, H.; Caramanis, C.; and Sanghavi, S. 2010. Robust PCA via outlier pursuit. In NIPS 23.
34. Zou, H.; Hastie, T.; and Tibshirani, R. 2006. Sparse principal component analysis. JCGS 15(2):262-286.