{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:28Z","timestamp":1740132088212,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61976112"],"award-info":[{"award-number":["61976112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSFC-NRF Joint Research Project","award":["61861146001"],"award-info":[{"award-number":["61861146001"]}]},{"name":"JiangsuSF","award":["BK20200064"],"award-info":[{"award-number":["BK20200064"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022,10,1]]},"DOI":"10.1109\/tpami.2021.3096880","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T19:13:34Z","timestamp":1629832414000},"page":"6910-6923","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Adaptive Online Learning via Frequent Directions"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3577-5186","authenticated-orcid":false,"given":"Yuanyu","family":"Wan","sequence":"first","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5138-3182","authenticated-orcid":false,"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/381"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007662407062"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390212"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8300"},{"key":"ref6","first-page":"621","article-title":"Online kernel learning with a near optimal sparsity bound","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-5171-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488200"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556252"},{"key":"ref10","first-page":"392","article-title":"Online stochastic linear optimization under one-bit feedback","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref11","first-page":"761","article-title":"Online metric learning and fast similarity search","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Jain"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02172-5_2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2011.2133970"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8911"},{"key":"ref15","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"Mairal","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282771"},{"key":"ref17","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Jin"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472160"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.003"},{"key":"ref20","first-page":"595","article-title":"Online F-measure optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Busa-Fekete"},{"key":"ref21","first-page":"451","article-title":"Stochastic online AUC maximization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref22","first-page":"1323","article-title":"Adaptive online learning in dynamic environments","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref23","first-page":"9818","article-title":"Projection-free distributed online convex optimization with ${O}(\\sqrt{T})$O(T) communication complexity","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Wan"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.172"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2330853"},{"key":"ref26","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","first-page":"1750","article-title":"Scalable adaptive stochastic optimization using random projections","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Krummenacher"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93037-4_32"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref30","first-page":"902","article-title":"Efficient second order online learning by sketching","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Luo"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009718"},{"key":"ref32","first-page":"2116","article-title":"Dual averaging method for regularized stochastic learning and online optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Xiao"},{"key":"ref33","first-page":"14","article-title":"Composite objective mirror descent","volume-title":"Proc. 23rd Annu. Conf. Learn. Theory","author":"Duchi"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.53"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1998.682302"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"issue":"1\/2","key":"ref39","first-page":"1","article-title":"Sketching as a tool for numerical linear algebra","volume":"10","author":"Woodruff","year":"2014","journal-title":"Found. Trends Mach. Learn."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/1031049"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.07.021"},{"key":"ref44","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich"},{"key":"ref45","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3379500"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"article-title":"Learning multiple layers of features from tiny images","year":"2009","author":"Krizhevsky","key":"ref48"},{"key":"ref49","first-page":"1","article-title":"Reading digits in natural images with unsupervised feature learning","volume-title":"Proc. NIPS Workshop Deep Learn. Unsupervised Feature Learn.","author":"Netzer"},{"key":"ref50","first-page":"1","article-title":"Very deep convolutional networks for large-scale image recognition","author":"Simonyan","year":"2015","journal-title":"Proc. 3rd Int. Conf. Learn. Representations"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/9893033\/09485048.pdf?arnumber=9485048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:26:47Z","timestamp":1705015607000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9485048\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,1]]},"references-count":51,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3096880","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2022,10,1]]}}}