{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T11:55:47Z","timestamp":1777982147619,"version":"3.51.4"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Research Grants Council of Hong Kong","award":["CityU 104113"],"award-info":[{"award-number":["CityU 104113"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["11461161006"],"award-info":[{"award-number":["11461161006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["11471292"],"award-info":[{"award-number":["11471292"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tnnls.2017.2677970","type":"journal-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T21:04:46Z","timestamp":1493067886000},"page":"2367-2378","source":"Crossref","is-referenced-by-count":22,"title":["Online Learning Algorithms Can Converge Comparably Fast as Batch Learning"],"prefix":"10.1109","volume":"29","author":[{"given":"Junhong","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0224-9216","authenticated-orcid":false,"given":"Ding-Xuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref10","first-page":"1","article-title":"Information-theoretic lower bounds on the oracle complexity of convex optimization","author":"agarwal","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S0219530514500110"},{"key":"ref12","first-page":"817","article-title":"The epoch-greedy algorithm for multi-armed bandits with side information","author":"langford","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","first-page":"1363","article-title":"Some properties of regularized kernel methods","volume":"5","author":"de vito","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.007"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1079120130"},{"key":"ref16","author":"srebro","year":"2010","journal-title":"Optimistic rates for learning with a smooth loss"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1142\/S0219530503000089"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-006-0237-y"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000000907"},{"key":"ref28","first-page":"1","article-title":"Iterative regularization for learning with convex loss functions","volume":"17","author":"lin","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0160-z"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2387313"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833339"},{"key":"ref6","first-page":"773","article-title":"Non-strongly-convex smooth stochastic approximation with convergence rate \n${O(1\/n)}$","author":"bach","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","first-page":"3341","article-title":"Learning theory of randomized Kaczmarz algorithm","volume":"16","author":"lin","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883632"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2006.12.001"},{"key":"ref7","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref2","author":"steinwart","year":"2008","journal-title":"Support Vector Machines"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332531"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511618796"},{"key":"ref20","first-page":"1143","article-title":"Support vector machine soft margin classifiers: Error analysis","volume":"5","author":"chen","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"ref23","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/TNNLS.2014.2361026","article-title":"The generalization ability of online SVM classification based on Markov sampling","volume":"26","author":"xu","year":"2015","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1142\/S0219530509001293"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8360119\/07906654.pdf?arnumber=7906654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:33Z","timestamp":1642004553000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7906654\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":30,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2017.2677970","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}