Elastic net regularized logistic regression using cubic majorization

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2014, Pages 3446-3451

  Nilsson, Mikael ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

CUBIC FUNCTION; ELASTIC NET; LARGE-SCALE LEARNING PROBLEM; LINE SEARCHES; OBJECTIVE FUNCTIONS; STATE OF THE ART;

LOGISTIC REGRESSION;

EID: 84919934120     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2014.593     Document Type: Conference Paper

References (26)

1. J. Shi, W. Yin, S. Osher, and P. Sajda, "A fast hybrid algorithm for large-scale l1-regularized logistic regression," J. Mach. Learn. Res., vol. 11, pp. 713-741, Mar. 2010. [Online]. Available: http://dl. Acm. org/citation. cfm?id=1756006. 1756029
2. R. Tibshirani, "Regression shrinkage and selection via the lasso," Journal of the Royal Statistical Society, Series B, vol. 58, pp. 267-288, 1994.
3. A. Y. Ng, "Feature selection, l1 vs. l2 regularization, and rotational invariance," in Proceedings of the Twenty-first International Conference on Machine Learning, ser. ICML '04. New York, NY, USA: ACM, 2004, pp. pp. 78-85.
4. Y. Tsuruoka, J. Tsujii, and S. Ananiadou, "Stochastic gradient descent training for l1-regularized log-linear models with cumulative penalty," in Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP. Suntec, Singapore: Association for Computational Linguistics, August 2009, pp. 477-485. [Online]. Available: http://www. Aclweb. org/anthology/P/P09/P09-1054
5. L. Bottou and Y. Le Cun, "On-line learning for very large data sets," Appl. Stoch. Model. Bus. Ind., vol. 21, no. 2, pp. 137-151, Mar. 2005. Available: http://dx. doi. org/10. 1002/asmb. v21:2
6. L. Bottou and O. Bousquet, "The tradeoffs of large scale learning," in NIPS, 2007.
7. J. H. Friedman, T. Hastie, and R. Tibshirani, "Regularization paths for generalized linear models via coordinate descent," Journal of Statistical Software, vol. 33, no. 1, pp. 1-22, 2 2010. [Online]. Available: http://www. jstatsoft. org/v33/i01
8. G.-X. Yuan, C.-H. Ho, and C.-J. Lin, "An improved glmnet for l1-regularized logistic regression," in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD '11. New York, NY, USA: ACM, 2011, pp. 33-41.: http://doi. Acm. org/10. 1145/2020408. 2020421
9. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Annals of Statistics, vol. 32, pp. 407-499, 2004.
10. G. Andrew and J. Gao, "Scalable training of l1-regularized log-linear models," in Proceedings of the 24th international conference on Machine learning, ser. ICML '07. New York, NY, USA: ACM, 2007, pp. 33-40. [Online]. Available: http://doi. Acm. org/10. 1145/1273496. 1273501
11. S. in Lee, H. Lee, P. Abbeel, and A. Y. Ng, "Efficient l1 regularized logistic regression," in In AAAI-06, 2006.
12. K. Koh, S.-J. Kim, and S. Boyd, "An interior-point method for large-scale l1-regularized logistic regression," J. Mach. Learn. Res., vol. 8, pp. 1519-1555, Dec. 2007. [Online]. Available: http://dl. Acm. org/citation. cfm?id=1314498. 1314550
13. H. Zou and T. Hastie, "Regularization and variable selection via the elastic net," Journal of the Royal Statistical Society, Series B, vol. 67, pp. 301-320, 2005.
14. S. Shalev-Shwartz and A. Tewari, "Stochastic methods for l1-regularized loss minimization. " Journal of Machine Learning Research, vol. 12, pp. 1865-1892, 2011.
15. J. Langford, L. Li, and T. Zhang, "Sparse online learning via truncated gradient," J. Mach. Learn. Res., vol. 10, pp. 777-801, Jun. 2009. Available: http://dl. Acm. org/citation. cfm?id=1577069. 1577097
16. W. J. Fu, "Penalized regressions: The bridge versus the lasso," Journal of Computational and Graphical Statistics, vol. 7, no. 3, pp. pp. 397-416, 1998. [Online]. Available: http://www. jstor. org/stable/1390712
17. P. Tseng and C. O. L. Mangasarian, "Convergence of a block coordinate descent method for nondifferentiable minimization," J. Optim Theory Appl, pp. 475-494, 2001.
18. G.-X. Yuan, K.-W. Chang, C.-J. Hsieh, and C.-J. Lin, "A comparison of optimization methods and software for large-scale l1-regularized linear classification," J. Mach. Learn. Res., vol. 9999, pp. 3183-3234, December 2010. [Online]. Available: http://dl. Acm. org/citation. cfm?id= 1953011. 1953034
19. J. K. Bradley, A. Kyrola, D. Bickson, and C. Guestrin, "Parallel coordinate descent for l1-regularized loss minimization," in International Conference on Machine Learning (ICML 2011), Bellevue, Washington, June 2011.
20. D. R. Hunter, K. Lange, D. O. Biomathematics, and H. Genetics, "A tutorial on mm algorithms," Amer. Statist, pp. 30-37, 2004.
21. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2000.
22. J. D. Leeuw., "Quadratic and cubic majorization," Medium for Econometric Applications, pp. 14:44-49, 2006.
23. J. De Leeuw and W. J. Heiser, "Convergence of correction matrix algorithms for multidimensional scaling," Geometric representations of relational data, pp. 735-752, 1977.
24. M. Schmidt, G. Fung, and R. Rosales, "Fast optimization methods for l1 regularization: A comparative study and two new approaches," in Proceedings of the 18th European Conference on Machine Learning, ser. ECML '07. Berlin, Heidelberg: Springer-Verlag, 2007, pp. 286-297.
25. M. Zinkevich, M. Weimer, A. Smola, and L. Li, "Parallelized stochastic gradient descent," in Advances in Neural Information Processing Systems 23, J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Eds., 2010, pp. 2595-2603.
26. J. Eggermont, J. N. Kok, and W. A. Kosters, "Genetic programming for data classification: partitioning the search space," in SAC, 2004, p. 1001.