{"id":"https://openalex.org/W2396728331","doi":null,"title":"Memory, Communication, and Statistical Queries","display_name":"Memory, Communication, and Statistical Queries","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2396728331","mag":"2396728331"},"language":"en","primary_location":{"id":"mag:2396728331","doi":null,"is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2015/126","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},"volume":null,"type":"preprint","indexed_in":[],"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/A5060196069","display_name":"Jacob Steinhardt","orcid":"https://orcid.org/0000-0002-0257-3860","observed_orcids":["https://orcid.org/0000-0002-0257-3860"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jacob Steinhardt","raw_affiliation_strings":["Stanford University ()"],"raw_orcid":"https://orcid.org/0000-0002-0257-3860","affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079503799","display_name":"Gregory J. Valiant","orcid":"https://orcid.org/0000-0002-2211-1073","observed_orcids":["https://orcid.org/0000-0002-2211-1073"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gregory Valiant","raw_affiliation_strings":["Stanford University ()"],"raw_orcid":"https://orcid.org/0000-0002-2211-1073","affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089493027","display_name":"Stefan Wager","orcid":"https://orcid.org/0000-0002-7526-9077","observed_orcids":["https://orcid.org/0000-0002-7526-9077"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stefan Wager","raw_affiliation_strings":["Stanford University ()"],"raw_orcid":"https://orcid.org/0000-0002-7526-9077","affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":null,"first_page":"126","last_page":"1516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.7354000210762024,"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.7354000210762024,"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.1859000027179718,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.015699999406933784,"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/statistical-query-model","display_name":"statistical query model","score":0.7120000123977661},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"sample complexity","score":0.9589999914169312},{"id":"https://openalex.org/keywords/sparse-linear-regression","display_name":"sparse linear regression","score":0.9649999737739563},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7179999947547913},{"id":"https://openalex.org/keywords/upper-bounds","display_name":"upper bounds","score":0.8730000257492065}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7599446773529053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.705350935459137},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.63660728931427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6106287240982056},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5288977026939392},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.5048728585243225},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49704602360725403},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47849932312965393},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4208775758743286},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3105708360671997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26503288745880127},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2396728331","doi":null,"is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2015/126","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},{"id":"mag:2465504090","doi":null,"is_oa":false,"landing_page_url":"http://proceedings.mlr.press/v49/steinhardt16.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418075","display_name":"Conference on Learning Theory","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Conference on Learning Theory","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Quality education","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/4"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7100096181","https://openalex.org/W7097507696","https://openalex.org/W7101036383","https://openalex.org/W2941964463","https://openalex.org/W2407573515","https://openalex.org/W2594917320","https://openalex.org/W7096215407","https://openalex.org/W2060763943","https://openalex.org/W2571633443","https://openalex.org/W2082949155"],"abstract_inverted_index":{"If":[0],"a":[1,8,35,45],"concept":[2],"class":[3],"can":[4,13,26,88],"be":[5,15,27,89],"represented":[6],"with":[7,18,107,124],"certain":[9],"amount":[10,21],"of":[11,22,38,60,68],"memory,":[12],"it":[14],"efficiently":[16,28],"learned":[17,29],"the":[19,54,57,65,69,81,113],"same":[20],"memory?":[23],"What":[24],"concepts":[25],"by":[30],"algorithms":[31],"that":[32],"extract":[33],"only":[34],"few":[36],"bits":[37],"information":[39],"from":[40],"each":[41],"example?":[42],"We":[43,72],"introduce":[44],"formal":[46],"framework":[47],"for":[48],"studying":[49],"these":[50],"questions,":[51],"and":[52,64,76,95],"investigate":[53],"relationship":[55],"between":[56],"fundamental":[58],"resources":[59],"memory":[61],"or":[62],"communication":[63],"sample":[66],"complexity":[67],"learning":[70,78,104],"task.":[71],"relate":[73],"our":[74],"memory-bounded":[75],"communication-bounded":[77],"models":[79],"to":[80,91],"well-studied":[82],"statistical":[83],"query":[84],"model.":[85],"This":[86],"connection":[87],"leveraged":[90],"obtain":[92],"both":[93],"upper":[94,115],"lower":[96,101],"bounds:":[97],"we":[98],"show":[99],"strong":[100],"bounds":[102,116],"on":[103,117],"parity":[105],"functions":[106],"bounded":[108],"communication,":[109],"as":[110,112],"well":[111],"first":[114],"solving":[118],"generic":[119],"sparse":[120],"linear":[121],"regression":[122],"problems":[123],"limited":[125],"memory.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-10-17T09:40:24.721904","created_date":"2016-06-24T00:00:00"}