Online group-structured dictionary learning

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2011, Pages 2865-2872

  Szabó, Zoltán ^a   Póczos, Barnabás ^b   Lorincz, András ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

E-LEARNING; FACTORIZATION; PATTERN RECOGNITION;

DICTIONARY LEARNING; GROUP SPARSITIES; NUMERICAL EXPERIMENTS; OVERLAPPING GROUPS; SPARSE NON-NEGATIVE MATRIX FACTORIZATIONS; STRUCTURED DICTIONARY LEARNING; STRUCTURED SPARSITIES;

PROBLEM SOLVING;

EID: 80052890623     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995712     Document Type: Conference Paper

References (36)

1. M. Aharon, M. Elad, and A. Bruckstein. K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process., 54(11), 2006.
2. A. Argyriou, T. Evgeniou, and M. Pontil. Convex multi-task feature learning. Mach. Learn., 73(3):243-272, 2008.
3. L. Balzano, R. Nowak, and B. Recht. Online identification and tracking of subspaces from highly incomplete information. In 48th Annual Allerton Conference, 2010.
4. S. Bengio, F. Pereira, Y. Singer, and D. Strelow. Group sparse coding. In NIPS 2009, pages 82-89.
5. D. P. Bertsekas. Nonlinear Programming. Athena Scientific Belmont, 1999.
6. P. L. Combettes and J.-C. Pesquet. Fixed-Point Algorithms for Inverse Problems in Science and Engineering, chapter Proximal splitting methods in signal processing. Springer, 2010.
7. 1 -ball for learning in high dimensions. In ICML 2008, pages 272-279.
8. P. Hoyer. Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res., 5:1457-1469, 2004.
9. J. Huang and T. Zhang. The benefit of group sparsity. Ann. Stat., 38(4):1978-2004, 2010.
10. A. Hyvärinen, J. Karhunen, and E. Oja. Independent Component Analysis. John Wiley & Sons, 2001.
11. L. Jacob, G. Obozinski, and J.-P. Vert. Group Lasso with overlap and graph Lasso. In ICML 2009, pages 433-440.
12. R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In ICML 2010, pages 487-494.
13. R. Jenatton, G. Obozinski, and F. Bach. Structured sparse principal component analysis. J. Mach. Learn. Res.: W&CP, 9:366-373.
14. K. Kavukcuoglu, M. Ranzato, R. Fergus, and Y. LeCun. Learning invariant features through topographic filter maps. In CVPR 2009, pages 1605-1612.
15. S. Kim and E. P. Xing. Tree-guided group Lasso for multitask regression with structured sparsity. In ICML 2010, pages 543-550.
16. C. L. Lawson and R. J. Hanson. Solving Least Squares Problems. Prentice-Hall, 1974.
17. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS 2000, pages 556-562.
18. J. Liu and J. Ye. Moreau-Yosida regularization for grouped tree structure learning. In NIPS 2010.
19. J. Mairal, R. Jenatton, G. Obozinski, and F. Bach. Network flow algorithms for structured sparsity. In NIPS 2010.
20. J. Marial, F. Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res., 11:10-60, 2010.
21. S. Mosci, L. Rosasco, M. Santoro, A. Verri, and S. Villa. Solving structured sparsity regularization with proximal methods. In ECML 2010, pages 418-433.
22. G. Obozinski, B. Taskar, and M. I. Jordan. Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput., 20:231-252, 2010.
23. B. A. Olshausen and D. J. Field. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381:607-609, 1996.
24. L. Rosasco, S. Mosci, S. Villa, and A. Verri. A primal-dual algorithm for group sparse regularization with overlapping groups. In NIPS 2010.
25. K. Rosenblum, L. Zelnik-Manor, and Y. Eldar. Dictionary optimization for block-sparse representations. In AAAI Fall 2010 Symposium on Manifold Learning.
26. M. Schmidt and K. Murphy. Convex structure learning in log-linear models: Beyond pairwise potentials. J. Mach. Learn. Res.: W&CP, 9:709-716, 2010.
27. B. Szatmáry, B. Póczos, J. Eggert, E. Körner, and A. Lorincz. Non-negative matrix factorization extended by sparse code shrinkage and by weight sparsification. In ECAI 2002, pages 503-507.
28. R. Tibshirani. Regression shrinkage and selection via the Lasso. J. Roy. Stat. Soc. B. Met., 58(1):267-288, 1996.
29. J. A. Tropp and S. J. Wright. Computational methods for sparse solution of linear inverse problems. Proc. of the IEEE special issue on Applications of sparse representation and compressive sensing, 98(6):948-958, 2010.
30. E. van den Berg, M. Schmidt, M. P. Friedlander, and K. Murphy. Group sparsity via linear-time projection. Technical report, 2008.
31. D. M. Witten, R. Tibshirani, and T. Hastie. A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics, 10(3):515-534, 2009.
32. M. Yaghoobi, T. Blumensath, and M. Davies. Dictionary learning for sparse approximations with the majorization method. IEEE Trans. Signal Process., 57(6):2178-2191, 2009.
33. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc. B Met., 68, 2006.
34. P. Zhao, G. Rocha, and B. Yu. The composite absolute penalties family for grouped and hierarchical variable selection. Ann. Stat., 37(6A):3468-3497, 2009.
35. M. Zhou, H. Chen, J. Paisley, L. Ren, G. Sapiro, and L. Carin. Non-parametric Bayesian dictionary learning for sparse image representations. In NIPS 2009, pages 2295-2303.
36. H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. J. Comput. Graph. Stat., 15(2):265-286, 2006.