{"id":"https://openalex.org/W4289713241","doi":"https://doi.org/10.1109/isit50566.2022.9834457","title":"Finite Littlestone Dimension Implies Finite Information Complexity","display_name":"Finite Littlestone Dimension Implies Finite Information Complexity","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713241","doi":"https://doi.org/10.1109/isit50566.2022.9834457"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834457","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":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/298763","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049487586","display_name":"Aditya Pradeep","orcid":"https://orcid.org/0000-0001-5500-4306"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Aditya Pradeep","raw_affiliation_strings":["EPFL,School of Computer and Communication Sciences,Lausanne,Switzerland","School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL,School of Computer and Communication Sciences,Lausanne,Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089079846","display_name":"Ido Nachum","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ido Nachum","raw_affiliation_strings":["EPFL,School of Computer and Communication Sciences,Lausanne,Switzerland","School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL,School of Computer and Communication Sciences,Lausanne,Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063528341","display_name":"Michael Gastpar","orcid":"https://orcid.org/0000-0002-5499-5336"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Michael Gastpar","raw_affiliation_strings":["EPFL,School of Computer and Communication Sciences,Lausanne,Switzerland","School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL,School of Computer and Communication Sciences,Lausanne,Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049487586"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":0.1039,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.27170868,"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":"3055","last_page":"3060"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dimension","display_name":"Dimension (graph theory)","score":0.7096461653709412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6232196688652039},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5917515754699707},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5871161818504333},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.5861416459083557},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5044950246810913},{"id":"https://openalex.org/keywords/vc-dimension","display_name":"VC dimension","score":0.4851416051387787},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.48024824261665344},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4520799517631531},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4448535144329071},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43836721777915955},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4154483377933502},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.365123450756073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32240620255470276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31912699341773987},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.22583535313606262},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16030040383338928}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7096461653709412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6232196688652039},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5917515754699707},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5871161818504333},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.5861416459083557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5044950246810913},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.4851416051387787},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.48024824261665344},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4520799517631531},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4448535144329071},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43836721777915955},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4154483377933502},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.365123450756073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32240620255470276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31912699341773987},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.22583535313606262},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16030040383338928},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit50566.2022.9834457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834457","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"},{"id":"pmh:oai:infoscience.epfl.ch:298763","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/298763","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:298763","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/298763","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5799999833106995}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W2103012681","https://openalex.org/W2129104108","https://openalex.org/W2154952480","https://openalex.org/W2617539226","https://openalex.org/W2785170103","https://openalex.org/W2910589063","https://openalex.org/W2963384289","https://openalex.org/W2963486588","https://openalex.org/W2979452771","https://openalex.org/W3038014551","https://openalex.org/W3100231902","https://openalex.org/W3126291038","https://openalex.org/W3170524081","https://openalex.org/W3172092965","https://openalex.org/W3197262663","https://openalex.org/W4236362309","https://openalex.org/W4238284510","https://openalex.org/W4238893454","https://openalex.org/W4246994868","https://openalex.org/W4293583552","https://openalex.org/W4300167521","https://openalex.org/W6738074204","https://openalex.org/W6748601875","https://openalex.org/W6772932235","https://openalex.org/W6780309617","https://openalex.org/W7034108470"],"related_works":["https://openalex.org/W2391321755","https://openalex.org/W140666874","https://openalex.org/W2022655107","https://openalex.org/W1970586498","https://openalex.org/W4401134165","https://openalex.org/W2149321764","https://openalex.org/W4399309658","https://openalex.org/W2135930180","https://openalex.org/W2144970024","https://openalex.org/W2461671499"],"abstract_inverted_index":{"We":[0,51],"prove":[1],"that":[2],"every":[3],"online":[4,62],"learnable":[5,63],"class":[6],"of":[7,9,28,37,67,70],"functions":[8,66],"Littlestone":[10],"dimension":[11,71],"d":[12],"admits":[13],"a":[14,29,39,60],"learning":[15],"algorithm":[16,42],"with":[17],"finite":[18],"information":[19,35,74],"complexity.":[20],"Towards":[21],"this":[22],"end,":[23],"we":[24],"use":[25],"the":[26,34,73],"notion":[27],"globally":[30,40],"stable":[31,41],"algorithm.":[32],"Generally,":[33],"complexity":[36,75],"such":[38],"is":[43,55],"large":[44],"yet":[45],"finite,":[46],"roughly":[47],"exponential":[48],"in":[49,81],"d.":[50,82],"also":[52],"show":[53],"there":[54],"room":[56],"for":[57,59],"improvement;":[58],"canonical":[61],"class,":[64],"indicator":[65],"affine":[68],"subspaces":[69],"d,":[72],"can":[76],"be":[77],"upper":[78],"bounded":[79],"logarithmically":[80]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}