A Comparison of Optimization Methods and Software for Large-scale L1-regularized Linear Classification

Large-scale linear classification is widely used in many areas. The L1-regularized form can be applied for feature selection; however, its non-differentiability causes more difficulties in training. Although various optimization methods have been proposed in recent years, these have not yet been compared suitably. In this paper, we first broadly review existing methods. Then, we discuss state-of-the-art software packages in detail and propose two efficient implementations. Extensive comparisons indicate that carefully implemented coordinate descent methods are very suitable for training large document data. [abs] [ pdf ][ bib ] &copy JMLR 2010. ( edit, beta )

Authors

• Guo-Xun Yuan
• Kai-Wei Chang
• Cho-Jui Hsieh University of California, Los Angeles
• Chih-Jen Lin

Keywords

No keywords are indexed for this paper.