{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T18:06:32Z","timestamp":1768586792025,"version":"3.49.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T00:00:00Z","timestamp":1540771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["104-2622-E-002-012-CC2,104-2221-E-002-047- MY3"],"award-info":[{"award-number":["104-2622-E-002-012-CC2,104-2221-E-002-047- MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003194","name":"Ministry of Education","doi-asserted-by":"publisher","award":["104R7872,105R7872"],"award-info":[{"award-number":["104R7872,105R7872"]}],"id":[{"id":"10.13039\/501100003194","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2018,11,30]]},"abstract":"<jats:p>To date, factorization machines (FMs) have emerged as a powerful model in many applications. In this work, we study the training of FM with the logistic loss for binary classification, which is a nonlinear extension of the linear model with the logistic loss (i.e., logistic regression). For the training of large-scale logistic regression, Newton methods have been shown to be an effective approach, but it is difficult to apply such methods to FM because of the nonconvexity. We consider a modification of FM that is multiblock convex and propose an alternating minimization algorithm based on Newton methods. Some novel optimization techniques are introduced to reduce the running time. Our experiments demonstrate that the proposed algorithm is more efficient than stochastic gradient algorithms and coordinate descent methods. The parallelism of our method is also investigated for the acceleration in multithreading environments.<\/jats:p>","DOI":"10.1145\/3230710","type":"journal-article","created":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T12:02:18Z","timestamp":1540814538000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Alternating Newton Method for Learning Factorization Machines"],"prefix":"10.1145","volume":"9","author":[{"given":"Wei-Sheng","family":"Chin","sequence":"first","affiliation":[{"name":"National Taiwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Wen","family":"Yuan","sequence":"additional","affiliation":[{"name":"National Taiwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-Yuan","family":"Yang","sequence":"additional","affiliation":[{"name":"National Taiwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4684-8747","authenticated-orcid":false,"given":"Chih-Jen","family":"Lin","sequence":"additional","affiliation":[{"name":"National Taiwan University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Nonlinear Programming","author":"Bertsekas Dimitri P.","unstructured":"Dimitri P. Bertsekas . 1999. Nonlinear Programming ( 2 nd ed.). Athena Scientific , Belmont, MA . Dimitri P. Bertsekas. 1999. Nonlinear Programming (2nd ed.). Athena Scientific, Belmont, MA.","edition":"2"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916)","author":"Blondel Mathieu","year":"2016","unstructured":"Mathieu Blondel , Masakazu Ishihata , Akinori Fujino , and Naonori Ueda . 2016 . Polynomial networks and factorization machines: New insights and efficient training algorithms . In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916) . Mathieu Blondel, Masakazu Ishihata, Akinori Fujino, and Naonori Ueda. 2016. Polynomial networks and factorization machines: New insights and efficient training algorithms. In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/10079923X"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3114202.3114726"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442778"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021068"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0804022"},{"key":"e_1_2_1_8_1","volume-title":"Van Loan","author":"Golub Gene H.","year":"2012","unstructured":"Gene H. Golub and Charles F . Van Loan . 2012 . Matrix Computations (4th ed.). Johns Hopkins University Press . Gene H. Golub and Charles F. Van Loan. 2012. Matrix Computations (4th ed.). Johns Hopkins University Press."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503348"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756033"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.25"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959134"},{"key":"e_1_2_1_13_1","first-page":"341","article-title":"A modified finite newton method for fast solution of large scale linear SVMs","volume":"6","author":"Sathiya Keerthi S.","year":"2005","unstructured":"S. Sathiya Keerthi and Dennis DeCoste . 2005 . A modified finite newton method for fast solution of large scale linear SVMs . Journal of Machine Learning Research 6 (2005), 341 -- 361 . S. Sathiya Keerthi and Dennis DeCoste. 2005. A modified finite newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research 6 (2005), 341--361.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.75"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1390703"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3104322.3104416"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00426-X"},{"key":"e_1_2_1_20_1","volume-title":"Nash and Ariefla Sofer","author":"Stephen","year":"1996","unstructured":"Stephen G. Nash and Ariefla Sofer . 1996 . Linear and Nonlinear Programming. McGraw-Hill . Stephen G. Nash and Ariefla Sofer. 1996. Linear and Nonlinear Programming. McGraw-Hill."},{"key":"e_1_2_1_21_1","volume-title":"Wright","author":"Niu Feng","year":"2011","unstructured":"Feng Niu , Benjamin Recht , Christopher R\u00e9 , and Stephen J . Wright . 2011 . HOGWILD&excl;: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. Bartlett, F. C. N. Pereira, and K. Q. Weinberger (Eds .). 693--701. Feng Niu, Benjamin Recht, Christopher R\u00e9, and Stephen J. Wright. 2011. HOGWILD&excl;: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. Bartlett, F. C. N. Pereira, and K. Q. Weinberger (Eds.). 693--701."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168752.2168771"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1162\/08997660260028683"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7364112"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00751"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953034"},{"key":"e_1_2_1_28_1","first-page":"1999","article-title":"An improved GLMNET for L1-regularized logistic regression","volume":"13","author":"Yuan Guo-Xun","year":"2012","unstructured":"Guo-Xun Yuan , Chia-Hua Ho , and Chih-Jen Lin . 2012 a. An improved GLMNET for L1-regularized logistic regression . Journal of Machine Learning Research 13 (2012), 1999 -- 2030 . Retrieved from http:\/\/www.csie.ntu.edu.tw\/&sim;cjlin\/papers\/l1_glmnet\/long-glmnet.pdf. Guo-Xun Yuan, Chia-Hua Ho, and Chih-Jen Lin. 2012a. An improved GLMNET for L1-regularized logistic regression. Journal of Machine Learning Research 13 (2012), 1999--2030. Retrieved from http:\/\/www.csie.ntu.edu.tw\/&sim;cjlin\/papers\/l1_glmnet\/long-glmnet.pdf.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2012.2188013"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18032-8_54"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230710","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:29Z","timestamp":1750208249000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,29]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11,30]]}},"alternative-id":["10.1145\/3230710"],"URL":"https:\/\/doi.org\/10.1145\/3230710","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,29]]},"assertion":[{"value":"2018-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}