Online learning for group lasso

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 1191-1198

  Yang, Haiqin ^a   Xu, Zenglin ^b   King, Irwin ^a   Lyu, Michael R ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED FORM SOLUTIONS; FEATURE LEVEL; GROUP LEVEL; MEMORY COST; ON-LINE ALGORITHMS; ONLINE LEARNING; ONLINE LEARNING ALGORITHMS; ONLINE MODES; REAL-WORLD DATASETS; TIME COMPLEXITY; WEIGHT VECTOR;

E-LEARNING; LEARNING ALGORITHMS; LEARNING SYSTEMS;

GROUP TECHNOLOGY;

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

References (29)

1. Amit, Y., Shalev-Shwartz, S., and Singer, Y. Online classification for complex problems using simultaneous projections. In NIPS, pp. 17-24, 2006.
2. Bach, F. Consistency of the group lasso and multiple kernel learning. Journal of Machine Learning Research, 9: 1179-1225, 2008.
3. Balakrishnan, S. and Madigan, D. Algorithms for sparse linear classifiers in the massive data setting. Journal of Machine Learning Research, 9:313-337, 2008.
4. Bottou, L. and Bousquet, O. The tradeoffs of large scale learning. In NIPS, pp. 161-168, 2007.
5. Bottou, L. and LeCun, Y. Large scale online learning. In NIPS, 2003.
6. Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., and Singer, Y. Online passive-aggressive algorithms. Journal of Machine Learning Research, 7:551-585, 2006.
7. Dredze, M., Crammer, K., and Pereira, F. Confidence- weighted linear classification. In ICML, pp. 264-271, 2008.
8. Duchi, J. and Singer, Y. Efficient learning using forward- backward splitting. In NIPS, pp. 495-503, 2009.
9. Fink, M., Shalev-Shwartz, S., Singer, Y., and Ullman, S. Online multiclass learning by interclass hypothesis sharing. In ICML, pp. 313-320, 2006.
10. Friedman, J., Hastie, T., and Tibshirani, R. A note on the group lasso and a sparse group lasso, 2010.
11. Hazan, E., Agarwal, A., and Kale, S. Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2-3): 169-192, 2007.
12. Hu, C, Kwok, J., and Pan, W. Accelerated gradient methods for stochastic optimization and online learning. In NIPS, pp. 781-789, 2009.
13. Jacob, L., Obozinski, G., and Vert, J. Group lasso with overlap and graph lasso. In ICML, pp. 55, 2009.
14. Kowalski, M., Szafranski, M., and Ralaivola, L. Multiple indefinite kernel learning with mixed norm regularization. In ICML, 2009.
15. Langford, J., Li, L., and Zhang, T. Sparse online learning via truncated gradient. Journal of Machine Learning Research, 10:777-801, 2009.
16. Liu, J., Ji, S., and Ye, J. Multi-task feature learning via efficient norm minimization. In UAI, 2009.
17. Meier, L., van de Geer, S., and Bühlmann, P. The group lasso for logistic regression. Journal of the Royal Statistical Society, Series B, 70(1):53-71, 2008.
18. Nesterov, Y. Primal-dual subgradient methods for convex problems. Mathematical Programming, 120(1):221- 259, 2009.
19. 1∞ regularization. In ICML, pp. 108, 2009.
20. Roth, V. and Fischer, B. The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms. In ICML, pp. 848-855, 2008.
21. Shalev-Shwartz, S. and Singer, Y. Online learning meets optimization in the dual. In COLT, pp. 423-437, 2006.
22. Shalev-Shwartz, S. and Srebro, N. SVM optimization: inverse dependence on training set size. In ICML, pp. 928- 935, 2008.
23. Tibshirani, R. Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. Ser. B, 58(1):267-288, 1996.
24. Xiao, L. Dual averaging method for regularized stochastic learning and online optimization. In NIPS, pp. 2116- 2124, 2009a.
25. Xiao, L. Dual averaging method for regularized stochastic learning and online optimization. Technical Report MSR-TR-2009-100, Microsoft Research, 2009b.
26. Yeo, G. W. and Bürge, C. B. Maximum entropy modeling of short sequence motifs with applications to rna splicing signals. Journal of Computational Biology, 11(2/3):377- 394, 2004.
27. Yuan, M. and Lin, Y. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B, 68(1):49-67, 2006.
28. Zhao, P., Hoi, S. C., and Jin, R. Duol: A double updating approach for online learning. In NIPS, pp. 2259-2267, 2009.
29. Zinkevich, M. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pp. 928-936, 2003.