{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:45:46Z","timestamp":1778564746788,"version":"3.51.4"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"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"]}]},{"name":"NSF","award":["CCF-2006440"],"award-info":[{"award-number":["CCF-2006440"]}]},{"name":"NSF","award":["CCF-2211423"],"award-info":[{"award-number":["CCF-2211423"]}]},{"name":"Google Research Grant"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tit.2025.3604599","type":"journal-article","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:30:33Z","timestamp":1756755033000},"page":"8753-8776","source":"Crossref","is-referenced-by-count":1,"title":["Precise Regularized Minimax Regret With Unbounded Weights"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6876-6569","authenticated-orcid":false,"given":"Michael","family":"Drmota","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7919-1206","authenticated-orcid":false,"given":"Philippe","family":"Jacquet","sequence":"additional","affiliation":[{"name":"INRIA, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5255-1275","authenticated-orcid":false,"given":"Changlong","family":"Wu","sequence":"additional","affiliation":[{"name":"Purdue University, 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":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001"},{"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":"ref3","article-title":"Logistic regression: The importance of being improper","volume-title":"Proc. COLT Conf. Learn. Theory","author":"Foster"},{"key":"ref4","article-title":"Precise regret bounds for log-loss via a truncated Bayesian algorithm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3279197"},{"key":"ref6","first-page":"755","article-title":"Precise minimax regret for logistic regression with categorical feature values","volume-title":"Proc. PRML: ALT","author":"Jacquet"},{"key":"ref7","first-page":"197","article-title":"Logistic regression: Tight bounds for stochastic and online optimization","volume-title":"Proc. Conf. Learn. Theory (COLT)","author":"Hazan"},{"key":"ref8","first-page":"3296","article-title":"Logistic regression regret: What\u2019s the catch?","volume-title":"Proc. Conf. Learn. Theory","author":"Shamir"},{"key":"ref9","article-title":"Efficient transductive online learning via randomized rounding","author":"Cesa-Bianchi","year":"2011","journal-title":"arXiv:1106.2429"},{"key":"ref10","article-title":"Expected worst case regret via stochastic sequential covering","author":"Wu","year":"2022","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619327"},{"key":"ref12","article-title":"Efficient improper learning for online logistic regression","volume-title":"Proc. PMLR","author":"J\u00e9z\u00e9quel"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/8996.003.0012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.720554"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691254"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/9781108565462"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830765"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195769"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.556120"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref21","first-page":"1","article-title":"Scale-free unconstrained online learning for curved losses","volume-title":"Proc. COLT","author":"Mayo"},{"key":"ref22","first-page":"2305","article-title":"Minimax regret with unbounded weights","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Drmota"},{"key":"ref23","article-title":"Refined risk bounds for unbounded losses via transductive priors","author":"Qian","year":"2024","journal-title":"arXiv:2410.21621"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511801655"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770"},{"key":"ref26","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":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804115"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3390\/psf2022005047"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198534662.001.0001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11220181\/11145886-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11220181\/11145886.pdf?arnumber=11145886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T17:33:22Z","timestamp":1761759202000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11145886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":29,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3604599","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}