{"id":"https://openalex.org/W1486564402","doi":"https://doi.org/10.1137/110855223","title":"Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions","display_name":"Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1486564402","doi":"https://doi.org/10.1137/110855223","mag":"1486564402"},"language":"en","primary_location":{"id":"doi:10.1137/110855223","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110855223","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/65383b40-96c9-435b-a2e8-c99ef2977969","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054966819","display_name":"Ilias Diakonikolas","orcid":"https://orcid.org/0000-0002-5486-1856"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ilias Diakonikolas","raw_affiliation_strings":["School of Informatics"],"affiliations":[{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":["Computer Science Division, UC Berkeley"],"affiliations":[{"raw_affiliation_string":"Computer Science Division, UC Berkeley","institution_ids":["https://openalex.org/I1297971548","https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014866889","display_name":"Rocco A. Servedio","orcid":"https://orcid.org/0000-0003-2407-543X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rocco A. Servedio","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029451171","display_name":"Li-Yang Tan","orcid":"https://orcid.org/0000-0002-1279-4384"},"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":"Li-Yang Tan","raw_affiliation_strings":["Department of Computer Science, Columbia University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5054966819"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4862,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.956606,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"43","issue":"1","first_page":"231","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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/mathematics","display_name":"Mathematics","score":0.8423134088516235},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5953730940818787},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5711890459060669},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5662316679954529},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5655337572097778},{"id":"https://openalex.org/keywords/boolean-model","display_name":"Boolean model","score":0.5491986274719238},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4955521821975708},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4946093261241913},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4899434447288513},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.4424920380115509},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1602950394153595}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8423134088516235},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5953730940818787},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5711890459060669},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5662316679954529},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5655337572097778},{"id":"https://openalex.org/C67499762","wikidata":"https://www.wikidata.org/wiki/Q4943358","display_name":"Boolean model","level":2,"score":0.5491986274719238},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4955521821975708},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4946093261241913},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4899434447288513},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.4424920380115509},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1602950394153595},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110855223","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110855223","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/65383b40-96c9-435b-a2e8-c99ef2977969","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/65383b40-96c9-435b-a2e8-c99ef2977969","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Diakonikolas, I, Raghavendra, P, Servedio, R A & Tan, L 2014, 'Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions', SIAM Journal on Computing, vol. 43, no. 1, pp. 231-253. https://doi.org/10.1137/110855223","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/65383b40-96c9-435b-a2e8-c99ef2977969","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/65383b40-96c9-435b-a2e8-c99ef2977969","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Diakonikolas, I, Raghavendra, P, Servedio, R A & Tan, L 2014, 'Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions', SIAM Journal on Computing, vol. 43, no. 1, pp. 231-253. https://doi.org/10.1137/110855223","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1483560004","https://openalex.org/W1673019083","https://openalex.org/W1986296546","https://openalex.org/W2024588775","https://openalex.org/W2029370139","https://openalex.org/W2042194938","https://openalex.org/W2060775054","https://openalex.org/W2063083207","https://openalex.org/W2078134499","https://openalex.org/W2078345182","https://openalex.org/W2078929687","https://openalex.org/W2079520411","https://openalex.org/W2081256580","https://openalex.org/W2094776848","https://openalex.org/W2103749128","https://openalex.org/W2106458073","https://openalex.org/W2110503949","https://openalex.org/W2112556578","https://openalex.org/W2113141878","https://openalex.org/W2115180773","https://openalex.org/W2115785437","https://openalex.org/W2133263321","https://openalex.org/W2147306258","https://openalex.org/W2157902765","https://openalex.org/W2160779238","https://openalex.org/W2168115971","https://openalex.org/W2179261203","https://openalex.org/W2251283720","https://openalex.org/W2334237942","https://openalex.org/W2396436214","https://openalex.org/W2402751180","https://openalex.org/W2751862591","https://openalex.org/W2949874440","https://openalex.org/W2949990864","https://openalex.org/W3100065552"],"related_works":["https://openalex.org/W3212703233","https://openalex.org/W4288044863","https://openalex.org/W3145758888","https://openalex.org/W1997660011","https://openalex.org/W3141532631","https://openalex.org/W2131164334","https://openalex.org/W2936088236","https://openalex.org/W2148542302","https://openalex.org/W1993714627","https://openalex.org/W1996276855"],"abstract_inverted_index":{"We":[0],"give":[1],"the":[2,8,24,31,35,52,56,61,65,74,97,104,111,119,127,154,179,183,195],"first":[3,32,98],"nontrivial":[4],"upper":[5,247],"bounds":[6,200,203,248,257],"on":[7,23,92,118,204,236,249,258],"Boolean":[9,25,62,93,120,180,237,253],"average":[10,26,67,121,250],"sensitivity":[11,14,27,68,95,122,239,251],"and":[12,42,162,201,224],"noise":[13,94,238,259],"of":[15,28,37,40,60,69,79,107,123,130,157,166,252],"degree-$d$":[16,71],"polynomial":[17,76],"threshold":[18],"functions":[19],"(PTFs).":[20],"Our":[21,234],"bound":[22,91,117,193,235],"PTFs":[29,109,254],"represents":[30],"progress":[33],"toward":[34],"resolution":[36],"a":[38,243],"conjecture":[39],"Gotsman":[41],"Linial":[43],"[Combinatorica,":[44],"14":[45],"(1994),":[46],"pp.":[47,88,137,171,232],"35--50],":[48],"which":[49],"states":[50],"that":[51,141],"symmetric":[53],"function":[54],"slicing":[55],"middle":[57],"$d$":[58],"layers":[59],"hypercube":[63],"has":[64],"highest":[66],"all":[70],"PTFs.":[72,151],"Via":[73],"$L_1$":[75],"regression":[77],"algorithm":[78,102],"Kalai":[80],"et":[81],"al.":[82],"[SIAM":[83],"J.":[84,225],"Comput.,":[85],"37":[86],"(2008),":[87],"1777--1805],":[89],"our":[90,116,192],"yields":[96],"polynomial-time":[99],"agnostic":[100],"learning":[101],"for":[103],"broad":[105],"class":[106],"constant-degree":[108],"under":[110],"uniform":[112],"distribution.":[113],"To":[114],"obtain":[115,191],"PTFs,":[124],"we":[125],"generalize":[126],"\u201ccritical-index\u201d":[128],"machinery":[129],"[R.":[131],"Servedio,":[132],"Comput.":[133],"Complexity,":[134],"16":[135],"(2007),":[136],"180--209]":[138],"(which":[139],"in":[140,194,207],"work":[142],"applies":[143],"to":[144,149,176,182,190,255],"halfspaces,":[145],"i.e.,":[146],"degree-1":[147],"PTFs)":[148],"general":[150],"Together":[152],"with":[153],"\u201cinvariance":[155],"principle\u201d":[156],"[E.":[158],"Mossel,":[159],"R.":[160],"O'Donnell,":[161],"K.":[163],"Oleszkiewicz,":[164],"Ann.":[165],"Math.":[167,227],"(2),":[168],"171":[169],"(2010),":[170],"295--341],":[172],"this":[173],"allows":[174],"us":[175],"essentially":[177],"reduce":[178],"setting":[181,197],"Gaussian":[184,196,208,213],"setting.":[185],"The":[186],"main":[187],"ingredients":[188],"used":[189],"are":[198],"tail":[199],"anticoncentration":[202],"low-degree":[205],"polynomials":[206],"random":[209],"variables":[210],"[S.":[211],"Janson,":[212],"Hilbert":[214],"Spaces,":[215],"Cambridge":[216],"University":[217],"Press,":[218],"Cambridge,":[219],"UK,":[220],"1997;":[221],"A.":[222],"Carbery":[223],"Wright,":[226],"Res.":[228],"Lett.,":[229],"8":[230],"(2001),":[231],"233--248].":[233],"is":[240],"achieved":[241],"via":[242],"simple":[244],"reduction":[245],"from":[246],"corresponding":[256],"sensitivity.":[260]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}