Efficient multi-task feature learning with calibration

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2014, Pages 761-770

  Gong, Pinghua ^a   Zhou, Jiayu ^a   Fan, Wei ^b   Ye, Jieping ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

^b HUAWEI NOAH S ARK LAB   (China)

Author keywords

accelerated gradient descent; calibration; dual problem; feature selection; multi task learning

Indexed keywords

EID: 84907020149     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623641     Document Type: Conference Paper

References (38)

1. A. Argyriou, T. Evgeniou, and M. Pontil. Convex multi-task feature learning. Machine Learning, 73(3):243-272, 2008.
2. F. Bach, R. Jenatton, J. Mairal, and G. Obozinski. Optimization with sparsity-inducing penalties. Foundations and Trends® in Machine Learning, 4(1):1-106, 2011.
3. J. Barzilai and J. Borwein. Two-point step size gradient methods. IMA Journal of Numerical Analysis, 8(1):141-148, 1988.
4. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1):183-202, 2009.
5. A. Beck and M. Teboulle. A fast dual proximal gradient algorithm for convex minimization and applications. Operations Research Letters, 42(1):1-6, 2014.
6. A. Belloni, V. Chernozhukov, and L. Wang. Square-root lasso: pivotal recovery of sparse signals via conic programming. Biometrika, 98(4):791-806, 2011.
7. D. Bertsekas. Nonlinear Programming. Athena Scientific, 1999.
8. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends® in Machine Learning, 3(1):1-122, 2011.
9. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge university press, 2004.
10. S. Boyd, L. Xiao, and A. Mutapcic. Subgradient methods. Lecture notes of EE392o, Stanford University , 2003.
11. F. Bunea, J. Lederer, and Y. She. The group square-root lasso: Theoretical properties and fast algorithms. arXiv preprint arXiv:1302.0261, 2013.
12. P. Gong, K. Gai, and C. Zhang. Efficient euclidean projections via piecewise root finding and its application in gradient projection. Neurocomputing, 74(17):2754-2766, 2011.
13. P. Gong, J. Ye, and C. Zhang. Multi-stage multi-task feature learning. In NIPS, pages 1997-2005, 2012.
14. P. Gong, J. Ye, and C. Zhang. Robust multi-task feature learning. In SIGKDD , pages 895-903, 2012.
15. P. Gong, J. Ye, and C. Zhang. Multi-stage multi-task feature learning. Journal of Machine Learning Research, 14(1):2979-3010, 2013.
16. A. Jalali, P. Ravikumar, S. Sanghavi, and C. Ruan. A dirty model for multi-task learning. NIPS, 2010.
17. S. Ji, L. Sun, R. Jin, S. Kumar, and J. Ye. Automated annotation of drosophila gene expression patterns using a controlled vocabulary. Bioinformatics, 24(17):1881-1888, 2008.
18. S. Kim and E. Xing. Tree-guided group lasso for multi-task regression with structured sparsity. In ICML, 2009.
19. M. Kolar, J. Lafferty, and L. Wasserman. Union support recovery in multi-task learning. Journal of Machine Learning Research, 12:2415-2435, 2011.
20. C. Lemaréchal, A. Nemirovskii, and Y. Nesterov. New variants of bundle methods. Mathematical Programming, 69(1):111-147, 1995.
21. H. Liu, M. Palatucci, and J. Zhang. Blockwise coordinate descent procedures for the multi-task lasso with applications to neural semantic basis discovery. In ICML, pages 649-656, 2009.
22. H. Liu, L. Wang, and T. Zhao. Multivariate regression with calibration. arXiv preprint arXiv:1305.2238, 2013.
23. 2,1-norm minimization. In UAI, 2009.
24. J. Liu, S. Ji, and J. Ye. Slep: Sparse learning with efficient projections. Arizona State University , 2009.
25. K. Lounici, M. Pontil, A. Tsybakov, and S. Van De Geer. Taking advantage of sparsity in multi-task learning. In COLT, 2009.
26. K. Lounici, M. Pontil, S. Van De Geer, and A. Tsybakov. Oracle inequalities and optimal inference under group sparsity. The Annals of Statistics , 39(4):2164-2204, 2011.
27. Y. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming , 103(1):127-152, 2005.
28. 2,1-norms minimization. In NIPS, pages 1813-1821, 2010.
29. G. Obozinski, B. Taskar, and M. Jordan. Multi-task feature selection. Statistics Department, UC Berkeley, Tech. Rep, 2006.
30. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1997.
31. R. T. Rockafellar and R. Wets. Variational Analysis. Springer, 1998.
32. S. Wright, R. Nowak, and M. Figueiredo. Sparse reconstruction by separable approximation. IEEE Transactions on Signal Processing, 57(7):2479-2493, 2009.
33. X. Yang, S. Kim, and E. Xing. Heterogeneous multitask learning with joint sparsity constraints. In NIPS, 2009.
34. Y. Zhang, D. Yeung, and Q. Xu. Probabilistic multi-task feature selection. In NIPS, 2010.
35. J. Zhou, J. Chen, and J. Ye. MALSAR: Multi-tAsk Learning via StructurAl Regularization. Arizona State University, 2011.
36. J. Zhou, J. Liu, V. Narayan, and J. Ye. Modeling disease progression via fused sparse group lasso. In SIGKDD, pages 1095-1103, 2012.
37. J. Zhou, L. Yuan, J. Liu, and J. Ye. A multi-task learning formulation for predicting disease progression. In SIGKDD, pages 814-822, 2011.
38. H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301-320, 2005.