{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T03:22:12Z","timestamp":1765423332828,"version":"3.37.3"},"reference-count":103,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,9,1]]},"DOI":"10.1109\/tkde.2022.3180808","type":"journal-article","created":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T20:25:28Z","timestamp":1655238328000},"page":"8699-8712","source":"Crossref","is-referenced-by-count":3,"title":["Least-Mean-Squares Coresets for Infinite Streams"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7709-8753","authenticated-orcid":false,"given":"Vladimir","family":"Braverman","sequence":"first","affiliation":[{"name":"Computer Science Deprtment, Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7700-9711","authenticated-orcid":false,"given":"Dan","family":"Feldman","sequence":"additional","affiliation":[{"name":"Robotics & Big Data Lab, Computer Science Department, University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4592-5474","authenticated-orcid":false,"given":"Harry","family":"Lang","sequence":"additional","affiliation":[{"name":"Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5473-3566","authenticated-orcid":false,"given":"Daniela","family":"Rus","sequence":"additional","affiliation":[{"name":"Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7144-8345","authenticated-orcid":false,"given":"Adiel","family":"Statman","sequence":"additional","affiliation":[{"name":"Robotics & Big Data Lab, Computer Science Department, University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0075-7"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/83.855432"},{"key":"ref59","first-page":"15582","article-title":"Dimensionality reduction for wasserstein barycenter","author":"izzo","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","first-page":"586","article-title":"A deterministic streaming sketch for ridge regression","author":"shi","year":"2021","journal-title":"Proc 24th Int Conf Artif Intell Statist"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47969-4_47"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009718"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.5244\/C.12.29"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.39"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2016.11"},{"article-title":"Sparse quadratic forms and their geometric applications","year":"2011","author":"assaf","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1824777.1824783","article-title":"Coresets, sparse greedy approximation, and the frank-wolfe algorithm","volume":"6","author":"clarkson","year":"2010","journal-title":"ACM Trans Algorithms"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9396-1"},{"article-title":"Online spectral approximation in random order streams","year":"2019","author":"gohda","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623698"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/toc.2020.v016a015","article-title":"Online row sampling","volume":"16","author":"cohen","year":"2020","journal-title":"Theory Comput"},{"key":"ref7","first-page":"2766","article-title":"Dimensionality reduction of massive sparse datasets using coresets","author":"feldman","year":"2016","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/141002281"},{"key":"ref4","first-page":"62:1","article-title":"Streaming coreset constructions for m-estimators","author":"braverman","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993712"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403256"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.95"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1145\/1314690.1314696"},{"article-title":"Randomized algorithms for matrices and data","year":"2011","author":"mahoney","key":"ref40"},{"key":"ref35","first-page":"3544","article-title":"Adversarial robustness of streaming algorithms through importance sampling","author":"hasidim","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","first-page":"997","article-title":"Coresets for near-convex functions","author":"tukan","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"article-title":"Continual learning via online leverage score sampling","year":"2019","author":"teng","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/2346488"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_30"},{"key":"ref30","first-page":"91","article-title":"A statistical perspective on algorithmic leveraging","author":"ma","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/070696507"},{"key":"ref32","first-page":"183","article-title":"Lp row sampling by lewis weights","author":"cohen","year":"2015","journal-title":"Proc 47th Annu ACM Symp Theory Comput"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688113"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.22"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_39"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2500128"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00055"},{"article-title":"Sparse approximations, iterative methods, and faster algorithms for matrices and graphs","year":"2018","author":"cohen","key":"ref25"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783312"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109682"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/toc.2014.v010a001","article-title":"Sketching as a tool for numerical linear algebra","volume":"10","author":"woodruff","year":"2014","journal-title":"Theor Comput Sci"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49730-7_9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.50"},{"key":"ref29","article-title":"On fast leverage score sampling and optimal learning","volume":"31","author":"rudi","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref13","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref12","first-page":"8305","article-title":"Fast and accurate least-mean-squares solvers","author":"maalouf","year":"2019","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"article-title":"Coresets for gaussian mixture models of any shape","year":"2019","author":"feldman","key":"ref15"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.53"},{"key":"ref97","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/11830924_28","article-title":"Adaptive sampling and fast low-rank matrix approximation","author":"deshpande","year":"2006","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1137\/140977898"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106622"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.106"},{"key":"ref10","first-page":"3475","article-title":"Fast approximation of matrix coherence and statistical leverage","volume":"13","author":"drineas","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref98","article-title":"Column selection via adaptive sampling","volume":"28","author":"paul","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/090772873"},{"key":"ref19","first-page":"2032","article-title":"A framework for analyzing resparsification algorithms","author":"kyng","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"article-title":"Dynamic streaming spectral sparsification in nearly linear time and space","year":"2019","author":"kapralov","key":"ref18"},{"key":"ref93","first-page":"1758","article-title":"Input sparsity time low-rank approximation via ridge leverage score sampling","author":"cohen","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.38"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00094"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247073"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-587260-7.50018-2"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1974.270490"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1137\/100804139"},{"article-title":"Fast randomized singular value decomposition","year":"2014","author":"tulloch","key":"ref85"},{"key":"ref88","first-page":"517","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"journ\u00e9e","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1137\/130938700"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9891-7"},{"key":"ref81","first-page":"1129","article-title":"Online PCA with spectral bounds","author":"karnin","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1137\/080736417"},{"article-title":"An implementation of a randomized algorithm for principal component analysis","year":"2014","author":"szlam","key":"ref80"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3019134"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.53"},{"article-title":"Asymptotically exact streaming algorithms","year":"2014","author":"heinrich","key":"ref75"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref77","first-page":"28","article-title":"Randomized block krylov methods for stronger and faster approximate singular value decomposition","author":"musco","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2539943"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref103","first-page":"21 092","article-title":"WOR and p’s: Sketches for lp-sampling without replacement","author":"cohen","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1335"},{"key":"ref1","first-page":"1269","article-title":"Coresets and Sketches","author":"phillips","year":"2017","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488621"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.21"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref67","first-page":"223","article-title":"Pass efficient algorithms for approximating large matrices","author":"drineas","year":"2003","journal-title":"Proc 14th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/12086755X"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1711"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10210449\/09795326.pdf?arnumber=9795326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T18:11:05Z","timestamp":1693246265000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9795326\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":103,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3180808","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2023,9,1]]}}}