{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:00:52Z","timestamp":1777615252221,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-09-1-0538"],"award-info":[{"award-number":["FA9550-09-1-0538"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0953192, CCF-1101215"],"award-info":[{"award-number":["CCF-0953192, CCF-1101215"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591839","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"449-458","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["The power of localization for efficiently learning linear separators with noise"],"prefix":"10.1145","author":[{"given":"Pranjal","family":"Awasthi","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Florina","family":"Balcan","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366815"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591839"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143853"},{"key":"e_1_3_2_2_4_1","volume-title":"COLT","author":"Balcan M.-F.","year":"2007"},{"key":"e_1_3_2_2_5_1","volume-title":"NIPS","author":"Balcan M.-F.","year":"2013"},{"key":"e_1_3_2_2_6_1","volume-title":"COLT","author":"Balcan M.-F.","year":"2012"},{"key":"e_1_3_2_2_7_1","volume-title":"COLT","author":"Balcan M.-F.","year":"2008"},{"key":"e_1_3_2_2_8_1","volume-title":"Conference on Learning Theory","author":"Balcan M.-F.","year":"2013"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1990.2.2.248"},{"key":"e_1_3_2_2_11_1","volume-title":"NIPS","author":"Beygelzimer A.","year":"2010"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"D. Bienstock and A. Michalka. Polynomial solvability of variants of the trust-region subproblem 2013. Optimization Online.  D. Bienstock and A. Michalka. Polynomial solvability of variants of the trust-region subproblem 2013. Optimization Online.","DOI":"10.1137\/1.9781611973402.28"},{"issue":"1","key":"e_1_3_2_2_13_1","first-page":"35","article-title":"A polynomial time algorithm for learning noisy linear threshold functions","volume":"22","author":"Blum A.","year":"1997","journal-title":"Algorithmica"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/188105.188169"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1051\/ps:2005018"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.01.003"},{"key":"e_1_3_2_2_17_1","volume-title":"COLT","author":"Castro R.","year":"2007"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022673506211"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/345662"},{"key":"e_1_3_2_2_20_1","volume-title":"NIPS","volume":"18","author":"Dasgupta S.","year":"2005"},{"key":"e_1_3_2_2_21_1","volume-title":"Encyclopedia of Machine Learning","author":"Dasgupta S.","year":"2011"},{"key":"e_1_3_2_2_22_1","first-page":"20","article-title":"A general agnostic active learning algorithm","author":"Dasgupta S.","year":"2007","journal-title":"NIPS"},{"key":"e_1_3_2_2_23_1","volume-title":"JMLR","author":"Dekel O.","year":"2012"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007330508534"},{"key":"e_1_3_2_2_25_1","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. 1990.   M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness . 1990."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993742"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.33"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273541"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS843"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90006-3"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.13"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62238"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/200548"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993468"},{"key":"e_1_3_2_2_35_1","first-page":"10","article-title":"Learning halfspaces with malicious noise","author":"Klivans A. R.","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953014"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_47"},{"key":"e_1_3_2_2_38_1","volume-title":"NIPS","author":"Raginsky M.","year":"2011"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.2.246.14485"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1625135.1625242"},{"key":"e_1_3_2_2_42_1","volume-title":"Wiley-Interscience","author":"Vapnik V.","year":"1998"},{"key":"e_1_3_2_2_43_1","unstructured":"L. Wang. Smoothness Disagreement Coefficient and the Label Complexity of Agnostic Active Learning. JMLR 2011.   L. Wang. Smoothness Disagreement Coefficient and the Label Complexity of Agnostic Active Learning. JMLR 2011."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864439"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591839","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":44,"alternative-id":["10.1145\/2591796.2591839","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591839","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}