{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:41Z","timestamp":1773377981603,"version":"3.50.1"},"reference-count":35,"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.9834809","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"444-449","source":"Crossref","is-referenced-by-count":1,"title":["Precise Minimax Regret for Logistic Regression"],"prefix":"10.1109","author":[{"given":"Philippe","family":"Jacquet","sequence":"first","affiliation":[{"name":"INRIA,France"}]},{"given":"Gil I.","family":"Shamir","sequence":"additional","affiliation":[{"name":"Google,Pittsburgh,PA,USA"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Purdue University,Dept. Computer Science"}]}],"member":"263","reference":[{"key":"ref33","first-page":"647","article-title":"Minimax redundancy for the class of memoryless sources","author":"xie","year":"1997","journal-title":"IEEE Trans Information Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834776"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195769"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770"},{"key":"ref35","first-page":"32","article-title":"Minimax relative loss analysis for sequential prediction algorithms using parametric hypotheses","author":"yamanishi","year":"1988","journal-title":"COLT"},{"key":"ref34","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":"ref10","first-page":"287","article-title":"The convex optimization approach to regret minimization","author":"hazan","year":"2012","journal-title":"Optimization for Machine Learning"},{"key":"ref11","first-page":"197","article-title":"Logistic regression: Tight bounds for stochastic and online optimization","author":"hazan","year":"2014","journal-title":"The 27th Conference on Learning Theory COLT 2014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2014.06.011"},{"key":"ref13","article-title":"Precise minimax regret for logistic regression with categorical feature values","author":"jacquet","year":"2021","journal-title":"ALT’21"},{"key":"ref14","author":"jacquet","year":"2022","journal-title":"Precise minimax regret for logistic regression"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511843204"},{"key":"ref16","first-page":"641","article-title":"Online bounds for bayesian algorithms","volume":"17","author":"kakade","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref18","article-title":"Open problem: Better bounds for online logistic regression","volume":"23","author":"mcmahan","year":"2012","journal-title":"Journal of Machine Learning Research-Proceedings Track"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834734"},{"key":"ref28","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems of Information Transmission"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.556596"},{"key":"ref27","first-page":"1","article-title":"Logistic regression regret: What’s the catch?","author":"shamir","year":"2020","journal-title":"COLT"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836702"},{"key":"ref29","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":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804115"},{"key":"ref7","author":"flajolet","year":"2008","journal-title":"Analytic Combinatorics"},{"key":"ref2","author":"billingsley","year":"1968","journal-title":"Convergence of Probability Measures"},{"key":"ref9","article-title":"Logistic regression: The importance of being improper","author":"foster","year":"2018","journal-title":"Conference on Learning Theory COLT\/KW"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720554"},{"key":"ref20","first-page":"1232","article-title":"Online nonparametric regression","author":"rakhlin","year":"2014","journal-title":"COLT"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"ref21","author":"rakhlin","year":"2015","journal-title":"Sdquential probability assignment with binary alphabet and large class of experts"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref23","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":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872846"},{"key":"ref25","article-title":"A general lower bound for regret in logistic regression","author":"shamir","year":"2021","journal-title":"ISIT"}],"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\/09834809.pdf?arnumber=9834809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:46Z","timestamp":1773347746000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834809\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834809","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}