{"id":"https://openalex.org/W4416159201","doi":"https://doi.org/10.1145/3798129.3800889","title":"A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube","display_name":"A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416159201","doi":"https://doi.org/10.1145/3798129.3800889"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800889","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800889","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.3800889","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113253022","display_name":"Gautam Chandrasekaran","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gautam Chandrasekaran","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0009-0002-2443-8675","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006626709","display_name":"Adam R. Klivans","orcid":"https://orcid.org/0000-0001-6960-2235"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam R. Klivans","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0000-0001-6960-2235","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037285876","display_name":"Konstantinos Stavropoulos","orcid":"https://orcid.org/0000-0002-5549-7048"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantinos Stavropoulos","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0009-0006-2643-4298","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030920630","display_name":"Arsen Vasilyan","orcid":"https://orcid.org/0000-0003-0672-0386"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arsen Vasilyan","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0000-0003-0672-0386","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"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.01051512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1824","last_page":"1835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.8482999801635742,"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.8482999801635742,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.03139999881386757,"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.024399999529123306,"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/hypercube","display_name":"Hypercube","score":0.6028000116348267},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.5496000051498413},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4510999917984009},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4228000044822693},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3262999951839447}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6028000116348267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5702999830245972},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.5496000051498413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5378000140190125},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44429999589920044},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.43209999799728394},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35510000586509705},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2989000082015991},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2831000089645386},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800889","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800889","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.07244","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.07244","pdf_url":"https://arxiv.org/pdf/2511.07244","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.07244","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.07244","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800889","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800889","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/G1610805586","display_name":null,"funder_award_id":"CCF-2505865","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4717070235","display_name":"AF: Small: Efficient Algorithms for Nonconvex Regression","funder_award_id":"1909204","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,36],"give":[1],"the":[2,13,17,20,46,57,71],"first":[3],"fully":[4],"polynomial-time":[5],"algorithm":[6],"for":[7],"learning":[8],"halfspaces":[9],"with":[10,84],"respect":[11,85],"to":[12,86],"uniform":[14],"distribution":[15],"on":[16],"hypercube":[18],"in":[19,56,79],"presence":[21],"of":[22,31,41],"contamination,":[23],"where":[24,43,60],"an":[25,38],"adversary":[26],"may":[27],"corrupt":[28],"some":[29],"fraction":[30],"examples":[32],"and":[33],"labels":[34,62],"arbitrarily.":[35],"achieve":[37],"error":[39],"guarantee":[40],"\u03b7O(1)+\u0454":[42],"\u03b7":[44],"is":[45],"noise":[47],"rate.":[48],"Such":[49],"a":[50,76],"result":[51],"was":[52],"not":[53],"known":[54],"even":[55],"agnostic":[58],"setting,":[59],"only":[61,83],"can":[63],"be":[64],"adversarially":[65],"corrupted.":[66],"All":[67],"prior":[68],"work":[69],"over":[70],"last":[72],"two":[73],"decades":[74],"has":[75],"superpolynomial":[77],"dependence":[78],"1/\u0454":[80],"or":[81],"succeeds":[82],"continuous":[87],"marginals":[88],"(such":[89],"as":[90],"log-concave":[91],"densities).":[92]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-12T00:00:00"}