{"id":"https://openalex.org/W2594917320","doi":"https://doi.org/10.1109/focs.2017.73","title":"A Time-Space Lower Bound for a Large Class of Learning Problems","display_name":"A Time-Space Lower Bound for a Large Class of Learning Problems","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2594917320","doi":"https://doi.org/10.1109/focs.2017.73","mag":"2594917320"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2017.73","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2017.73","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Department of Computer Science, Princeton University","Princeton University, Princeton, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, United States","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041545934"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01184639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"732","last_page":"742"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9958000183105469,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9829999804496765,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6631745100021362},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6539804935455322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6495636701583862},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4896126389503479},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.4748176336288452},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4608757793903351},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4438774883747101},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4396848678588867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13537198305130005},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11216673254966736},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10890910029411316}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6631745100021362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6539804935455322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6495636701583862},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4896126389503479},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.4748176336288452},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4608757793903351},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4438774883747101},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4396848678588867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13537198305130005},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11216673254966736},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10890910029411316},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/focs.2017.73","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2017.73","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},{"id":"mag:2594917320","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc24.html#Raz17","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1965748471","https://openalex.org/W1995897489","https://openalex.org/W2117822564","https://openalex.org/W2126420649","https://openalex.org/W2130270608","https://openalex.org/W2140283251","https://openalex.org/W2143355494","https://openalex.org/W2546502841","https://openalex.org/W2626222921","https://openalex.org/W2769279287","https://openalex.org/W4297970684","https://openalex.org/W6706044889","https://openalex.org/W6734580401","https://openalex.org/W6742340546","https://openalex.org/W6742478134","https://openalex.org/W6743019288"],"related_works":["https://openalex.org/W1531090979","https://openalex.org/W2522686578","https://openalex.org/W2047430913","https://openalex.org/W3098011928","https://openalex.org/W98320937","https://openalex.org/W2937819376","https://openalex.org/W1996947585","https://openalex.org/W2165383866","https://openalex.org/W314096538","https://openalex.org/W2963488736","https://openalex.org/W2112438147","https://openalex.org/W2018175710","https://openalex.org/W2007732780","https://openalex.org/W3197412015","https://openalex.org/W3041151068","https://openalex.org/W2049947556","https://openalex.org/W3083750962","https://openalex.org/W3183682236","https://openalex.org/W2949394968","https://openalex.org/W1706616850"],"abstract_inverted_index":{"We":[0,139],"prove":[1],"a":[2,10,30,100,157,174,179],"general":[3],"memory-samples":[4,184],"lower":[5,185],"bound":[6,186],"that":[7,18,23,53,134,141],"applies":[8],"for":[9,19,110,150,182,187],"large":[11],"class":[12],"of":[13,32,39,47,50,102,130,159],"learning":[14,26,57,80,148,153,189],"problems":[15],"and":[16,120,132],"shows":[17],"every":[20,111],"problem":[21,154],"in":[22,45],"class,":[24],"any":[25,147],"algorithm":[27,149],"requires":[28,155],"either":[29,156],"memory":[31,158],"quadratic":[33],"size":[34,160],"or":[35,165],"an":[36],"exponential":[37],"number":[38],"samples.":[40],"Our":[41],"result":[42],"is":[43,115],"stated":[44],"terms":[46],"the":[48,51,56,78,126,151,183],"norm":[49],"matrix":[52,67],"corresponds":[54,76],"to":[55,77,96],"problem.":[58],"Let":[59,124],"X,":[60],"A":[61,66,70,93,114],"be":[62],"two":[63],"finite":[64],"sets.":[65],"M":[68,131],":":[69],"\u00d7":[71],"X":[72,87],"\u2192":[73],"{-1,":[74],"1}":[75],"following":[79],"problem:":[81],"An":[82],"unknown":[83],"element":[84],"x":[85,98],"\u2208":[86],"was":[88],"chosen":[89,116],"uniformly":[90,117],"at":[91,118,161,166],"random.":[92],"learner":[94],"tries":[95],"learn":[97],"from":[99],"stream":[101],"samples,":[103],"(a1,":[104],"b1),":[105],"(a2,":[106],"b2)":[107],"...,":[108],"where":[109,169],"i,":[112],"ai\u2208":[113],"random":[119],"bi=":[121],"M(ai,":[122],"x).":[123],"\u03c3maxbe":[125],"largest":[127],"singular":[128],"value":[129],"note":[133],"always":[135],"\u03c3max\u2264":[136,143],"|A|1/2\u00b7":[137,144],"|X|1/2.":[138],"show":[140],"if":[142],"|X|1/2-\u03b5,":[145],"then":[146],"corresponding":[152],"least":[162,167],"\u03a9":[163],"((\u03b5n)2)":[164],"2\u03a9(\u03b5n)samples,":[168],"n":[170],"=":[171],"log2|X|.":[172],"As":[173],"special":[175],"case,":[176],"this":[177],"gives":[178],"new":[180],"proof":[181],"parity":[188],"[14].":[190]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}