{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T22:09:12Z","timestamp":1759702152993},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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":[[2011,12]]},"DOI":"10.1109\/tit.2011.2164053","type":"journal-article","created":{"date-parts":[[2011,9,16]],"date-time":"2011-09-16T02:41:38Z","timestamp":1316140898000},"page":"7907-7931","source":"Crossref","is-referenced-by-count":31,"title":["Online Learning of Noisy Data"],"prefix":"10.1109","volume":"57","author":[{"given":"Nicol\u00f3","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Shalev-Shwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ohad","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"steinwart","year":"2008","journal-title":"Support Vector Machines"},{"key":"ref11","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc ICML"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref13","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proc SODA"},{"key":"ref14","first-page":"263","article-title":"Competing in the dark: An efficient algorithm for bandit linear optimization","author":"abernethy","year":"2008","journal-title":"COLT"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780272"},{"key":"ref16","first-page":"93","article-title":"Existence of unbiased estimates","volume":"26","author":"singh","year":"1964","journal-title":"Sankhy The Indian J Statist"},{"key":"ref17","first-page":"127","article-title":"Existence of unbiased estimators in sequential binomial experiments","volume":"52","author":"bhandari","year":"1990","journal-title":"Sankhy The Indian J Statist"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/1968466"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/2040864"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01300374"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00135-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324221"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0222052"},{"key":"ref8","author":"schlkopf","year":"2002","journal-title":"Learning with kernels"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-213-7.50017-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-010-9156-z"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-30576-7_20","article-title":"Toward privacy in public databases","volume":"2","author":"chawla","year":"2005","journal-title":"Proc Theory of Cryptogr Conf (TCC) LNCS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833339"},{"key":"ref20","first-page":"2651","article-title":"Universal kernels","volume":"7","author":"micchelli","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref22","author":"rudin","year":"1994","journal-title":"Fourier Analysis on Groups (reprint edition)"},{"key":"ref21","author":"scovel","year":"2010","journal-title":"Radial Kernels and Their Reproducing Kernel Hilbert Spaces"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000000907"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6094243\/06015553.pdf?arnumber=6015553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:49:30Z","timestamp":1633909770000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6015553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":23,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2164053","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}