Convex coding

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 83-90

  Bradley, David M ^a   Bagnell, J Andrew ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CODES (SYMBOLS); IMAGE DENOISING; RELAXATION PROCESSES;

ALTERNATING OPTIMIZATIONS; CODING ALGORITHMS; CONVEX RELAXATION; DATA VECTORS; LOCAL MINIMA PROBLEMS; MASTER PROBLEMS; SPARSE APPROXIMATIONS; SPARSE CODING;

IMAGE CODING;

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

References (26)

1. Bach, F., Mairal, J., & Ponce, J. (2008). Convex sparse matrix factoriza-tions. CoRR, abs/0812.1869.
2. Bengio, Y., Le Roux, N., Vincent, P., Delalleau, O., & Marcotte, P. (2006). Convex neural networks. Advances in Neural Information Processing Systems, 18, 123.
3. Borwein, J. M., & Lewis, A. S. (2006). Convex analysis and nonlinear optimization: Theory and examples. Birkhuser. 2 edition.
4. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
5. Bradley, D. M., & Bagnell, J. A. (2009a). Convex coding (Technical Report CMU-RI-TR-09-22). Robotics Institute, Pittsburgh, PA.
6. Bradley, D. M., & Bagnell, J. A. (2009b). Difierentiable sparse coding. Neural Information Processing Systems 22.
7. Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge University Press.
8. Ding, C., He, X., & Simon, H. (2005). On the equivalence of nonnegative matrix factorization and spectral clustering. Proceedings of the SIAM Data Mining Conference.
9. Elad, M., & Aharon, M. (2006). Image denoising via learned dictionaries and sparse representation. CVPR '06: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 895-900). Washington, DC, USA: IEEE Computer Society. (Pubitemid 44931418)
10. Friedman, J. (2001). Greedy function approximation: a gradient boosting machine. Annals of Statistics, 29, 1189-1232. (Pubitemid 33405972)
11. Karklin, Y., & Lewicki, M. S. (2005). A hierarchical bayesian model for learning non-linear statistical regularities in non-stationary natural signals. Neural Computation, 17, 397-423. (Pubitemid 40190481)
12. Lashkari, D., & Golland, P. (2008). Convex clustering with exemplar- based models. Advances in Neural Information Processing Systems 20 (pp. 825-832). Cambridge, MA: MIT Press.
13. Lee, H., Battle, A., Raina, R., & Ng, A. Y. (2007). Effcient sparse coding algorithms. Advances in Neural Information Processing Systems 19. Cambridge, MA: MIT Press.
14. Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2009). Super- vised dictionary learning. In D. Koller, D. Schuurmans, Y. Bengio and L. Bottou (Eds.), Advances in neural information processing systems 21.
15. Mairal, J., Sapiro, G., & Elad, M. (2008). Learning multiscale sparse representations for image and video restoration. Multiscale Modeling & Simulation, 7, 214-241.
16. Mason, L., Baxter, J., Bartlett, P., & Frean, M. (2000). Boosting algorithms as gradient descent. In Advances in Neural Information Processing Systems 12 (pp. 512-518).
17. Nowozin, S., & Bakir, G. (2008). A decoupled approach to exemplar-based unsupervised learning. ICML '08: Proceedings of the 25th international conference on Machine learning (pp. 704-711). New York, NY, USA: ACM.
18. Obozinski, G., Taskar, B., & Jordan, M. (2006). Multi-task feature selection. ICML-06 Workshop on Structural Knowledge Transfer for Machine Learning.
19. Olshausen, B., & Field, D. (1997). Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision Research.
20. Raina, R., Battle, A., Lee, H., Packer, B., & Ng, A. Y. (2007). Self-taught learning: Transfer learning from unlabeled data. ICML '07: Proceedings of the 24th international conference on Machine learning.
21. Rifkin, R., & Lippert, R. (2007). Value regularization and fenchel duality. The Journal of Machine Learning Research, 8, 441-479. (Pubitemid 46434119)
22. Singh, A. P., & Gordon, G. J. (2008). A unified view of matrix factorization models. Machine Learning and Knowledge Discovery in Databases, European Conference (ECML/PKDD). ECML/PKDD-2008.
23. Tropp, J. A. (2006). Algorithms for simultaneous sparse approximation: part ii: Convex relaxation. Signal Process., 86, 589-602. (Pubitemid 43106573)
24. Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006). Algorithms for simultaneous sparse approximation: part i: Greedy pursuit. Signal Process., 86, 572-588. (Pubitemid 43106572)
25. Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009). Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell., 31, 210-227.
26. Zinkevich, M. (2003). Online convex programming and generalized in-finitesimal gradient ascent. Twentieth International Conference on Machine Learning.