{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:01Z","timestamp":1750221241618,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the NSERC Discovery Grant program"},{"name":"the Canada Research Chair program"},{"name":"National Program on Key Basic Research Project","award":["2015CB352300"],"award-info":[{"award-number":["2015CB352300"]}]},{"name":"National Natural Science Foundation of China","award":["61572017","11771002"],"award-info":[{"award-number":["61572017","11771002"]}]},{"name":"National Natural Science Foundation of China Major Project"},{"name":"the NSERC Strategic Grant program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,19]]},"DOI":"10.1145\/3219819.3220044","type":"proceedings-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:05:12Z","timestamp":1532005512000},"page":"1900-1909","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Sketched Follow-The-Regularized-Leader for Online Factorization Machine"],"prefix":"10.1145","author":[{"given":"Luo","family":"Luo","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenpeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University &amp;BIBDR, China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenwu","family":"Zhu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tencent AI Lab, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"JD.com &amp;Simon Fraser University, Vancouver, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1132516.1132597"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.5555\/1667528.1667535"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/2483699.2483701"},{"unstructured":"Peter L. Bartlett Elad Hazan and Alexander Rakhlin . 2007. Adaptive Online Gradient Descent. In NIPS.   Peter L. Bartlett Elad Hazan and Alexander Rakhlin . 2007. Adaptive Online Gradient Descent. In NIPS.","key":"e_1_3_2_1_4_1"},{"doi-asserted-by":"crossref","unstructured":"Mathieu Blondel Akinori Fujino and Naonori Ueda . 2015. Convex Factorization Machines. In ECML\/PKDD.  Mathieu Blondel Akinori Fujino and Naonori Ueda . 2015. Convex Factorization Machines. In ECML\/PKDD.","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-319-23525-7_2"},{"doi-asserted-by":"crossref","unstructured":"Mathieu Blondel Akinori Fujino Naonori Ueda and Masakazu Ishihata . 2016. Higher-Order Factorization Machines. In NIPS.   Mathieu Blondel Akinori Fujino Naonori Ueda and Masakazu Ishihata . 2016. Higher-Order Factorization Machines. In NIPS.","key":"e_1_3_2_1_6_1","DOI":"10.1007\/978-3-319-23525-7_2"},{"unstructured":"Daniele Calandriello Alessandro Lazaric and Michal Valko . 2017. Second-Order Kernel Online Convex Optimization with Adaptive Sketching ICML.  Daniele Calandriello Alessandro Lazaric and Michal Valko . 2017. Second-Order Kernel Online Convex Optimization with Adaptive Sketching ICML.","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2645710.2645730"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/2488608.2488620"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/TKDE.2016.2539943"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1137\/S0097539704442684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1137\/S0097539704442696"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/2503308.2503352"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1137\/07070471X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/1953048.2021068"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/1039488.1039494"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/2939672.2939800"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1137\/15M1009718"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1016\/j.neucom.2016.05.074"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_22_1","volume-title":"Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics","author":"Johnson William B","year":"1984","unstructured":"William B Johnson and Joram Lindenstrauss . 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics Vol. 26 , 189--206 ( 1984 ), 1. William B Johnson and Joram Lindenstrauss . 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics Vol. 26, 189--206 (1984), 1."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3041021.3054185"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/2959100.2959134"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/2559902"},{"key":"e_1_3_2_1_26_1","volume-title":"Incremental Factorization Machines for Persistently Cold-starting Online Item Recommendation. arXiv preprint arXiv:1607.02858","author":"Takuya Kitazawa","year":"2016","unstructured":"Takuya Kitazawa . 2016. Incremental Factorization Machines for Persistently Cold-starting Online Item Recommendation. arXiv preprint arXiv:1607.02858 ( 2016 ). deftempurl%https:\/\/arxiv.org\/abs\/1607.02858 tempurl Takuya Kitazawa . 2016. Incremental Factorization Machines for Persistently Cold-starting Online Item Recommendation. arXiv preprint arXiv:1607.02858 (2016). deftempurl%https:\/\/arxiv.org\/abs\/1607.02858 tempurl"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/2487575.2487623"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/3178876.3186075"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3018661.3018716"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/3018661.3018716"},{"unstructured":"Haipeng Luo Alekh Agarwal Nicol\u00f2 Cesa-Bianchi and John Langford . 2016. Efficient second order online learning by sketching NIPS.   Haipeng Luo Alekh Agarwal Nicol\u00f2 Cesa-Bianchi and John Langford . 2016. Efficient second order online learning by sketching NIPS.","key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","volume-title":"Robust Frequent Directions with Application in Online Learning. arXiv preprint arXiv:1705.05067","author":"Luo Luo","year":"2017","unstructured":"Luo Luo , Cheng Chen , Zhihua Zhang , Wu-Jun Li , and Tong Zhang . 2017. Robust Frequent Directions with Application in Online Learning. arXiv preprint arXiv:1705.05067 ( 2017 ). deftempurl%https:\/\/arxiv.org\/abs\/1705.05067 tempurl Luo Luo, Cheng Chen, Zhihua Zhang, Wu-Jun Li, and Tong Zhang . 2017. Robust Frequent Directions with Application in Online Learning. arXiv preprint arXiv:1705.05067 (2017). deftempurl%https:\/\/arxiv.org\/abs\/1705.05067 tempurl"},{"unstructured":"H. Brendan McMahan . 2011. Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization. In AISTATS.  H. Brendan McMahan . 2011. Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization. In AISTATS.","key":"e_1_3_2_1_33_1"},{"unstructured":"Youssef Mroueh Etienne Marcheret and Vaibhava Goel . 2017. Co-Occurring Directions Sketching for Approximate Matrix Multiply AISTATS.  Youssef Mroueh Etienne Marcheret and Vaibhava Goel . 2017. Co-Occurring Directions Sketching for Approximate Matrix Multiply AISTATS.","key":"e_1_3_2_1_34_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1109\/FOCS.2013.21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/2600428.2609623"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/2623330.2623698"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1109\/ICDM.2010.127"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1145\/2009916.2010002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1109\/FOCS.2006.37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1561\/2200000018"},{"volume-title":"Numerical linear algebra","author":"Trefethen Lloyd N","unstructured":"Lloyd N Trefethen and David Bau III . 1997. Numerical linear algebra . Vol. Vol. 50 . Society for Industrial and Applied Mathematics . Lloyd N Trefethen and David Bau III . 1997. Numerical linear algebra. Vol. Vol. 50. Society for Industrial and Applied Mathematics.","key":"e_1_3_2_1_42_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1561\/0400000060"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/3097983.3098103"},{"unstructured":"Qiaomin Ye Luo Luo and Zhihua Zhang . 2016. Frequent Direction Algorithms for Approximate Matrix Multiplication with Applications in CCA. In IJCAI.   Qiaomin Ye Luo Luo and Zhihua Zhang . 2016. Frequent Direction Algorithms for Approximate Matrix Multiplication with Applications in CCA. In IJCAI.","key":"e_1_3_2_1_45_1"},{"key":"e_1_3_2_1_46_1","volume-title":"Compact convexified factorization machine: formulation and online algorithms. arXiv preprint arXiv:1802.01379","author":"Zhang Wenpeng","year":"2018","unstructured":"Wenpeng Zhang , Xiao Lin , Tong Zhang , Peilin Zhao , Wenwu Zhu , Min Zhang , and Jian Pei . 2018. Compact convexified factorization machine: formulation and online algorithms. arXiv preprint arXiv:1802.01379 ( 2018 ). deftempurl%https:\/\/arxiv.org\/abs\/1802.01379 tempurl Wenpeng Zhang, Xiao Lin, Tong Zhang, Peilin Zhao, Wenwu Zhu, Min Zhang, and Jian Pei . 2018. Compact convexified factorization machine: formulation and online algorithms. arXiv preprint arXiv:1802.01379 (2018). deftempurl%https:\/\/arxiv.org\/abs\/1802.01379 tempurl"},{"unstructured":"Martin Zinkevich . 2003. Online Convex Programming and Generalized Infinitesimal Gradient Ascent ICML.   Martin Zinkevich . 2003. Online Convex Programming and Generalized Infinitesimal Gradient Ascent ICML.","key":"e_1_3_2_1_47_1"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '18","name":"KDD '18: The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"London United Kingdom"},"container-title":["Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220044","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3220044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:29Z","timestamp":1750212449000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":46,"alternative-id":["10.1145\/3219819.3220044","10.1145\/3219819"],"URL":"https:\/\/doi.org\/10.1145\/3219819.3220044","relation":{},"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"2018-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}