{"id":"https://openalex.org/W4377706860","doi":"https://doi.org/10.1109/tit.2023.3279197","title":"Regret Bounds for Log-Loss via Bayesian Algorithms","display_name":"Regret Bounds for Log-Loss via Bayesian Algorithms","publication_year":2023,"publication_date":"2023-05-23","ids":{"openalex":"https://openalex.org/W4377706860","doi":"https://doi.org/10.1109/tit.2023.3279197"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2023.3279197","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2023.3279197","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070167898","display_name":"Changlong Wu","orcid":"https://orcid.org/0000-0001-5255-1275"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Changlong Wu","raw_affiliation_strings":["Center for Science of Information (CSoI), West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0001-5255-1275","affiliations":[{"raw_affiliation_string":"Center for Science of Information (CSoI), West Lafayette, IN, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057495936","display_name":"Mohsen Heidari","orcid":"https://orcid.org/0000-0002-0012-2900"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohsen Heidari","raw_affiliation_strings":["Center for Science of Information (CSoI), West Lafayette, IN, USA","Department of Computer Science, Indiana University, Bloomington, IN, USA"],"raw_orcid":"https://orcid.org/0000-0002-0012-2900","affiliations":[{"raw_affiliation_string":"Center for Science of Information (CSoI), West Lafayette, IN, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Indiana University, Bloomington, IN, USA","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019202832","display_name":"Ananth Grama","orcid":"https://orcid.org/0000-0002-9378-9244"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ananth Grama","raw_affiliation_strings":["Center for Science of Information (CSoI), West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0002-9378-9244","affiliations":[{"raw_affiliation_string":"Center for Science of Information (CSoI), West Lafayette, IN, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019536160","display_name":"Wojciech Szpankowski","orcid":"https://orcid.org/0000-0001-9062-0067"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wojciech Szpankowski","raw_affiliation_strings":["Center for Science of Information (CSoI), West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":"https://orcid.org/0000-0001-9062-0067","affiliations":[{"raw_affiliation_string":"Center for Science of Information (CSoI), West Lafayette, IN, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06066832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"69","issue":"9","first_page":"5971","last_page":"5989"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7341306805610657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5538920164108276},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5151059031486511},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47655823826789856},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.46012306213378906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4100102186203003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40796369314193726},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3238063454627991},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14295881986618042},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12997254729270935}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7341306805610657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5538920164108276},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5151059031486511},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47655823826789856},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.46012306213378906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4100102186203003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40796369314193726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3238063454627991},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14295881986618042},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12997254729270935},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2023.3279197","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2023.3279197","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2067369592","display_name":"OAC Core: Small: Higher Order Solvers for Training Machine Learning Models","funder_award_id":"1908691","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2929866899","display_name":"CCF: Medium: Learning From Classical and Quantum Data: a Fourier Perspective","funder_award_id":"2211423","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8384942595","display_name":"CIF:Small: Towards Information Content of Dynamic Structures","funder_award_id":"2006440","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8572366387","display_name":"Collaborative Research: CIF: Small: Coded String Reconstruction Problems in Molecular Storage","funder_award_id":"2007238","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320320288","display_name":"Rolls-Royce","ror":"https://ror.org/04h08p482"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W18458893","https://openalex.org/W1502929163","https://openalex.org/W1514395077","https://openalex.org/W1518095400","https://openalex.org/W1570963478","https://openalex.org/W1790582767","https://openalex.org/W2013458156","https://openalex.org/W2029922822","https://openalex.org/W2047837509","https://openalex.org/W2057393527","https://openalex.org/W2068782468","https://openalex.org/W2086924628","https://openalex.org/W2096772472","https://openalex.org/W2102098892","https://openalex.org/W2110084720","https://openalex.org/W2114874848","https://openalex.org/W2120127941","https://openalex.org/W2121367301","https://openalex.org/W2122056749","https://openalex.org/W2128941365","https://openalex.org/W2131024393","https://openalex.org/W2139716865","https://openalex.org/W2145566349","https://openalex.org/W2159611450","https://openalex.org/W2294584261","https://openalex.org/W2326587871","https://openalex.org/W2743418195","https://openalex.org/W2795040388","https://openalex.org/W2799193445","https://openalex.org/W2905701627","https://openalex.org/W2912099989","https://openalex.org/W2953246643","https://openalex.org/W2975162820","https://openalex.org/W3004555508","https://openalex.org/W3098445100","https://openalex.org/W3124760902","https://openalex.org/W3128329697","https://openalex.org/W3130367885","https://openalex.org/W3144640969","https://openalex.org/W3207446303","https://openalex.org/W4226132730","https://openalex.org/W4280516861","https://openalex.org/W4287084302","https://openalex.org/W4287365005","https://openalex.org/W4287728434","https://openalex.org/W4289713176","https://openalex.org/W4293334367","https://openalex.org/W4297630244","https://openalex.org/W4297794440","https://openalex.org/W6600730831","https://openalex.org/W6637771017","https://openalex.org/W6674439305","https://openalex.org/W6675241607","https://openalex.org/W6676718341","https://openalex.org/W6678168096","https://openalex.org/W6683719228","https://openalex.org/W6750111029","https://openalex.org/W6750967329","https://openalex.org/W6757735113","https://openalex.org/W6781538685","https://openalex.org/W6789542194","https://openalex.org/W6790133327","https://openalex.org/W6790282179","https://openalex.org/W6790465512","https://openalex.org/W6792642778","https://openalex.org/W6802314846","https://openalex.org/W6810339305","https://openalex.org/W6838409149","https://openalex.org/W6843375651"],"related_works":["https://openalex.org/W4376155396","https://openalex.org/W2971351794","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"We":[0,119,168],"study":[1],"sequential":[2,22],"probability":[3],"assignment":[4],"in":[5,45,91,211],"the":[6,31,42,49,72,86,100,104,121,143,155,171,195,204,207,212],"context":[7],"of":[8,71,112,123,135,145,166,206],"online":[9,117],"learning":[10],"under":[11],"logarithmic":[12],"loss":[13,34],"and":[14,18,54],"obtain":[15,79],"tight":[16,80,128],"lower":[17,96],"upper":[19,57,82],"bounds":[20,58,83,90,130],"for":[21,131],"minimax":[23,26],"regret.":[24],"Sequential":[25],"regret":[27,107,129,144,172],"is":[28,209],"defined":[29],"as":[30],"minimum":[32],"excess":[33],"over":[35,41,65],"data":[36],"horizon$T$that":[37],"a":[38,46,66,109,132,160],"predictor":[39],"incurs":[40],"best":[43,87],"expert":[44,73,136],"class,":[47],"when":[48,154],"samples":[50],"are":[51,59,157],"presented":[52],"sequentially":[53],"adversarially.":[55],"Our":[56],"established":[60],"by":[61,126],"applying":[62],"Bayesian":[63,196],"averaging":[64],"novel":[67,110],"\u201csmooth":[68],"truncated":[69],"covering\u201d":[70],"class.":[74],"This":[75],"allows":[76],"us":[77],"to":[78,102,116,159],"(minimax)":[81],"that":[84,170,194],"subsume":[85],"known":[88],"non-constructive":[89],"an":[92],"algorithmic":[93],"fashion.":[94],"For":[95],"bounds,":[97],"we":[98,140,192],"reduce":[99],"problem":[101],"analyzing":[103],"fixed":[105],"design":[106],"via":[108],"application":[111],"Shtarkov":[113],"sum":[114],"adapted":[115],"learning.":[118],"demonstrate":[120],"effectiveness":[122],"our":[124],"approach":[125,197],"establishing":[127],"wide":[133],"range":[134],"classes.":[137],"In":[138],"particular,":[139],"fully":[141],"characterize":[142],"generalized":[146],"linear":[147],"function":[148],"with":[149],"worst":[150],"Lipschitz":[151],"transform":[152],"functions":[153],"parameters":[156],"restricted":[158],"unit":[161],"norm$\\ell":[162],"_{s}$($s\\ge":[163],"2$)":[164],"ball":[165],"dimension$d$.":[167],"show":[169,193],"grows":[173],"as$\\Theta":[174],"(d\\log":[175],"T)$when$d\\le":[176],"O(T^{s/(s+1)-\\epsilon":[177],"})$for":[178],"all$\\epsilon":[179],">0$(with":[180],"precise":[181],"constant":[182],"1":[183],"when$d\\le":[184],"e^{o(\\log":[185],"T)}$)":[186],"and$\\tilde":[187],"{O}(T^{s/(s+1)})$when$d\\ge":[188],"\\Omega":[189],"(T^{s/(s+1)})$.":[190],"Finally,":[191],"may":[198],"not":[199],"always":[200],"be":[201],"optimal":[202],"if":[203],"support":[205],"prior":[208],"included":[210],"reference":[213],"class":[214],"itself.":[215]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}