{"id":"https://openalex.org/W2903586563","doi":"https://doi.org/10.1145/3186563","title":"Fast Learning Requires Good Memory","display_name":"Fast Learning Requires Good Memory","publication_year":2018,"publication_date":"2018-12-12","ids":{"openalex":"https://openalex.org/W2903586563","doi":"https://doi.org/10.1145/3186563","mag":"2903586563"},"language":"en","primary_location":{"id":"doi:10.1145/3186563","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3186563","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3186563","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3186563","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":["Princeton University, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","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":1.4742,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.86989925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"66","issue":"1","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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.9966999888420105,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940000176429749,"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/learning-with-errors","display_name":"Learning with errors","score":0.7206517457962036},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6176908016204834},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.4868280291557312},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4804055988788605},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4789991080760956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47213584184646606},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4530760943889618},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4454857110977173},{"id":"https://openalex.org/keywords/ciphertext","display_name":"Ciphertext","score":0.4433193802833557},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42725902795791626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4118741750717163},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3705539107322693},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.36356988549232483},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34687870740890503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30000483989715576}],"concepts":[{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.7206517457962036},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6176908016204834},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.4868280291557312},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4804055988788605},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4789991080760956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47213584184646606},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4530760943889618},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4454857110977173},{"id":"https://openalex.org/C93974786","wikidata":"https://www.wikidata.org/wiki/Q1589480","display_name":"Ciphertext","level":3,"score":0.4433193802833557},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42725902795791626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4118741750717163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3705539107322693},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.36356988549232483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34687870740890503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30000483989715576},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3186563","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3186563","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3186563","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3186563","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3186563","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3186563","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1943969787","display_name":null,"funder_award_id":"CCF-1412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2433323164","display_name":null,"funder_award_id":"1402/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G3480968047","display_name":null,"funder_award_id":"CCF-1412958 and CCF-1714779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G57144956","display_name":"AF: Small: Lower Bounds for Computational Models, and Relations to Other Topics in Computational Complexity","funder_award_id":"1714779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G882115978","display_name":"AF: Large: Theory of Computation - Pushing the State-of-the-Art","funder_award_id":"1412958","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/F4320320946","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"},{"id":"https://openalex.org/F4320335375","display_name":"Planning and Budgeting Committee of the Council for Higher Education of Israel","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2903586563.pdf","grobid_xml":"https://content.openalex.org/works/W2903586563.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1530248577","https://openalex.org/W1585065779","https://openalex.org/W1882041575","https://openalex.org/W1968372742","https://openalex.org/W1975124543","https://openalex.org/W2001736707","https://openalex.org/W2013539671","https://openalex.org/W2015895898","https://openalex.org/W2023694859","https://openalex.org/W2075449032","https://openalex.org/W2104952158","https://openalex.org/W2104965768","https://openalex.org/W2119615542","https://openalex.org/W2133817484","https://openalex.org/W2140270919","https://openalex.org/W2155166173","https://openalex.org/W2274292897","https://openalex.org/W2465504090","https://openalex.org/W2612879297","https://openalex.org/W2626222921","https://openalex.org/W2742151425","https://openalex.org/W2769279287","https://openalex.org/W2783378791","https://openalex.org/W2807842458","https://openalex.org/W2962750290","https://openalex.org/W2962929471","https://openalex.org/W2963144647","https://openalex.org/W2963312284","https://openalex.org/W2964181194","https://openalex.org/W4240781210","https://openalex.org/W4297731399","https://openalex.org/W6706044889"],"related_works":["https://openalex.org/W2765793266","https://openalex.org/W2739694080","https://openalex.org/W2550942574","https://openalex.org/W2315723423","https://openalex.org/W2195479001","https://openalex.org/W2944613252","https://openalex.org/W1874619058","https://openalex.org/W3180243976","https://openalex.org/W2951404390","https://openalex.org/W3149951253"],"abstract_inverted_index":{"We":[0,115,177,191],"prove":[1],"that":[2,33,117,123,196,254],"any":[3,118,153],"algorithm":[4,119],"for":[5,34,120,152,270],"learning":[6,36,122,154],"parities":[7],"requires":[8,133,197],"either":[9],"a":[10,23,38,71,76,83,92,108,198],"memory":[11,132,160,234,256],"of":[12,19,26,49,73,107,131,137,149,182,188,201,210,214,246],"quadratic":[13],"size":[14,161,257],"or":[15],"an":[16,52,134,180,193,243],"exponential":[17,135,244],"number":[18,136,148,245],"samples.":[20,138],"This":[21],"proves":[22],"recent":[24],"conjecture":[25],"Steinhardt":[27],"et":[28],"al.":[29],"(2016)":[30],"and":[31,100,110,217,220,236],"shows":[32],"some":[35],"problems,":[37],"large":[39],"storage":[40],"space":[41,171],"is":[42,94,103,162,169,218,239,262],"crucial.":[43],"More":[44],"formally,":[45],"in":[46,185,266],"the":[47,104,147,158,170,186,226,237,255,260,267],"problem":[48],"parity":[50,121],"learning,":[51],"unknown":[53],"string":[54],"x":[55,69,111],"\u2208":[56],"{0,1}":[57,98],"n":[58,99,127,165,168,203,211,231],"was":[59,141],"chosen":[60],"uniformly":[61,95],"at":[62,241,263],"random.":[63],"A":[64],"learner":[65],"tries":[66],"to":[67,173],"learn":[68],"from":[70],"stream":[72],"samples":[74,150],"(":[75,82,164],"1":[77,80],",":[78,85,112,204],"b":[79,86,101],"),":[81],"2":[84,87,128,232],")":[88,166],"\u2026,":[89],"where":[90],"each":[91,215],"t":[93,102,109],"distributed":[96],"over":[97],"inner":[105],"product":[106],"modulo":[113],"2.":[114],"show":[116,192],"uses":[124,228],"less":[125,229],"than":[126,230],"/25":[129,233],"bits":[130,235],"Previously,":[139],"there":[140],"no":[142],"non-trivial":[143],"lower":[144],"bound":[145],"on":[146,250],"needed":[151,172,269],"problem,":[155],"even":[156],"if":[157],"allowed":[159],"O":[163],"(where":[167],"store":[174],"one":[175],"sample).":[176],"also":[178],"give":[179],"application":[181],"our":[183],"result":[184],"field":[187],"bounded-storage":[189,251],"cryptography.":[190],"encryption":[194],"scheme":[195,238],"private":[199],"key":[200],"length":[202],"as":[205,207,223,225],"well":[206],"time":[208,268],"complexity":[209],"per":[212],"encryption/decryption":[213],"bit,":[216],"provably":[219],"unconditionally":[221],"secure":[222],"long":[224],"attacker":[227,261],"used":[240,258],"most":[242,264],"times.":[247],"Previous":[248],"works":[249],"cryptography":[252],"assumed":[253],"by":[259],"linear":[265],"encryption/decryption.":[271]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}