Group Orthogonal Matching Pursuit for logistic regression

Journal of Machine Learning Research

Volumn 15, Issue , 2011, Pages 452-460

  Lozano, Aurélie C ^a   Świrszcz, Grzegorz ^a   Abe, Naoki ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC LIMITS; CONSISTENCY RESULT; EMPIRICAL EVALUATIONS; EXPLANATORY VARIABLES; GENERALIZED LINEAR MODEL; LINEAR REGRESSION MODELS; LOGISTIC REGRESSION MODELS; LOGISTIC REGRESSIONS; MATCHING PURSUIT; NON-ASYMPTOTIC; ORTHOGONAL MATCHING PURSUIT; PREDICTION ACCURACY; PREDICTIVE ACCURACY; REAL-WORLD PROBLEM; SAMPLE SIZES; SIMULATED DATASETS; SPLICE SITE; VARIABLE SELECTION;

ARTIFICIAL INTELLIGENCE; LOGISTICS;

REGRESSION ANALYSIS;

EID: 84862271984     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (28)

1. BACH, F.R., Consistency of the Group Lasso and Multiple Kernel Learning, J. Mach. Learn. Res., 9, 1179-1225, 2008.
2. BURGE, C. AND KARLIN, S., Prediction of complete gene structures in human genomic DNA., J. Molec. Biol., 268, 7894, 1997.
3. BURGE, C., Modeling dependencies in pre-mrna splicing signals. In Computational Methods in Molecular Biology (eds S. Salzberg, D. Searls and S. Kasif), ch. 8, pp. 129164. New York: Elsevier Science. 1998.
4. FLETCHER A., RANGAN S., Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis, in proc. NIPS'09, 2009.
5. FREUND. Y., SCHAPIRE, R. E., A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and system Sciences, Vol. 55(1), 119-139, 1997.
6. FRIEDMAN J., HASTIE T., TIBSHIRANI R., Additive Logistic Regression: a Statistical View of Boosting. Technical report, Department of Statistics, Stanford University, 1998.
7. HASTIE T., TIBSHIRANI R., FRIEDMAN J., The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer, 2003.
8. HUANG J., ZHANG T., METAXAS D., Learning with Structured Sparsity, in ICML'09, 2009.
9. KAKADE S., SHAMIR O., SRIDHARAN K., TEWARI S., Learning Exponential Families in High Dimensions: Strong Convexity and Sparsity, AISTATS 2010.
10. KIM Y., KIM J., KIM Y., Blockwise sparse regression, Statistica Sinica, 16, 375-390, 2006.
11. LOZANO A.C., SWIRSZCZ G., ABE N., Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction,in proc. NIPS'09, 2009.
12. MALLAT S., ZHANG Z., Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, 41, 3397-3415, 1993.
13. MASON L., BAXTER J., BARTLETT P., FREAN M., Boosting Algorithms as Gradient Descent, in Neural Information Processing Systems, Vol. 12, pp. 512518, 2000.
14. MEIER L., VAN DE GEER, S., BÜHLMANN P., The group lasso for logistic regression, J. Royal Statistical Society: Series B, 70(1), 53-71, 2008.
15. ROCHA G., WANG X., YU B., Asymptotic distribution and sparsistency for l1 penalized parametric Mestimators, with applications to linear SVM and logistic regression, Technical report, 2009
16. M. PERTEA, X. LIN, S. L. SALZBERG, GeneSplicer : a new computational method for splice site prediction Nucleic Acids Res, 29(5), 1185-90, 2001
17. QUINN, GERALD PETER, AND KEOUGH, MICHAEL, J. Experimental design and data analysis for biologists, Cambridge University Press, 2002
18. ROTH V., FISCHER B. The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms. In Proceedings of the 25th ICML conference (ICML'08), 307, 848-855, 2008.
19. SHALEV-SHWARTZ S., SREBRO N., ZHANG T., Trading Accuracy for Sparsity, Technical Report TTIC-TR-2009-3, May 2009.
20. TIBSHIRANI, R., Regression shrinkage and selection via the lasso, J. Royal. Statist. Soc B., 58(1), 267-288, 1996.
21. TROPP J.A., Greed is good: Algorithmic results for sparse approximation, IEEE Trans. Info. Theory, 50(10), 2231-2242, 2004.
22. VINCENT P., BENGIO Y., Kernel matching pursuit, Machine Learning, 48. 165-187, 2002.
23. YEO, G. W. AND BURGE, C. B., Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals. J. Computnl Biol., 11, 475494, 2004.
24. YUAN, M., LIN, Y., Model selection and estimation in regression with grouped variables, J. R. Statist. Soc. B, 68, 4967, 2006.
25. ZHANG, T., On the consistency of feature selection using greedy least squares regression, J. Machine Learning Research, 2008.
26. ZHANG, T., Sparse Recovery with Orthogonal Matching Pursuit under RIP, Tech Report arXiv:1005.2249, 2010.
27. ZHAO, P, ROCHA, G. AND YU, B., Grouped and hierarchical model selection through composite absolute penalties, Manuscript, 2006.
28. ZOU, H., HASTIE T., Regularization and variable selection via the Elastic Net., J. R. Statist. Soc. B, 67(2) 301-320, 2005.