{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:47Z","timestamp":1773377747912,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834776","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"438-443","source":"Crossref","is-referenced-by-count":2,"title":["Sequential vs. Fixed Design Regrets in Online Learning"],"prefix":"10.1109","author":[{"given":"Changlong","family":"Wu","sequence":"first","affiliation":[{"name":"Purdue University,CSoI"}]},{"given":"Mohsen","family":"Heidari","sequence":"additional","affiliation":[{"name":"Purdue University,CSoI"}]},{"given":"Ananth","family":"Grama","sequence":"additional","affiliation":[{"name":"Purdue University,CSoI"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Purdue University,CSoI"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834734"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/18.481776","article-title":"Fisher information and stochastic complexity","volume":"42","author":"rissanen","year":"1996","journal-title":"IEEE Trans Information Theory"},{"key":"ref14","article-title":"Efficient transductive online learning via randomized rounding","author":"cesa-bianchi","year":"2011"},{"key":"ref15","article-title":"Online learning: Random averages, combinatorial parameters, and learnability","volume":"23","author":"rakhlin","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451041"},{"key":"ref17","article-title":"Sequential probability assignment with binary alphabets and large classes of experts","author":"rakhlin","year":"2015"},{"key":"ref18","first-page":"755","article-title":"Precise minimax regret for logistic regression with categorical feature values","author":"jacquet","year":"2021","journal-title":"Algorithmic Learning Theory"},{"key":"ref19","first-page":"3296","article-title":"Logistic regression regret: What’s the catch?","author":"shamir","year":"2020","journal-title":"Conference on Learning Theory"},{"key":"ref4","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems of Information Transmission"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872846"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195769"},{"key":"ref5","first-page":"55","article-title":"On asymptotics of certain recurrences arising in universal coding","volume":"34","author":"szpankowski","year":"1998","journal-title":"Problems of Information Transmission"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/18.825803","article-title":"Asymptotic minimax regret for data compression, gambling, and prediction","volume":"46","author":"xie","year":"2000","journal-title":"IEEE Trans Information Theory"},{"key":"ref7","first-page":"647","article-title":"Minimax redundancy for the class of memoryless sources","author":"xie","year":"1997","journal-title":"IEEE Trans Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref20","first-page":"919","article-title":"Tight bounds on minimax regret under logarithmic loss via self-concordance","author":"bilodeau","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258616"},{"key":"ref21","article-title":"Online bounds for bayesian algorithms","volume":"17","author":"kakade","year":"2004","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834776.pdf?arnumber=9834776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:03Z","timestamp":1773347703000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834776\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834776","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}