{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T03:03:08Z","timestamp":1772679788097,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1109\/tit.2012.2212414","type":"journal-article","created":{"date-parts":[[2012,8,8]],"date-time":"2012-08-08T18:02:19Z","timestamp":1344448939000},"page":"573-587","source":"Crossref","is-referenced-by-count":41,"title":["The Generalization Ability of Online Algorithms for Dependent Data"],"prefix":"10.1109","volume":"59","author":[{"given":"Alekh","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"John C.","family":"Duchi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.556602"},{"key":"ref12","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"xiao","year":"2010","journal-title":"J Mach Learning Res"},{"key":"ref13","author":"kushner","year":"2003","journal-title":"Stochastic Approximation and Recursive Algorithms and Applications"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1990.10474930"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120236"},{"key":"ref16","article-title":"On the generalization ability of online strongly convex programming algorithms","volume":"21","author":"kakade","year":"2009","journal-title":"Adv Neur Inf Process Syst"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1214\/154957805100000104","article-title":"Basic properties of strong mixing conditions. a survey and some open questions","volume":"2","author":"bradley","year":"2005","journal-title":"Probab Surveys"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626630"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1015961162"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176988849"},{"key":"ref27","author":"hiriart-urruty","year":"1996","journal-title":"Convex Analysis and Minimization Algorithms I & II"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753683726"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5104-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996452"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007602715810"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760200704"},{"key":"ref7","first-page":"789","article-title":"Stability bounds for stationary <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\phi$<\/tex><\/formula>-mixing and <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\beta$<\/tex><\/formula>-mixing processes","volume":"11","author":"mohri","year":"2010","journal-title":"J Mach Learning Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007424614876"},{"key":"ref9","first-page":"1768","article-title":"Fast learning from non-i.i.d. observations","volume":"22","author":"steinwart","year":"2009","journal-title":"Adv Neur Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833339"},{"key":"ref20","author":"billingsley","year":"1986","journal-title":"Probability and Measure"},{"key":"ref22","article-title":"Composite objective mirror descent","author":"duchi","year":"2010","journal-title":"23rd Annu Conf Comput Learning Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2748\/tmj\/1178243286"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref26","author":"shalev-shwartz","year":"2007","journal-title":"Logarithmic Regret Algorithms for Strongly Convex Repeated Games"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6387658\/06263295.pdf?arnumber=6263295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:46Z","timestamp":1633909906000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6263295\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2212414","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}