{"id":"https://openalex.org/W4386075260","doi":"https://doi.org/10.1109/isit54713.2023.10206510","title":"Universal Prediction of m\u2212ary Sequences","display_name":"Universal Prediction of m\u2212ary Sequences","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386075260","doi":"https://doi.org/10.1109/isit54713.2023.10206510"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206510","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5046994049","display_name":"Alankrita Bhatt","orcid":"https://orcid.org/0000-0002-5465-9041"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alankrita Bhatt","raw_affiliation_strings":["Caltech,Department of Computing and Mathematical Sciences","Department of Computing and Mathematical Sciences, Caltech"],"affiliations":[{"raw_affiliation_string":"Caltech,Department of Computing and Mathematical Sciences","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Computing and Mathematical Sciences, Caltech","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046994049"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13689596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2236","last_page":"2241"},"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6578847169876099},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5949826836585999},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5534406900405884},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5414645075798035},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5367644429206848},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.529144823551178},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5274643898010254},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5058843493461609},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.494265079498291},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.4682301878929138},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45659834146499634},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4268028438091278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34662187099456787},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.20185604691505432},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1841941773891449},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17478811740875244},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09775575995445251},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.09703505039215088}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6578847169876099},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5949826836585999},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5534406900405884},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5414645075798035},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5367644429206848},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.529144823551178},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5274643898010254},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5058843493461609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.494265079498291},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.4682301878929138},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45659834146499634},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4268028438091278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34662187099456787},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.20185604691505432},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1841941773891449},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17478811740875244},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09775575995445251},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09703505039215088},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206510","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.550000011920929,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1570963478","https://openalex.org/W1944079109","https://openalex.org/W2102426343","https://openalex.org/W2104334863","https://openalex.org/W2144615604","https://openalex.org/W2180180824","https://openalex.org/W2294584261","https://openalex.org/W2513180554","https://openalex.org/W2513258002","https://openalex.org/W4250589301","https://openalex.org/W4250954493","https://openalex.org/W4287978073","https://openalex.org/W6726272548","https://openalex.org/W6772299385","https://openalex.org/W6783228008"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W2963549154","https://openalex.org/W2158117886","https://openalex.org/W1987803429","https://openalex.org/W1582340598","https://openalex.org/W1519122282","https://openalex.org/W2182731056","https://openalex.org/W3013281356","https://openalex.org/W2740543340"],"abstract_inverted_index":{"Sequential":[0],"prediction":[1,41],"of":[2,25,32],"m\u2212ary":[3],"individual":[4],"sequences":[5],"under":[6],"the":[7,22,30,56,60],"Hamming":[8],"loss,":[9],"where":[10],"m":[11],"\u2265":[12],"2,":[13],"is":[14,42],"studied.":[15],"In":[16],"particular,":[17],"leveraging":[18],"a":[19],"connection":[20],"to":[21,44],"follow-the-regularized-leader":[23],"family":[24],"algorithms":[26],"in":[27],"online":[28],"learning,":[29],"strategy":[31],"Feder,":[33],"Merhav":[34],"and":[35,48,51],"Gutman":[36],"[1]":[37],"for":[38],"binary":[39],"universal":[40],"extended":[43],"arbitrary":[45],"alphabet":[46],"size,":[47],"matching":[49],"upper":[50],"lower":[52],"bounds":[53],"obtained":[54],"on":[55],"regret":[57],"achieved":[58],"by":[59],"aforementioned":[61],"strategy.":[62]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}