{"id":"https://openalex.org/W4376639587","doi":"https://doi.org/10.1145/3564246.3585191","title":"A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning","display_name":"A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639587","doi":"https://doi.org/10.1145/3564246.3585191"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585191","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3564246.3585191","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585191","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585191","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054966819","display_name":"Ilias Diakonikolas","orcid":"https://orcid.org/0000-0002-5486-1856"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilias Diakonikolas","raw_affiliation_strings":["University of Wisconsin-Madison, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027430783","display_name":"Christos Tzamos","orcid":"https://orcid.org/0000-0002-7560-5069"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]},{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR","US"],"is_corresponding":false,"raw_author_name":"Christos Tzamos","raw_affiliation_strings":["University of Wisconsin-Madison, USA / University of Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, USA / University of Athens, Greece","institution_ids":["https://openalex.org/I135310074","https://openalex.org/I200777214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035962853","display_name":"Daniel M. Kane","orcid":"https://orcid.org/0000-0002-0220-9962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel M. Kane","raw_affiliation_strings":["University of California at San Diego, San Diego, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at San Diego, San Diego, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6499,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66128412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"6","issue":null,"first_page":"1741","last_page":"1754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6801055669784546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.639333963394165},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5865989327430725},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5230917930603027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4289095401763916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4208022654056549},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1349441409111023}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6801055669784546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.639333963394165},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5865989327430725},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5230917930603027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4289095401763916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4208022654056549},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1349441409111023},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3564246.3585191","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3564246.3585191","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585191","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt4h41d0vv","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/4h41d0vv","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585191","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3564246.3585191","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585191","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1625876135","display_name":"AF: Small: New Directions for Simplicity versus Optimality in Mechanism Design","funder_award_id":"2008006","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1862673987","display_name":"Collaborative Research: AF: Medium: Algorithmic High-Dimensional Robust Statistics","funder_award_id":"2107079","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5506166052","display_name":"Collaborative Research: AF: Medium: Algorithmic High-Dimensional Robust Statistics","funder_award_id":"2107547","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6352996222","display_name":"CAREER: Efficient Algorithms for Learning and Testing Structured Probabilistic Models","funder_award_id":"1652862","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/G7713438856","display_name":"CAREER: Learning Algorithms with Robustness and Efficiency Guarantees","funder_award_id":"2144298","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/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639587.pdf","grobid_xml":"https://content.openalex.org/works/W4376639587.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1493148361","https://openalex.org/W1520252399","https://openalex.org/W1531368347","https://openalex.org/W1535255862","https://openalex.org/W1976986203","https://openalex.org/W1988790447","https://openalex.org/W2002636386","https://openalex.org/W2019363670","https://openalex.org/W2020884828","https://openalex.org/W2031822344","https://openalex.org/W2040870580","https://openalex.org/W2044413922","https://openalex.org/W2048790997","https://openalex.org/W2076541756","https://openalex.org/W2097886040","https://openalex.org/W2100440346","https://openalex.org/W2116794057","https://openalex.org/W2143355494","https://openalex.org/W2150154671","https://openalex.org/W2154952480","https://openalex.org/W2156036190","https://openalex.org/W2171574551","https://openalex.org/W2514746546","https://openalex.org/W2568342123","https://openalex.org/W2610680804","https://openalex.org/W2786800728","https://openalex.org/W3021764208","https://openalex.org/W3105488314","https://openalex.org/W3153235645","https://openalex.org/W3184572569","https://openalex.org/W4230674625","https://openalex.org/W4244259635","https://openalex.org/W4288804597"],"related_works":["https://openalex.org/W2365767001","https://openalex.org/W2062274034","https://openalex.org/W2379147087","https://openalex.org/W124708629","https://openalex.org/W2335520227","https://openalex.org/W303980170","https://openalex.org/W3089684342","https://openalex.org/W2107287896","https://openalex.org/W1989776440","https://openalex.org/W2357379321"],"abstract_inverted_index":{"The":[0],"Forster":[1,24,53,72,90],"transform":[2,73],"is":[3,61,109,117],"a":[4,8,28,32,75,128],"method":[5],"of":[6,20,35,74,104,115,136],"regularizing":[7],"dataset":[9,77],"by":[10],"placing":[11],"it":[12],"in":[13,31,133],"radial":[14],"isotropic":[15],"position":[16],"while":[17],"maintaining":[18],"some":[19],"its":[21],"essential":[22],"properties.":[23],"transforms":[25],"have":[26],"played":[27],"key":[29],"role":[30],"diverse":[33],"range":[34],"settings":[36],"spanning":[37],"computer":[38],"science":[39],"and":[40],"functional":[41],"analysis.":[42],"Prior":[43],"work":[44],"had":[45],"given":[46,76],"weakly":[47],"polynomial":[48,65,89,97,130],"time":[49,66,98],"algorithms":[50],"for":[51,100],"computing":[52],"transforms,":[54],"when":[55],"they":[56],"exist.":[57],"Our":[58,122],"main":[59],"result":[60,108],"the":[62,94,134],"first":[63,95],"strongly":[64,88,96,129],"algorithm":[67,99],"to":[68,119,126],"compute":[69],"an":[70],"approximate":[71],"or":[78],"certify":[79],"that":[80],"no":[81],"such":[82],"transformation":[83],"exists.":[84],"By":[85],"leveraging":[86],"our":[87],"algorithm,":[91],"we":[92],"obtain":[93],"distribution-free":[101],"PAC":[102,113],"learning":[103,107,114,123],"halfspaces.":[105],"This":[106],"surprising":[110],"because":[111],"proper":[112],"halfspaces":[116],"equivalent":[118],"linear":[120],"programming.":[121],"approach":[124],"extends":[125],"give":[127],"halfspace":[131],"learner":[132],"presence":[135],"random":[137],"classification":[138],"noise":[139],"and,":[140],"more":[141],"generally,":[142],"Massart":[143],"noise.":[144]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}