{"id":"https://openalex.org/W4289655146","doi":"https://doi.org/10.1109/isit50566.2022.9834738","title":"On Multiple and Hierarchical Universality","display_name":"On Multiple and Hierarchical Universality","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655146","doi":"https://doi.org/10.1109/isit50566.2022.9834738"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834738","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834738","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5005484384","display_name":"Yaniv Fogel","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yaniv Fogel","raw_affiliation_strings":["Tel Aviv University,School of Electrical Engineering","School of Electrical Engineering, Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,School of Electrical Engineering","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066905280","display_name":"Meir Feder","orcid":"https://orcid.org/0000-0002-1290-0482"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Meir Feder","raw_affiliation_strings":["Tel Aviv University,School of Electrical Engineering","School of Electrical Engineering, Tel Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,School of Electrical Engineering","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005484384"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.1041,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.27059204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3013","last_page":"3018"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9894999861717224,"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/universality","display_name":"Universality (dynamical systems)","score":0.7533848285675049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5913875102996826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49424198269844055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43946024775505066},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.43760567903518677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34913066029548645},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17583376169204712}],"concepts":[{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.7533848285675049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5913875102996826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49424198269844055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43946024775505066},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.43760567903518677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34913066029548645},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17583376169204712},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834738","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834738","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1999120268","https://openalex.org/W2102426343","https://openalex.org/W2106596127","https://openalex.org/W2128777897","https://openalex.org/W2129902114","https://openalex.org/W2148574462","https://openalex.org/W2155195660","https://openalex.org/W2163294786","https://openalex.org/W2296087697","https://openalex.org/W2579923771","https://openalex.org/W2886419155","https://openalex.org/W2975162820","https://openalex.org/W3123545922","https://openalex.org/W6682891771","https://openalex.org/W6732517885"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587914261","https://openalex.org/W2065095781","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Universal":[0],"coding,":[1],"prediction":[2],"and":[3,18,94,143],"learning":[4],"usually":[5],"consider":[6],"the":[7,10,19,22,29,39,49,52,70,86,101,115,131,135,138],"case":[8,50],"where":[9,51],"data":[11],"generating":[12],"mechanism":[13],"is":[14,25,55,82],"unknown":[15],"or":[16,41],"non-existent,":[17],"goal":[20],"of":[21,114,137],"universal":[23,112],"scheme":[24],"to":[26,83,107],"compete":[27],"with":[28,63],"best":[30],"hypothesis":[31,35,53,61],"from":[32],"a":[33,43,127,145],"given":[34],"class,":[36],"either":[37],"on":[38],"average":[40],"in":[42],"worst-case":[44],"scenario.":[45],"Multiple":[46],"universality":[47,87],"considers":[48],"class":[54],"also":[56,118],"unknown:":[57],"there":[58],"are":[59,73],"several":[60,91],"classes":[62,72],"possibly":[64],"different":[65],"complexities.":[66],"In":[67],"hierarchical":[68],"universality,":[69],"simpler":[71],"nested":[74],"within":[75],"more":[76],"complex":[77],"classes.":[78],"The":[79],"main":[80],"challenge":[81],"correctly":[84],"define":[85],"problem.":[88],"We":[89,117],"propose":[90],"possible":[92],"definitions":[93],"derive":[95],"their":[96],"min-max":[97],"optimal":[98],"solutions.":[99],"Interestingly,":[100],"proposed":[102],"solutions":[103],"can":[104],"be":[105],"used":[106],"obtain":[108],"Elias":[109],"codes":[110],"for":[111,122,130],"representation":[113],"integers.":[116],"utilize":[119],"this":[120],"approach":[121],"variable-memory":[123],"Markov":[124],"models,":[125],"presenting":[126],"new":[128],"interpretation":[129],"known":[132],"bound":[133],"over":[134],"regret":[136],"celebrated":[139],"context-tree":[140],"weighting":[141],"algorithm":[142],"proposing":[144],"3-part":[146],"code":[147],"that":[148],"(slightly)":[149],"out-performs":[150],"it.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}