An efficient projection for l1,∞ regularization

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 857-864

  Quattoni, Ariadna ^a,b   Carreras, Xavier ^a   Collins, Michael ^a   Darrell, Trevor ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE ANNOTATION; PROJECTED GRADIENT; SPARSE SOLUTIONS;

GRADIENT METHODS; IMAGE ANALYSIS;

ROBOT LEARNING;

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

References (21)

1. Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., & Roth, D. (2005). Generalization bounds for the area under the roc curve. Journal of Machine Learning Research, 6, 393-425.
2. Argyriou, A., Evgeniou, T., & Pontil, M. (2007). Multi-task feature learning. Advances in Neural Information Processing Systems 19 (pp. 41-48).
3. Bertsekas, D. (1999). Nonlinear programming. Athena Scientific.
4. Donoho, D. (2004). For most large underdetermined systems of linear equations the minimal 11-norm solution is also the sparsest solution. (Technical Report). Statistics Dept., Stanford University.
5. Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008). Efficient projections onto the 11-ball for learning in high dimensions. Proc. of Intl. Conf. on Machine Learning (pp. 272-279).
6. Grauman, K., & Darreil, T. (2008). The pyramid match kernel: Efficient learning with sets of features. Journal of Machine Learning Research, 8, 725-760.
7. Lee, S. I., Ganapathi, V., & Koller, D. (2007). Efficient structure learning of markov networks using 11-regularization. Advances in Neural Information Processing Systems 19 (pp. 817-824).
8. Meier, L., van de Geer, S., & Buhlmann, P. (2006). The group lasso for logistic regression (Technical Report). ETH Seminar fur Statistik.
9. Ng, A. Y. (2004). Feature selection, 11 vs. 12 regu-larization, and rotational invariance. Proc. of Intl. Conf. on Machine Learning.
10. Nister, D., & Stewenius, H. (2006). Scalable recognition with a vocabulary tree. Proc. of Conf. on Computer Vision and Pattern Recognition.
11. Obozinski, G., Taskar, B., & Jordan, M. (2006). Multitask feature selection (Technical Report). Statistics Dept., University of California, Berkeley.
12. Park, M. Y., & Hastie, T. (2006). Regularization path algorithms for detecting gene interactions (Technical Report). Stanford University.
13. Quattoni, A., Collins, M., & Darreil, T. (2008). Transfer learning for image classification with sparse prototype representations. Proc. of Conf. on Computer Vision and Pattern Recognition.
14. Schmidt, M., Murphy, K., Fung, G., & Rosale, R. (2008). Structure learning in random fields for heart motion abnormality detection. Proc. of Conf. on Computer Vision and Pattern Recognition.
15. Schmidt, M., van den Berg, E., Friedlander, M., & Murphy, K. (2009). Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm. Proc. of Conf. on Artificial Intelligence and Statistics (pp. 456-463).
16. Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007). Pegasos: Primal Estimated sub-GrAdient SOlver for SVM. Proc. of Intl. Conf. on Machine Learning (pp. 807-814).
17. Similä, T., & Tikka, J. (2007). Input selection and shrinkage in multiresponse linear regression. Computational Statistics and Data Analysis, 52, 406-422.
18. Tropp, J. (2006). Algorithms for simultaneous sparse approximation, part ii: convex relaxation. Signal Processing (pp. 589-602).
19. Turlach, B., Venables, W., & Wright, S. (2005). Simultaneous variable selection. Technometrics, 47, 349-363.
20. Yuan, M., & Lin, Y. (2006). Model selection and estimation in regression with grouped variables. J. Royal Statistical Society Series B, 68, 49-67.
21. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. Proc. of Intl. Conf. on Machine Learning (pp. 928-936).