{"id":"https://openalex.org/W3039117700","doi":"https://doi.org/10.1145/3406325.3451001","title":"Robust linear regression: optimal rates in polynomial time","display_name":"Robust linear regression: optimal rates in polynomial time","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3039117700","doi":"https://doi.org/10.1145/3406325.3451001","mag":"3039117700"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451001","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451001","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451001","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451001","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079598728","display_name":"Ainesh Bakshi","orcid":"https://orcid.org/0009-0001-0225-8588"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ainesh Bakshi","raw_affiliation_strings":["Carnegie Mellon University, USA","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109456367","display_name":"Adarsh Prasad","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adarsh Prasad","raw_affiliation_strings":["Carnegie Mellon University, USA","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.3216,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.82842923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"102","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9965999722480774,"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.9965999722480774,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9925000071525574,"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"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9905999898910522,"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/estimator","display_name":"Estimator","score":0.7546083927154541},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7167753577232361},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6084556579589844},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5902974605560303},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.569347620010376},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5148290991783142},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5062548518180847},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.4648266136646271},{"id":"https://openalex.org/keywords/linear-regression","display_name":"Linear regression","score":0.446127325296402},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.44229209423065186},{"id":"https://openalex.org/keywords/polynomial-regression","display_name":"Polynomial regression","score":0.4314330518245697},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40201079845428467},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2612878680229187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19067412614822388},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.18365222215652466},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10419556498527527}],"concepts":[{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.7546083927154541},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7167753577232361},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6084556579589844},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5902974605560303},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.569347620010376},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5148290991783142},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5062548518180847},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.4648266136646271},{"id":"https://openalex.org/C48921125","wikidata":"https://www.wikidata.org/wiki/Q10861030","display_name":"Linear regression","level":2,"score":0.446127325296402},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.44229209423065186},{"id":"https://openalex.org/C120068334","wikidata":"https://www.wikidata.org/wiki/Q45343","display_name":"Polynomial regression","level":3,"score":0.4314330518245697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40201079845428467},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2612878680229187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19067412614822388},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.18365222215652466},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10419556498527527},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3406325.3451001","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451001","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451001","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2007.01394","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2007.01394","pdf_url":"https://arxiv.org/pdf/2007.01394","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,"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":"mag:3039117700","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2007.01394.pdf","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,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2007.01394","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2007.01394","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,"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":"Preprint"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451001","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451001","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451001","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G1717380892","display_name":null,"funder_award_id":"N00014-18","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G2451892224","display_name":"AF: Small: Data Stream Algorithms with Application to Linear Algebra","funder_award_id":"1815840","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G580644419","display_name":null,"funder_award_id":"N00014-18-1-2562","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310145","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3039117700.pdf","grobid_xml":"https://content.openalex.org/works/W3039117700.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W36711357","https://openalex.org/W606732920","https://openalex.org/W616376197","https://openalex.org/W1806104592","https://openalex.org/W2012329067","https://openalex.org/W2018764772","https://openalex.org/W2030296667","https://openalex.org/W2046033161","https://openalex.org/W2053885701","https://openalex.org/W2118807841","https://openalex.org/W2133404041","https://openalex.org/W2152701363","https://openalex.org/W2345432430","https://openalex.org/W2554864439","https://openalex.org/W2597655115","https://openalex.org/W2636179653","https://openalex.org/W2751645773","https://openalex.org/W2771009994","https://openalex.org/W2773686537","https://openalex.org/W2806473647","https://openalex.org/W2883468257","https://openalex.org/W2897779465","https://openalex.org/W2901071012","https://openalex.org/W2924512540","https://openalex.org/W2952399199","https://openalex.org/W2962820675","https://openalex.org/W2962856918","https://openalex.org/W2962907923","https://openalex.org/W2963351358","https://openalex.org/W2963558956","https://openalex.org/W2963589833","https://openalex.org/W2963945243","https://openalex.org/W2964008913","https://openalex.org/W2964013305","https://openalex.org/W2964135521","https://openalex.org/W2964164735","https://openalex.org/W2964477385","https://openalex.org/W2966353252","https://openalex.org/W2969786364","https://openalex.org/W2970552274","https://openalex.org/W2973842521","https://openalex.org/W2984272935","https://openalex.org/W2996640527","https://openalex.org/W3002207671","https://openalex.org/W3005288347","https://openalex.org/W3006266078","https://openalex.org/W3017335724","https://openalex.org/W3022327706","https://openalex.org/W3025893026","https://openalex.org/W3027316514","https://openalex.org/W3029013756","https://openalex.org/W3035763474","https://openalex.org/W3093456580"],"related_works":["https://openalex.org/W2984272935","https://openalex.org/W2963351358","https://openalex.org/W2554864439","https://openalex.org/W2964135521","https://openalex.org/W2962820675","https://openalex.org/W2808754399","https://openalex.org/W3087730300","https://openalex.org/W3029013756","https://openalex.org/W2963945243","https://openalex.org/W2963589833","https://openalex.org/W2901071012","https://openalex.org/W2046033161","https://openalex.org/W2809984153","https://openalex.org/W2037228647","https://openalex.org/W2048138744","https://openalex.org/W3125940895","https://openalex.org/W2964001076","https://openalex.org/W1772818306","https://openalex.org/W2953168631","https://openalex.org/W2014689751"],"abstract_inverted_index":{"We":[0,39,69],"obtain":[1],"robust":[2],"and":[3,33,94,105],"computationally":[4],"efficient":[5],"estimators":[6],"for":[7,51],"learning":[8],"several":[9],"linear":[10],"models":[11],"that":[12,44,71],"achieve":[13,90],"statistically":[14],"optimal":[15,48,93],"convergence":[16],"rate":[17,57,88],"under":[18],"minimal":[19],"distributional":[20],"assumptions.":[21],"Concretely,":[22],"we":[23,89,96],"assume":[24],"our":[25,79],"data":[26],"is":[27,36,64,91],"drawn":[28],"from":[29],"a":[30,56],"k-hypercontractive":[31],"distribution":[32,54],"an":[34,42],"\u0454-fraction":[35],"adversarially":[37],"corrupted.":[38],"then":[40],"describe":[41],"estimator":[43,74],"converges":[45],"to":[46,59,78,84],"the":[47,52,62,67,98],"least-squares":[49],"minimizer":[50],"true":[53],"at":[55],"proportional":[58],"\u04542\u22122/k,":[60],"when":[61],"noise":[63],"independent":[65],"of":[66],"covariates.":[68],"note":[70],"no":[72],"such":[73],"was":[75],"known":[76],"prior":[77],"work,":[80],"even":[81],"with":[82],"access":[83],"unbounded":[85],"computation.":[86],"The":[87],"information-theoretically":[92],"thus":[95],"resolve":[97],"main":[99],"open":[100],"question":[101],"in":[102],"Klivans,":[103],"Kothari":[104],"Meka":[106],"[COLT\u201918].":[107]},"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":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}