{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:26:53Z","timestamp":1761719213401,"version":"3.37.3"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Center for Science of Information","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2006440","CCF-2007238","CCF-2211423","OAC-1908691"],"award-info":[{"award-number":["CCF-2006440","CCF-2007238","CCF-2211423","OAC-1908691"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google Research Grant","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000767","name":"Rolls-Royce","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000767","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1109\/tit.2023.3279197","type":"journal-article","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T18:23:29Z","timestamp":1684866209000},"page":"5971-5989","source":"Crossref","is-referenced-by-count":1,"title":["Regret Bounds for Log-Loss via Bayesian Algorithms"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5255-1275","authenticated-orcid":false,"given":"Changlong","family":"Wu","sequence":"first","affiliation":[{"name":"Center for Science of Information (CSoI), West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0012-2900","authenticated-orcid":false,"given":"Mohsen","family":"Heidari","sequence":"additional","affiliation":[{"name":"Center for Science of Information (CSoI), West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9378-9244","authenticated-orcid":false,"given":"Ananth","family":"Grama","sequence":"additional","affiliation":[{"name":"Center for Science of Information (CSoI), West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9062-0067","authenticated-orcid":false,"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Center for Science of Information (CSoI), West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"755","article-title":"Precise minimax regret for logistic regression with categorical feature values","volume":"132","author":"jacquet","year":"2021","journal-title":"Proceedings Algorithmic Learning Theory (ALT)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834776"},{"key":"ref15","first-page":"1984","article-title":"Online learning: Random averages, combinatorial parameters, and learnability","volume":"23","author":"rakhlin","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref14","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems Inf Transmiss"},{"key":"ref52","article-title":"Expected worst case regret via stochastic sequential covering","author":"wu","year":"2022","journal-title":"arXiv 2209 04417"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref10","first-page":"647","article-title":"Minimax redundancy for the class of memoryless sources","volume":"43","author":"xie","year":"1997","journal-title":"IEEE Trans Inf Theory"},{"key":"ref17","first-page":"919","article-title":"Tight bounds on minimax regret under logarithmic loss via self-concordance","author":"bilodeau","year":"2020","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref16","article-title":"Agnostic online learning","volume":"3","author":"ben-david","year":"2009","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref19","first-page":"197","article-title":"Logistic regression: Tight bounds for stochastic and online optimization","author":"hazan","year":"2014","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834809"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713820"},{"key":"ref50","article-title":"Local and global uniform convexity conditions","author":"kerdreux","year":"2021","journal-title":"arXiv 2102 05134"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.2307\/30044198"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1934-05978-0"},{"key":"ref48","first-page":"155","article-title":"Online learning via sequential complexities","volume":"16","author":"rakhlin","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref47","first-page":"4464","article-title":"Scale-free unconstrained online learning for curved losses","author":"mayo","year":"2022","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref42","first-page":"26903","article-title":"Precise regret bounds for log-loss via a truncated Bayesian algorithm","volume":"35","author":"wu","year":"2022","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735799"},{"key":"ref44","volume":"48","author":"wainwright","year":"2019","journal-title":"High-dimensional statistics A non-asymptotic viewpoint"},{"key":"ref43","article-title":"Low complexity approximate Bayesian logistic regression for sparse online learning","author":"shamir","year":"2021","journal-title":"arXiv 2101 12113"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-013-0545-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872846"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"},{"key":"ref9","first-page":"55","article-title":"On asymptotics of certain recurrences arising in universal coding","volume":"34","author":"szpankowski","year":"1998","journal-title":"Problems Inf Transmiss"},{"key":"ref4","first-page":"3296","article-title":"Logistic regression regret: What’s the catch?","author":"shamir","year":"2020","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref3","first-page":"167","article-title":"Logistic regression: The importance of being improper","author":"foster","year":"2018","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834734"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462848"},{"key":"ref35","article-title":"Universal supervised learning for individual data","author":"fogel","year":"2018","journal-title":"arXiv 1812 09520"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279950"},{"key":"ref37","first-page":"340","article-title":"Sequential prediction under log-loss with side information","author":"bhatt","year":"2021","journal-title":"Proceedings Algorithmic Learning Theory (ALT)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849222"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(94)90153-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804115"},{"key":"ref33","article-title":"MDL procedures with ? 1 penalty and their statistical risk","author":"barron","year":"2008","journal-title":"Proc Workshop Inf Theoretic Methods Sci Eng"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.720554"},{"key":"ref2","article-title":"Sequential probability assignment with binary alphabets and large classes of experts","author":"rakhlin","year":"2015","journal-title":"arXiv 1501 07340"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref39","first-page":"1937","article-title":"Sequential prediction under log-loss and misspecification","author":"feder","year":"2021","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref38","first-page":"753","article-title":"Sequential prediction with coded side information under logarithmic loss","author":"shkel","year":"2018","journal-title":"Proceedings Algorithmic Learning Theory (ALT)"},{"key":"ref24","first-page":"1232","article-title":"Online nonparametric regression with general loss function","author":"rakhlin","year":"2014","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010848128995"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref25","article-title":"Minimax rates for conditional density estimation via empirical entropy","author":"bilodeau","year":"2021","journal-title":"arXiv 2109 10461"},{"key":"ref20","first-page":"641","article-title":"Online bounds for Bayesian algorithms","author":"kakade","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1111\/j.1751-5823.2001.tb00457.x"},{"key":"ref21","first-page":"23692","article-title":"Mixability made efficient: Fast online multiclass logistic regression","volume":"34","author":"j\u00e9z\u00e9quel","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195769"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.556596"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10225323\/10131912-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10225323\/10131912.pdf?arnumber=10131912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T18:02:06Z","timestamp":1694455326000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10131912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":52,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3279197","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,9]]}}}