{"id":"https://openalex.org/W4416189833","doi":"https://doi.org/10.1145/3798129.3800794","title":"Testing Noisy Low-Degree Polynomials for Sparsity","display_name":"Testing Noisy Low-Degree Polynomials for Sparsity","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416189833","doi":"https://doi.org/10.1145/3798129.3800794"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800794","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800794","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800794","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yiqiao Bao","orcid":"https://orcid.org/0000-0003-2491-0044"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiqiao Bao","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, USA"],"raw_orcid":"https://orcid.org/0000-0003-2491-0044","affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, USA","institution_ids":["https://openalex.org/I922845939","https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081127804","display_name":"Anindya De","orcid":"https://orcid.org/0000-0001-6795-8211"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anindya De","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, USA"],"raw_orcid":"https://orcid.org/0000-0001-6795-8211","affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, USA","institution_ids":["https://openalex.org/I922845939","https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052939404","display_name":"Shivam Nadimpalli","orcid":"https://orcid.org/0000-0002-1825-6122"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shivam Nadimpalli","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-1825-6122","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014866889","display_name":"Rocco A. Servedio","orcid":"https://orcid.org/0000-0003-2407-543X"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rocco A. Servedio","raw_affiliation_strings":["Columbia University, New York, USA"],"raw_orcid":"https://orcid.org/0000-0003-2407-543X","affiliations":[{"raw_affiliation_string":"Columbia University, New York, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104038964","display_name":"Nathan White","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan White","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, USA"],"raw_orcid":"https://orcid.org/0009-0006-1919-0782","affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, USA","institution_ids":["https://openalex.org/I922845939","https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02867034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"799","last_page":"805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4523000121116638,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4523000121116638,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.22769999504089355,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.14239999651908875,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6036999821662903},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.5997999906539917},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5931000113487244},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5307999849319458},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.44760000705718994},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4433000087738037},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42570000886917114},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42080000042915344},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4140999913215637}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7272999882698059},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6036999821662903},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.5997999906539917},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5931000113487244},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5307999849319458},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44760000705718994},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4433000087738037},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4406999945640564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4345000088214874},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4140999913215637},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.40630000829696655},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35929998755455017},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C78397625","wikidata":"https://www.wikidata.org/wiki/Q192487","display_name":"Discriminant","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.266400009393692},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C45025165","wikidata":"https://www.wikidata.org/wiki/Q13424738","display_name":"Stable polynomial","level":5,"score":0.26030001044273376},{"id":"https://openalex.org/C6077466","wikidata":"https://www.wikidata.org/wiki/Q5156597","display_name":"Complex quadratic polynomial","level":3,"score":0.26010000705718994},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C25878781","wikidata":"https://www.wikidata.org/wiki/Q1473607","display_name":"Degree of a polynomial","level":3,"score":0.25940001010894775},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800794","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800794","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.07835","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.07835","pdf_url":"https://arxiv.org/pdf/2511.07835","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.07835","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.07835","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800794","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800794","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1817820390","display_name":null,"funder_award_id":"2211238","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1897224967","display_name":null,"funder_award_id":"2106429","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2063355924","display_name":null,"funder_award_id":"CCF-2211238","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3854325956","display_name":null,"funder_award_id":"CCF-2106429","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7249145303","display_name":null,"funder_award_id":"CCF 2045128","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8239071661","display_name":"CAREER: Learning and property testing -- a complexity theoretic perspective","funder_award_id":"2045128","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/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320333566","display_name":"National Defense Science and Engineering Graduate","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,26,49,58,74],"problem":[3],"of":[4,25,39,51,57,60,78],"testing":[5,67],"if":[6],"an":[7],"unknown":[8],"low-degree":[9,45,79],"polynomial":[10,27],"p":[11,28],"over":[12],"\u211dn":[13],"is":[14,34,54],"sparse":[15,46],"versus":[16],"far":[17],"from":[18],"sparse,":[19],"given":[20],"access":[21],"to":[22,73],"noisy":[23,68],"evaluations":[24],"at":[29],"randomly":[30],"chosen":[31],"points.":[32],"This":[33],"a":[35,55],"natural":[36],"property-testing":[37],"version":[38],"various":[40],"well-studied":[41],"problems":[42],"about":[43],"learning":[44],"polynomials":[47],"in":[48],"presence":[50],"noise,":[52],"and":[53,63],"generalization":[56],"work":[59],"Chen,":[61],"De,":[62],"Servedio":[64],"(2020),":[65],"on":[66],"linear":[69],"functions":[70],"for":[71],"sparsity,":[72],"more":[75],"challenging":[76],"setting":[77],"polynomials.":[80]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-13T00:00:00"}