{"id":"https://openalex.org/W2179261203","doi":"https://doi.org/10.1007/s00037-007-0228-7","title":"Every Linear Threshold Function has a Low-Weight Approximator","display_name":"Every Linear Threshold Function has a Low-Weight Approximator","publication_year":2007,"publication_date":"2007-05-01","ids":{"openalex":"https://openalex.org/W2179261203","doi":"https://doi.org/10.1007/s00037-007-0228-7","mag":"2179261203"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-007-0228-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0228-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0228-7.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0228-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Rocco A. Servedio","raw_affiliation_strings":["Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, Mailcode 0401, New York, NY, 10027-7003, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, Mailcode 0401, New York, NY, 10027-7003, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014866889"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":9.5417,"has_fulltext":true,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97891614,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"2","first_page":"180","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":1.0,"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":1.0,"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.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7483490109443665},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6699833869934082},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6314221024513245},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5811301469802856},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5628042817115784},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.541080892086029},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.5311911106109619},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5037147402763367},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.49399882555007935},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4903733730316162},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4865345060825348},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.4309535622596741},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1561630666255951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1489633321762085},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1097726821899414}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7483490109443665},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6699833869934082},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6314221024513245},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5811301469802856},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5628042817115784},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.541080892086029},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.5311911106109619},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5037147402763367},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.49399882555007935},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4903733730316162},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4865345060825348},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.4309535622596741},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1561630666255951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1489633321762085},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1097726821899414},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-007-0228-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0228-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0228-7.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00037-007-0228-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0228-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0228-7.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5412610454","display_name":"CAREER:  Efficient Learning Algorithms for Rich Function Classes","funder_award_id":"0347282","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7351285996","display_name":"QnTM:    Quantum Computational Learning","funder_award_id":"0523664","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/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2179261203.pdf","grobid_xml":"https://content.openalex.org/works/W2179261203.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W2256202","https://openalex.org/W137193333","https://openalex.org/W616377252","https://openalex.org/W1517311456","https://openalex.org/W1528486370","https://openalex.org/W1528601071","https://openalex.org/W1563088657","https://openalex.org/W1578042930","https://openalex.org/W1582008706","https://openalex.org/W1601740268","https://openalex.org/W1602848424","https://openalex.org/W1607251184","https://openalex.org/W1609370892","https://openalex.org/W1662824729","https://openalex.org/W1862379263","https://openalex.org/W1932230915","https://openalex.org/W1969313096","https://openalex.org/W1970299638","https://openalex.org/W1970605182","https://openalex.org/W1976119770","https://openalex.org/W1979601782","https://openalex.org/W1979969728","https://openalex.org/W1988790447","https://openalex.org/W1994863011","https://openalex.org/W2003554015","https://openalex.org/W2006562579","https://openalex.org/W2006863141","https://openalex.org/W2008470071","https://openalex.org/W2010549883","https://openalex.org/W2017496565","https://openalex.org/W2048563093","https://openalex.org/W2056003475","https://openalex.org/W2061055380","https://openalex.org/W2070534370","https://openalex.org/W2074588786","https://openalex.org/W2080210666","https://openalex.org/W2097575812","https://openalex.org/W2097886040","https://openalex.org/W2097930361","https://openalex.org/W2098730982","https://openalex.org/W2110503949","https://openalex.org/W2114588947","https://openalex.org/W2114870555","https://openalex.org/W2129113961","https://openalex.org/W2135756775","https://openalex.org/W2147366477","https://openalex.org/W2545696445","https://openalex.org/W4235920691","https://openalex.org/W4242423960","https://openalex.org/W4245463838","https://openalex.org/W4246994868","https://openalex.org/W4392750738","https://openalex.org/W6654110563"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W1521824362","https://openalex.org/W2468477307","https://openalex.org/W2168163332","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W2982781090"],"abstract_inverted_index":{"Given":[0],"any":[1,124],"linear":[2,13,69,125,189],"threshold":[3,14,70,126,190],"function":[4,15,127],"f":[5,20,128],"on":[6,21,52,61,181],"n":[7,53,111],"Boolean":[8],"variables,":[9],"we":[10,121],"construct":[11],"a":[12,56,67,79],"g":[16],"which":[17,147,165],"disagrees":[18],"with":[19],"at":[22,36],"most":[23,37],"an":[24,91,100,152],"\u03b5":[25,134],"fraction":[26,86],"of":[27,34,49,59,87,93,137,179,184,196],"inputs":[28],"and":[29,143,171],"has":[30],"integer":[31],"weights":[32,63],"each":[33],"magnitude":[35],"$${\\sqrt{n}\\cdot}2^{{\\tilde{O}}(1/":[38],"\\epsilon^{2})}$$":[39],"We":[40,72],"show":[41,122],"that":[42,123],"the":[43,62,85,94,160,173,182,193],"construction":[44],"is":[45,78,129,159,166],"optimal":[46],"in":[47,107,110,114,169,192],"terms":[48,178],"its":[50,138],"dependence":[51],"by":[54,135],"proving":[55],"lower":[57],"bound":[58,164,176],"$$\\Omega(\\sqrt{n})$$":[60],"required":[64,186],"to":[65,90,98,131,150],"approximate":[66],"particular":[68],"function.":[71],"give":[73],"two":[74],"applications.":[75],"The":[76,104],"first":[77,161,174],"deterministic":[80],"algorithm":[81,105],"for":[82,187],"approximately":[83],"counting":[84],"satisfying":[88],"assignments":[89],"instance":[92],"zero-one":[95],"knapsack":[96],"problem":[97],"within":[99,132,151],"additive":[101,153],"\u00b1":[102],"\u03b5.":[103],"runs":[106],"time":[108],"polynomial":[109,168,175],"(but":[112],"exponential":[113],"$${1}/{\\epsilon^{2}}$$":[115],").":[116],"In":[117],"our":[118],"second":[119],"application,":[120],"specified":[130],"error":[133],"estimates":[136],"Chow":[139],"parameters":[140],"(degree":[141],"0":[142],"1":[144],"Fourier":[145],"coefficients)":[146],"are":[148],"accurate":[149],"$$\\pm{1}/({n}\\cdot":[154],"2^{{\\tilde{O}}(1/":[155],"\\epsilon^{2})})$$":[156],".":[157],"This":[158],"such":[162],"accuracy":[163],"inverse":[167],"n,":[170],"gives":[172],"(in":[177],"n)":[180],"number":[183],"examples":[185],"learning":[188],"functions":[191],"\u201crestricted":[194],"focus":[195],"attention\u201d":[197],"framework.":[198]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}