{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:25:29Z","timestamp":1740147929218,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-12-1-0998"],"award-info":[{"award-number":["N00014-12-1-0998"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/jstsp.2015.2496911","type":"journal-article","created":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T20:46:54Z","timestamp":1446497214000},"page":"256-269","source":"Crossref","is-referenced-by-count":1,"title":["Online Optimization Under Adversarial Perturbations"],"prefix":"10.1109","volume":"10","author":[{"given":"Mehmet A.","family":"Donmez","sequence":"first","affiliation":[]},{"given":"Maxim","family":"Raginsky","sequence":"additional","affiliation":[]},{"given":"Andrew C.","family":"Singer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/5.752515"},{"key":"ref32","first-page":"97","volume":"3","author":"hannan","year":"1957","journal-title":"Contributions to the Theory of Games"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref31"},{"journal-title":"Statistical Mechanics","year":"2000","author":"mcquarrie","key":"ref30"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3071-5","author":"robert","year":"1999","journal-title":"Monte Carlo Statistical Methods"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.806989"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258179"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.705569"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/267460.267518"},{"key":"ref14","first-page":"423","article-title":"Efficient algorithms for universal portfolios","volume":"3","author":"kalai","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.243445"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.312161"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.945240"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.7551\/mitpress\/8996.003.0012","author":"hazan","year":"2011","journal-title":"Optimization and Machine Learning"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref28","first-page":"1503","article-title":"Online bandit learning against an adaptive adversary: From regret to policy regret","author":"arora","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926457"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref6","first-page":"1265","article-title":"Convex repeated games and Fenchel duality","author":"shalev-shwartz","year":"2007","journal-title":"Proc 21st Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref29","first-page":"1160","article-title":"Online learning with switching costs and other adaptive adversaries","author":"cesa-bianchi","year":"2013","journal-title":"Proc 27th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref5","first-page":"499","article-title":"Logarithmic regret algorithms for online convex optimization","author":"hazan","year":"2006","journal-title":"Proc 19th Ann Conf Learning Theory (COLT)"},{"key":"ref8","first-page":"263","article-title":"Competing in the dark: An efficient algorithm for bandit linear optimization","author":"abernethy","year":"2008","journal-title":"Proc of the Annual Conf on Learning Theory (COLT)"},{"key":"ref7","first-page":"415","article-title":"Optimal strategies and minimax lower bounds for online convex games","author":"abernethy","year":"2008","journal-title":"Proc of the Annual Conf on Learning Theory (COLT)"},{"journal-title":"Efficient algorithms for online convex optimization and their applications","year":"2006","author":"hazan","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"ref1","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 20th Int Conf Mach Learning (ICML)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116827"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0740"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9965.1991.tb00002.x"},{"key":"ref24","first-page":"100","article-title":"The minimax strategy for Gaussian density estimation","author":"takimoto","year":"2000","journal-title":"Proc Annu Conf Computational Learning Theory (COLT)"},{"key":"ref23","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":"ref26","article-title":"Efficient sampling from time-varying log-concave distributions","author":"narayanan","year":"2013","journal-title":"ArXiv Preprint"},{"key":"ref25","first-page":"1777","article-title":"Random walk approach to regret minimization","author":"narayanan","year":"2010","journal-title":"Proc 23rd Annu Conf Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7406776\/7314886.pdf?arnumber=7314886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:23:47Z","timestamp":1718169827000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7314886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2015.2496911","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"type":"print","value":"1932-4553"},{"type":"electronic","value":"1941-0484"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}