{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:22Z","timestamp":1740133222150,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/msp.2020.2973567","type":"journal-article","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T20:10:53Z","timestamp":1588363853000},"page":"61-70","source":"Crossref","is-referenced-by-count":6,"title":["Optimally Compressed Nonparametric Online Learning: Tradeoffs between memory and consistency"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2447-2873","authenticated-orcid":false,"given":"Alec","family":"Koppel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit Singh","family":"Bedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-3812","authenticated-orcid":false,"given":"Brian M.","family":"Sadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2892835"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682173"},{"key":"ref33","volume":"1","author":"friedman","year":"2001","journal-title":"The Elements of Statistical Learning"},{"key":"ref32","first-page":"654","article-title":"Nonparametric budgeted stochastic gradient descent","author":"le","year":"0","journal-title":"Proc Int Conf Artificial Intelligence and Statistics"},{"key":"ref31","first-page":"4583","article-title":"Dual space gradient descent for online learning","author":"le","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1198\/106186005X25619"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2686368"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1017-3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9965.00068"},{"key":"ref34","first-page":"308","article-title":"Approximating expected utility by a function of mean and variance","volume":"69","author":"levy","year":"1979","journal-title":"Amer Econ Rev"},{"key":"ref10","first-page":"1313","article-title":"Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning","author":"rahimi","year":"0","journal-title":"Proc 21st Int Conf Advances in Neural Information Processing Systems"},{"key":"ref11","first-page":"1","article-title":"Parsimonious online learning with kernels via sparse projections in function space","volume":"20","author":"koppel","year":"2019","journal-title":"J Mach Learn Res"},{"article-title":"Nonparametric compositional stochastic optimization","year":"2019","author":"bedi","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637324"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8815206"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(89)90002-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619572"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/26.297849"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2830299"},{"key":"ref28","first-page":"908","article-title":"Online passive-aggressive algorithms on a budget","author":"wang","year":"0","journal-title":"Proc Int Conf Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2057247"},{"article-title":"Nonstationary nonparametric online learning: Balancing dynamic regret and model parsimony","year":"2019","author":"bedi","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2012.2206060"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000677"},{"key":"ref29","first-page":"1177","article-title":"Random features for large-scale kernel machines","author":"rahimi","year":"0","journal-title":"Proc 20th Int Conf Neural Information Processing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/9781139029834"},{"key":"ref8","first-page":"3103","article-title":"Breaking the curse of kernelization: Budgeted stochastic gradient descent for large-scale SVM training","volume":"13","author":"wang","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2003.1236770"},{"journal-title":"Probabilistic Robotics","year":"2005","author":"thrun","key":"ref2"},{"key":"ref9","first-page":"682","article-title":"Using the Nyström method to speed up kernel machines","author":"williams","year":"0","journal-title":"Proc 14th Annu Conf Advances in Neural Information Processing Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3030-1_56"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646689"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.830991"},{"key":"ref23","first-page":"49","article-title":"Event-triggered distributed optimization in sensor networks","author":"wan","year":"0","journal-title":"Proc 2009 IEEE Int Conf Information Processing Sensor Networks"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013955821559"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.830985"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/79\/9084311\/09084339.pdf?arnumber=9084339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:35:53Z","timestamp":1651073753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9084339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":39,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/msp.2020.2973567","relation":{},"ISSN":["1053-5888","1558-0792"],"issn-type":[{"type":"print","value":"1053-5888"},{"type":"electronic","value":"1558-0792"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}