{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:41:23Z","timestamp":1787506883307,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-12-C-0323"],"award-info":[{"award-number":["FA8750-12-C-0323"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939794","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T14:33:46Z","timestamp":1470666826000},"page":"1265-1274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Revisiting Random Binning Features"],"prefix":"10.1145","author":[{"given":"Lingfei","family":"Wu","sequence":"first","affiliation":[{"name":"College of William and Mary, Williamsburg, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian E.H.","family":"Yen","sequence":"additional","affiliation":[{"name":"Unversity of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Yan","sequence":"additional","affiliation":[{"name":"Baidu Inc., Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Parallel coordinate descent for l1-regularized loss minimization. CoRR, abs\/1105.5379","author":"Bradley J. K.","year":"2011","unstructured":"J. K. Bradley, A. Kyrola, D. Bickson, and C. Guestrin. Parallel coordinate descent for l1-regularized loss minimization. CoRR, abs\/1105.5379, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472118"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969166"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194916"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442794"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/944790.944812"},{"key":"e_1_3_2_1_8_1","volume-title":"Revisiting the nystr\u00f6m method for improved large-scale machine learning. CoRR, abs\/1303.1849","author":"Gittens A.","year":"2013","unstructured":"A. Gittens and M. W. Mahoney. Revisiting the nystr\u00f6m method for improved large-scale machine learning. CoRR, abs\/1303.1849, 2013."},{"key":"e_1_3_2_1_9_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, USA, 1996."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6853587"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2343678"},{"key":"e_1_3_2_1_12_1","volume-title":"ICML","author":"Le Q. V.","year":"2013","unstructured":"Q. V. Le, T. Sarl\u00f3s, and A. J. Smola. Fastfood: Approximate kernel expansions in loglinear time. ICML, 2013."},{"key":"e_1_3_2_1_13_1","first-page":"836","volume-title":"Advances in Neural Information Processing Systems","author":"Lee J.","year":"2012","unstructured":"J. Lee, Y. Sun, and M. Saunders. Proximal newton-type methods for convex optimization. In Advances in Neural Information Processing Systems, pages 836--844, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1390703"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1390690"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2789282"},{"key":"e_1_3_2_1_17_1","volume-title":"How to scale up kernel methods to be as good as deep neural nets. CoRR, abs\/1411.4000","author":"Lu Z.","year":"2014","unstructured":"Z. Lu, A. May, K. Liu, A. B. Garakani, D. Guo, A. Bellet, L. Fan, M. Collins, B. Kingsbury, M. Picheny, and F. Sha. How to scale up kernel methods to be as good as deep neural nets. CoRR, abs\/1411.4000, 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17689-5_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1909.0016"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2984093.2984263"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981562.2981710"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981780.2981944"},{"key":"e_1_3_2_1_23_1","volume-title":"Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1--2):1--38","author":"Richt\u00e1rik P.","year":"2014","unstructured":"P. Richt\u00e1rik and M. Tak\u00e1\u010d. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1--2):1--38, 2014."},{"key":"e_1_3_2_1_24_1","first-page":"1","volume-title":"Mathematical Programming","author":"Richt\u00e1rik P.","year":"2015","unstructured":"P. Richt\u00e1rik and M. Tak\u00e1\u010d. Parallel coordinate descent methods for big data optimization. Mathematical Programming, pages 1--52, 2015."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/829576"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/559923"},{"key":"e_1_3_2_1_27_1","volume-title":"ICML","author":"Si S.","year":"2014","unstructured":"S. Si, C. Hsieh, and I. S. Dhillon. Memory efficient kernel approximation. In ICML, 2014."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645529.657980"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spasta.2013.06.003"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2981345.2981349"},{"key":"e_1_3_2_1_31_1","volume-title":"Using the nystr\u00f6m method to speed up kernel machines","author":"Williams C. K. I.","year":"2001","unstructured":"C. K. I. Williams and M. Seeger. Using the nystr\u00f6m method to speed up kernel machines. In NIPS. MIT Press, 2001."},{"key":"e_1_3_2_1_32_1","volume-title":"AISTATS","author":"Yang Z.","year":"2015","unstructured":"Z. Yang, A. G. Wilson, A. J. Smola, and L. Song. A la carte - learning fast kernels. In AISTATS, 2015."},{"key":"e_1_3_2_1_33_1","volume-title":"JMLR","author":"Yen I. E.-H.","year":"2014","unstructured":"I. E.-H. Yen, T.-W. Lin, S.-D. Lin, P. K. Ravikumar, and I. S. Dhillon. Sparse random feature algorithm as coordinate descent in hilbert space. In JMLR, 2014."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953034"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969092"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Francisco California USA","acronym":"KDD '16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939794","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939794","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:36:51Z","timestamp":1763458611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939794"}},"subtitle":["Fast Convergence and Strong Parallelizability"],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":35,"alternative-id":["10.1145\/2939672.2939794","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939794","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}