學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Trust Region Newton Method for Logistic Regression
作者 翁久幸
Lin, Chih-Jen ; Weng, Ruby C. ; Keerthi, S. Sathiya
日期 2008-06
上傳時間 6-Oct-2010 11:20:48 (UTC+8)
摘要 Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method to maximize the log-likelihood of the logistic regression model. The proposed method uses only approximate Newton steps in the beginning, but achieves fast convergence in the end. Experiments show that it is faster than the commonly used quasi Newton approach for logistic regression. We also extend the proposed method to large-scale L2-loss linear support vector machines (SVM).
關聯 Journal of Machine Learning Research, 9,627-650
資料類型 article
DOI http://dx.doi.org/10.1145/1390681.1390703
dc.creator (作者) 翁久幸zh_TW
dc.creator (作者) Lin, Chih-Jen ; Weng, Ruby C. ; Keerthi, S. Sathiya-
dc.date (日期) 2008-06en_US
dc.date.accessioned 6-Oct-2010 11:20:48 (UTC+8)-
dc.date.available 6-Oct-2010 11:20:48 (UTC+8)-
dc.date.issued (上傳時間) 6-Oct-2010 11:20:48 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/46064-
dc.description.abstract (摘要) Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method to maximize the log-likelihood of the logistic regression model. The proposed method uses only approximate Newton steps in the beginning, but achieves fast convergence in the end. Experiments show that it is faster than the commonly used quasi Newton approach for logistic regression. We also extend the proposed method to large-scale L2-loss linear support vector machines (SVM).-
dc.language.iso en_US-
dc.relation (關聯) Journal of Machine Learning Research, 9,627-650en_US
dc.title (題名) Trust Region Newton Method for Logistic Regressionen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1145/1390681.1390703en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1145/1390681.1390703en_US