{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T18:01:47Z","timestamp":1791914507609,"version":"4.3.4"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2016,5,23]]},"abstract":"<jats:p>Randomization offers new benefits for large-scale linear algebra computations.<\/jats:p>","DOI":"10.1145\/2842602","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T17:47:58Z","timestamp":1464112078000},"page":"80-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":168,"title":["RandNLA"],"prefix":"10.1145","volume":"59","author":[{"given":"Petros","family":"Drineas","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael W.","family":"Mahoney","sequence":"additional","affiliation":[{"name":"University of California at Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Annual Advances in Neural Information Processing Systems 26: Proceedings of the 2013 Conference","author":"Achlioptas D.","year":"2013","unstructured":"Achlioptas , D. , Karnin , Z. , Liberty , E. Near-optimal entrywise sampling for data matrices . In Annual Advances in Neural Information Processing Systems 26: Proceedings of the 2013 Conference , 2013 . Achlioptas, D., Karnin, Z., Liberty, E. Near-optimal entrywise sampling for data matrices. In Annual Advances in Neural Information Processing Systems 26: Proceedings of the 2013 Conference, 2013."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646379"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958627.1958633"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496875"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"e_1_2_1_9_1","first-page":"3","article-title":"Influential observations, high leverage points, and outliers in linear regression","volume":"1","author":"Chatterjee S.","year":"1986","unstructured":"Chatterjee , S. , Hadi , A.S . Influential observations, high leverage points, and outliers in linear regression . Stat. Sci. 1 , 3 ( 1986 ), 379--393. Chatterjee, S., Hadi, A.S. Influential observations, high leverage points, and outliers in linear regression. Stat. Sci. 1, 3 (1986), 379--393.","journal-title":"Stat. Sci."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 31st International Conference on Machine Learning","author":"Chen Y.","year":"2014","unstructured":"Chen , Y. , Bhojanapalli , S. , Sanghavi , S. , Ward , R. Coherent matrix completion . In Proceedings of the 31st International Conference on Machine Learning ( 2014 ), 674--682. Chen, Y., Bhojanapalli, S., Sanghavi, S., Ward, R. Coherent matrix completion. In Proceedings of the 31st International Conference on Machine Learning (2014), 674--682."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Clarkson K.","year":"2005","unstructured":"Clarkson , K. Subgradient and sampling algorithms for l<sup>1<\/sup> regression . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms ( 2005 ), 257--266. Clarkson, K. Subgradient and sampling algorithms for l<sup>1<\/sup> regression. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (2005), 257--266."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503352"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109682"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.01.010"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"e_1_2_1_21_1","volume-title":"Revisiting the Nystr\u00f6m method for improved large-scale machine learning. J. Mach","author":"Gittens A.","unstructured":"Gittens , A. Mahoney , M.W. Revisiting the Nystr\u00f6m method for improved large-scale machine learning. J. Mach . Learn Res. In press . Gittens, A. Mahoney, M.W. Revisiting the Nystr\u00f6m method for improved large-scale machine learning. J. Mach. Learn Res. In press."},{"key":"e_1_2_1_22_1","volume-title":"Matrix Computations","author":"Golub G.H.","year":"1996","unstructured":"Golub , G.H. , Van Loan , C.F. Matrix Computations . Johns Hopkins University Press , Baltimore , 1996 . Golub, G.H., Van Loan, C.F. Matrix Computations. Johns Hopkins University Press, Baltimore, 1996."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"e_1_2_1_24_1","volume-title":"Subspace iteration randomization and singular value problems. Technical report","author":"Gu M.","year":"2014","unstructured":"Gu , M. Subspace iteration randomization and singular value problems. Technical report , 2014 . Preprint : arXiv:1408.2208. Gu, M. Subspace iteration randomization and singular value problems. Technical report, 2014. Preprint: arXiv:1408.2208."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2347736.2347759"},{"key":"e_1_2_1_28_1","volume-title":"A note on randomized elementwise matrix sparsification. Technical report","author":"Kundu A.","year":"2014","unstructured":"Kundu , A. , Drineas , P. A note on randomized elementwise matrix sparsification. Technical report , 2014 . Preprint : arXiv:1404.0320. Kundu, A., Drineas, P. A note on randomized elementwise matrix sparsification. Technical report, 2014. Preprint: arXiv:1404.0320."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 30th International Conference on Machine Learning","author":"Le Q.V.","year":"2013","unstructured":"Le , Q.V. , Sarl\u00f3s , T. , Smola , A.J. Fastfood---approximating kernel expansions in loglinear time . In Proceedings of the 30th International Conference on Machine Learning , 2013 . Le, Q.V., Sarl\u00f3s, T., Smola, A.J. Fastfood---approximating kernel expansions in loglinear time. In Proceedings of the 30th International Conference on Machine Learning, 2013."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2831141"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2831142"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488621"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/120866580"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.21"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v15-1544"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.0030160"},{"key":"e_1_2_1_39_1","volume-title":"Annual Advances in Neural Information Processing Systems 20: Proceedings of the 2007 Conference","author":"Rahimi A.","year":"2008","unstructured":"Rahimi , A. , Recht , B. Random features for large-scale kernel machines . In Annual Advances in Neural Information Processing Systems 20: Proceedings of the 2007 Conference , 2008 . Rahimi, A., Recht, B. Random features for large-scale kernel machines. In Annual Advances in Neural Information Processing Systems 20: Proceedings of the 2007 Conference, 2008."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2185803"},{"key":"e_1_2_1_41_1","first-page":"3","article-title":"A randomized algorithm for principal component analysis","volume":"31","author":"Rokhlin V.","year":"2009","unstructured":"Rokhlin , V. , Szlam , A. , Tygert , M . A randomized algorithm for principal component analysis . SIAM J. Matrix Anal. Appl. 31 , 3 ( 2009 ), 1100--1124. Rokhlin, V., Szlam, A., Tygert, M. A randomized algorithm for principal component analysis. SIAM J. Matrix Anal. Appl. 31, 3 (2009), 1100--1124.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1032043"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_2_1_46_1","volume-title":"The History of Statistics: The Measurement of Uncertainty before","author":"Stigler S.M.","year":"1900","unstructured":"Stigler , S.M. The History of Statistics: The Measurement of Uncertainty before 1900 . Harvard University Press , Cambridge , 1986. Stigler, S.M. The History of Statistics: The Measurement of Uncertainty before 1900. Harvard University Press, Cambridge, 1986."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1093\/qjmam\/1.1.287"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08909-6"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1009001"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494219"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1021\/ac5040264"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1088\/0004-6256\/147\/5\/110"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2842602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2842602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:53:48Z","timestamp":1750208028000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2842602"}},"subtitle":["randomized numerical linear algebra"],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,5,23]]}},"alternative-id":["10.1145\/2842602"],"URL":"https:\/\/doi.org\/10.1145\/2842602","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,23]]},"assertion":[{"value":"2016-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}