The Group-Lasso for generalized linear models: Uniqueness of solutions and efficient algorithms

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 848-855

  Roth, Volker ^a   Fischer, Bernd ^b  

^a UNIVERSITY OF BASEL   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS; ROBOT LEARNING; SOLUTIONS;

COMPUTATIONAL COSTS; EFFICIENT ALGORITHMS; EXCELLENT PERFORMANCES; GENERALIZED LINEAR MODELS; INPUT DIMENSIONS; LASSO METHODS; LEARNING PROBLEMS; NON UNIQUENESSES; SOLUTION PATHS; TEST PROCEDURES; TESTING PROCEDURES; UNIQUENESS OF SOLUTIONS; EXCELLENT PERFORMANCE; LARGE-SCALE LEARNING PROBLEMS; NON UNIQUENESS;

GROUP TECHNOLOGY;

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

References (15)

1. Brown, L. D. (1986). Fundamentals of Statistical exponential families: with applications in statistical decision theory. Hayworth, CA, USA: Institute of Mathematical Statistics.
2. Crooks, G., Hon, G., Chandonia, J., & Brenner, S. (2004). Weblogo: A sequence logo generator. Genome Research, 14.
3. Dahinden, C., Parmigiani, G., Emerick, M., & Bühlmann, P. (2007). Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries. BMC Bioinfonnatics, 8, 476.
4. Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004). Least angle regression. Ann. Stat., 32, 407-499.
5. Kim, Y., Kim, J., & Kim, Y. (2006). Blockwise sparse regression. Statistica Sinica, 16, 375-390.
6. McCullaghand, P., & Nelder, J. (1983). Generalized linear models. Chapman & Hall.
7. Meier, L., van de Geer, S., & Bühlmann, P. (2008). The Group Lasso for Logistic Regression. J. Roy. Stat. Soc. B, 70, 53-71.
8. Nilsson, R., Peña, J., Björkegren, J., & Tegnér, J. (2007). Consistent feature selection for pattern recognition in polynomial tune. JMLR, 8, 589-612.
9. Osborne, M., Presnell, B., & Turlach, B. (2000). On the LASSO and its dual. J. Comp. and Graphical Statistics, 9, 319-337.
10. Shevade, K., & Keerthi, S. (2003). A simple and efficient algorithm for gene selection using sparse logistic regression. Bioinformatics, 19, 2246-2253.
11. Tibshirani, R. (1996). Regression shrinkage and selection via the Lasso. J. Roy. Stat. Soc. B, 58, 267-288.
12. Wainwright, M., Jaakkola, T., & Willsky, A. (2005). A new class of upper bounds on the log partition function. IEEE Trans. Information Theory, 51.
13. Wedderburn, R. W. M. (1973). On the existence and uniqueness of the maximum likelihood estimates for certain generalized linear models. Biometrika, 63, 27-32.
14. Yeo, G., & Burge, C. (2004). Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals. J. Comp. Biology, 11, 377-394.
15. Yuan, M., & Lin, Y. (2006). Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc. B, 49-67.