{"id":"https://openalex.org/W7213510993","doi":"https://doi.org/10.48550/arxiv.2609.17655","title":"Efficient Robust Learning at the Information-Theoretic Limit","display_name":"Efficient Robust Learning at the Information-Theoretic Limit","publication_year":2026,"publication_date":"2026-09-15","ids":{"openalex":"https://openalex.org/W7213510993","doi":"https://doi.org/10.48550/arxiv.2609.17655"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.17655","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17655","pdf_url":"https://arxiv.org/pdf/2609.17655","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.17655","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135831823","display_name":"Adam R. Klivans","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klivans, Adam R.","raw_affiliation_strings":["UT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UT","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127841816","display_name":"Konstantinos Stavropoulos","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stavropoulos, Konstantinos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137232470","display_name":"Sergei Tikhonov","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tikhonov, Sergei","raw_affiliation_strings":["UT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UT","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030920630","display_name":"Arsen Vasilyan","orcid":"https://orcid.org/0000-0003-0672-0386","observed_orcids":["https://orcid.org/0000-0003-0672-0386"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasilyan, Arsen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.86080002784729,"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.86080002784729,"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.04729999974370003,"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.013799999840557575,"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/robust-learning","display_name":"robust learning","score":0.8840000033378601},{"id":"https://openalex.org/keywords/noise-rate","display_name":"noise rate","score":0.546999990940094},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.6430000066757202},{"id":"https://openalex.org/keywords/half-space","display_name":"half-space","score":0.9079999923706055},{"id":"https://openalex.org/keywords/online-convex-optimization","display_name":"online convex optimization","score":0.9620000123977661},{"id":"https://openalex.org/keywords/agnostic-learning","display_name":"agnostic learning","score":0.9300000071525574}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6514000296592712},{"id":"https://openalex.org/C107321475","wikidata":"https://www.wikidata.org/wiki/Q5374254","display_name":"Empirical risk minimization","level":2,"score":0.6276000142097473},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6187000274658203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4731000065803528},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C95627357","wikidata":"https://www.wikidata.org/wiki/Q7979889","display_name":"Weighted Majority Algorithm","level":5,"score":0.41659998893737793},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41019999980926514},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.37070000171661377},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32440000772476196},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29750001430511475},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.2847999930381775},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.26969999074935913},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C117765406","wikidata":"https://www.wikidata.org/wiki/Q5362437","display_name":"Generalization error","level":3,"score":0.2632000148296356},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.26249998807907104},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.2565000057220459},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.17655","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17655","pdf_url":"https://arxiv.org/pdf/2609.17655","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.17655","doi":"https://doi.org/10.48550/arxiv.2609.17655","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.17655","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.17655","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17655","pdf_url":"https://arxiv.org/pdf/2609.17655","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310620","display_name":"University of Texas at Austin","ror":"https://ror.org/00hj54h04"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213510993.pdf","grobid_xml":"https://content.openalex.org/works/W7213510993.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W4404354811","https://openalex.org/W7161745771"],"related_works":["https://openalex.org/W4416159201","https://openalex.org/W7097324068","https://openalex.org/W7150955168","https://openalex.org/W2106458073","https://openalex.org/W7098447769","https://openalex.org/W4415019067","https://openalex.org/W3025573352","https://openalex.org/W2160779238","https://openalex.org/W2098278064","https://openalex.org/W7097168821"],"abstract_inverted_index":{"In":[0,40],"an":[1,8,79,94,99],"important":[2],"recent":[3],"work,":[4],"Blanc":[5],"(2026)":[6],"gave":[7],"algorithm":[9,57,75,101],"for":[10,81,106],"robustly":[11,107],"learning":[12,108,162],"Boolean":[13],"concept":[14],"classes":[15],"with":[16,117,128,163],"respect":[17,118,129,166],"to":[18,71,78,119,130,138,167],"a":[19,24,73,147],"fixed":[20],"distribution":[21],"that":[22,46,112,152],"outputs":[23],"(randomized)":[25],"classifier":[26],"achieving":[27],"the":[28,37,62,157,172],"optimal":[29],"error":[30,51],"of":[31,141],"$\u03b7+":[32],"\\varepsilon$":[33],"where":[34],"$\u03b7$":[35],"is":[36,43,58,70],"noise":[38],"rate.":[39],"contrast,":[41],"it":[42],"well":[44],"known":[45],"deterministic":[47],"hypotheses":[48],"cannot":[49],"achieve":[50],"less":[52],"than":[53],"$2\u03b7+":[54],"\\varepsilon$.":[55],"Blanc's":[56],"computationally":[59],"inefficient,":[60],"and":[61,91],"main":[63],"problem":[64,90],"left":[65],"open":[66],"in":[67,156],"his":[68],"work":[69],"find":[72],"polynomial-time":[74],"given":[76],"access":[77],"oracle":[80,104],"empirical":[82],"risk":[83],"minimization":[84],"(ERM).":[85],"Here":[86],"we":[87,97,150],"resolve":[88],"this":[89],"give":[92,98],"such":[93],"algorithm.":[95],"Additionally,":[96],"efficient":[100,153,161],"(no":[102],"ERM":[103],"required)":[105],"any":[109],"function":[110],"class":[111],"admits":[113],"low-degree":[114],"polynomial":[115],"approximators":[116],"hypercontractive":[120],"distributions.":[121],"This":[122],"captures":[123],"basic":[124],"settings":[125],"including":[126],"halfspaces":[127],"Gaussian":[131],"marginals.":[132],"Our":[133],"techniques":[134],"make":[135],"new":[136],"connections":[137],"various":[139],"types":[140],"online":[142],"convex":[143],"optimization":[144],"algorithms.":[145],"As":[146],"surprising":[148],"consequence,":[149],"show":[151],"SQ":[154],"learnability":[155],"agnostic":[158],"setting":[159],"implies":[160],"contamination":[164],"(with":[165],"Gaussians":[168],"or":[169],"uniform":[170],"over":[171],"hypercube).":[173]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-18T00:00:00"}
