{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T05:55:18Z","timestamp":1775109318857,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1553288, CCF-1652862"],"award-info":[{"award-number":["CCF-1553288, CCF-1652862"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188754","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"1061-1073","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning geometric concepts with nasty noise"],"prefix":"10.1145","author":[{"given":"Ilias","family":"Diakonikolas","sequence":"first","affiliation":[{"name":"University of Southern California, USA"}]},{"given":"Daniel M.","family":"Kane","sequence":"additional","affiliation":[{"name":"University of California at San Diego, USA"}]},{"given":"Alistair","family":"Stewart","sequence":"additional","affiliation":[{"name":"University of Southern California, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3006384"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1990.2.4.510"},{"key":"e_1_3_2_2_3_1","unstructured":"J. Bruck. 1990.  J. Bruck. 1990."},{"key":"e_1_3_2_2_4_1","volume-title":"SIAM Journal on Discrete Mathematics 3, 2","author":"Harmonic","year":"1990"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00403-0"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1961.24"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of The 28th Conference on Learning Theory, COLT 2015. 484\u2013502","author":"Daniely A.","year":"2015"},{"key":"e_1_3_2_2_8_1","unstructured":"A. Daniely. 2016.  A. Daniely. 2016."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897520"},{"key":"e_1_3_2_2_10_1","unstructured":"105\u2013117.  105\u2013117."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591820"},{"key":"e_1_3_2_2_12_1","unstructured":"441\u2013448.  441\u2013448."},{"key":"e_1_3_2_2_13_1","unstructured":"A. De I. Diakonikolas V. Feldman and R. A. Servedio. 2014.  A. De I. Diakonikolas V. Feldman and R. A. Servedio. 2014."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590772"},{"key":"e_1_3_2_2_15_1","unstructured":"M. Dertouzos. 1965.  M. Dertouzos. 1965."},{"key":"e_1_3_2_2_16_1","volume-title":"A Synthesis Approach","author":"Logic Threshold"},{"key":"e_1_3_2_2_17_1","unstructured":"L. Devroye and G. Lugosi. 2001.  L. Devroye and G. Lugosi. 2001."},{"key":"e_1_3_2_2_18_1","volume-title":"Springer Series in Statistics","author":"Combinatorial"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806763"},{"key":"e_1_3_2_2_20_1","unstructured":"I. Diakonikolas G. Kamath D. M. Kane J. Li A. Moitra and A. Stewart. 2016.  I. Diakonikolas G. Kamath D. M. Kane J. Li A. Moitra and A. Stewart. 2016."},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of FOCS\u201916","author":"High Robust Estimators"},{"key":"e_1_3_2_2_22_1","unstructured":"I. Diakonikolas G. Kamath D. M. Kane J. Li A. Moitra and A. Stewart. 2017.  I. Diakonikolas G. Kamath D. M. Kane J. Li A. Moitra and A. Stewart. 2017."},{"key":"e_1_3_2_2_23_1","volume-title":"CoRR abs\/1703.00893","author":"High Being Robust","year":"2017"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of ICML\u201917"},{"key":"e_1_3_2_2_25_1","volume-title":"Gaussian: Getting Optimal Error, Efficiently. CoRR abs\/1704.03866","author":"Diakonikolas I.","year":"2017"},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of SODA\u201918"},{"key":"e_1_3_2_2_27_1","unstructured":"I. Diakonikolas D. M. Kane and A. Stewart. 2016.  I. Diakonikolas D. M. Kane and A. Stewart. 2016."},{"key":"e_1_3_2_2_28_1","volume-title":"CoRR abs\/1606.07384","author":"Fixed-Structure Bayesian Robust Learning","year":"2016"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188754"},{"key":"e_1_3_2_2_30_1","unstructured":"I. Diakonikolas D. M. Kane and A. Stewart. 2017. Learning Geometric Concepts with Nasty Noise. CoRR abs\/1707.01242 (2017). http:\/\/arxiv.org\/abs\/1707.01242  I. Diakonikolas D. M. Kane and A. Stewart. 2017. Learning Geometric Concepts with Nasty Noise. CoRR abs\/1707.01242 (2017). http:\/\/arxiv.org\/abs\/1707.01242"},{"key":"e_1_3_2_2_31_1","unstructured":"I. Diakonikolas P. Raghavendra R. A. Servedio and L. Y. Tan. 2014.  I. Diakonikolas P. Raghavendra R. A. Servedio and L. Y. Tan. 2014."},{"key":"e_1_3_2_2_32_1","volume-title":"231\u2013253","author":"Sensitivity Average","year":"2014"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2014.v010a001"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90010-D"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/060649057"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0012-6"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591798"},{"key":"e_1_3_2_2_38_1","unstructured":"D. M. Kane. 2014.  D. M. Kane. 2014."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-014-0086-z"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222052"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993468"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755877"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.64"},{"key":"e_1_3_2_2_44_1","unstructured":"A. R. Klivans P. M. Long and A. K. Tang. 2009.  A. R. Klivans P. M. Long and A. K. Tang. 2009."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_44"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222080"},{"key":"e_1_3_2_2_47_1","unstructured":"N. Linial Y. Mansour and N. Nisan. 1993.  N. Linial Y. Mansour and N. Nisan. 1993."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"e_1_3_2_2_49_1","unstructured":"W. Maass and G. Turan. 1994. How fast can a threshold gate learn?. In Computational Learning Theory and Natural Learning Systems S. Hanson G. Drastal and R. Rivest (Eds.). MIT Press 381\u2013414.   W. Maass and G. Turan. 1994. How fast can a threshold gate learn?. In Computational Learning Theory and Natural Learning Systems S. Hanson G. Drastal and R. Rivest (Eds.). MIT Press 381\u2013414."},{"key":"e_1_3_2_2_50_1","unstructured":"M. Minsky and S. Papert. 1968.  M. Minsky and S. Papert. 1968."},{"key":"e_1_3_2_2_51_1","volume-title":"an introduction to computational geometry","author":"Perceptrons"},{"key":"e_1_3_2_2_52_1","unstructured":"S. Muroga. 1971.  S. Muroga. 1971."},{"key":"e_1_3_2_2_53_1","unstructured":"Threshold logic and its applications. Wiley-Interscience New York.  Threshold logic and its applications. Wiley-Interscience New York."},{"key":"e_1_3_2_2_54_1","unstructured":"L. Trevisan M. Tulsiani and S. Vadhan. 2008.  L. Trevisan M. Tulsiani and S. Vadhan. 2008."},{"key":"e_1_3_2_2_55_1","unstructured":"L. Valiant. 1985.  L. Valiant. 1985."},{"key":"e_1_3_2_2_56_1","volume-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence. 560\u2013566","author":"Learning"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808710"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.19"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188754","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188754","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:08Z","timestamp":1750212428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":58,"alternative-id":["10.1145\/3188745.3188754","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188754","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}