Large-scale elastic net regularized linear classification SVMs and logistic regression

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 949-954

  Balamurugan, P ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84894667611     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.126     Document Type: Conference Paper

References (20)

1. H. Attouch, J. Bolte, P. Redont and A. Soubeyran. Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's. JCA 15 (3), 485-506. 2008.
2. P. Balamurugan, S. Shevade and T. Ravindra Babu. Sequential Alternating Proximal Method for Scalable Sparse Structural SVMs. ICDM, 2012.
3. A. Beck and L. Tetruashvili. On the convergence of block coordinate descent type methods. Mathematical Programming, 2013. Submitted for publication.
4. B. E. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory. ACM Press, 1992, pp. 144-152.
5. R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X-R. Wang and CJ. Lin. LIBLINEAR: A Library for Large Linear Classification. JMLR, vol. 9, pp. 1871-1874, 2008.
6. C.-J. Hsieh, K.-W. Chang, C.-J. Lin, S. S. Keerthi, and S. Sundararajan. A dual coordinate descent method for large-scale linear SVM. ICML, 2008.
7. Z. Hussain and J. Shawe-Taylor. Metric learning analysis. PinView FP7-216529 Project Deliverable Report D3.3, 2011.
8. T. Joachims. Training linear SVMs in linear time. ACM SIGKDD, 2006.
9. M-J. Lai and W. Yin. Augmented L1 and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm. CoRR abs/1201.4615, 2012.
10. T. Lavergne, O. Cappé and F. Yvon. Practical Very Large CRFs. Proceedings of the ACL, pages 504-513, 2010.
11. Z.-Q. Luo and P. Tseng. On the convergence of coordinate descent method for convex differentiable minimization. JOTA, vol. 72, no. 1, pp. 7-35, 1992.
12. R. Tomioka, T. Suzuki, and M. Sugiyama. Super-Linear Convergence of Dual Augmented Lagrangian Algorithm for Sparse Learning. arXiv:0911.4046, 2009. Software available at http://www.ibis.t.u-tokyo.ac.jp/ryotat/dal/dal ver1.05.tar.gz
13. L. Wang, J. Zhu, and H. Zou. The Doubly Regularized Support Vector Machine. Statistica Sinica, 16(2), 589-616, 2006.
14. L. Wang, J. Zhu, and H. Zou. Hybrid Huberized support vector machines for microarray classification. ICML, 2007.
15. G-B. Ye, Y. Chen and X. Xie. Efficient variable selection in support vector machines via the alternating direction method of multipliers. AISTATS, 2011.
16. W. Yin. Analysis and Generalizations of the Linearized Bregman Method. SIAM Journal of Imaging Sciences, Vol. 3, No. 4, pp. 856-877. 2010.
17. H.-F. Yu, F.-L. Huang, and C.-J. Lin. Dual coordinate descent methods for logistic regression and maximum entropy models. Machine Learning, vol. 85, no. 1-2, pp. 41-75, 2011.
18. G.-X. Yuan, C.-H. Ho, and C.-J. Lin. An improved GLMNET for 11-regularized logistic regression. JMLR, vol. 13, pp. 1999-2030, 2012.
19. G.-X. Yuan, K.-L. Ma. Scalable Training of Sparse Linear SVMs. ICDM, 2012.
20. H. Zou and T. Hastie. Regularization and variable selection via the elastic net. J. Roy. Statist. Soc. Ser. B 67, 301-320, 2005.