{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:01:29Z","timestamp":1742961689057,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752240"},{"type":"electronic","value":"9783540752257"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75225-7_11","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T12:46:43Z","timestamp":1192020403000},"page":"94-106","source":"Crossref","is-referenced-by-count":0,"title":["Separating Models of Learning with Faulty Teachers"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shrenik","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal","family":"Wadhwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"7","volume":"14","author":"D. Angluin","year":"1994","unstructured":"Angluin, D., Slonim, D.K.: Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle. Machine Learning\u00a014, 7\u201326 (1994)","journal-title":"Machine Learning"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/0222047","volume":"22","author":"S. Goldman","year":"1993","unstructured":"Goldman, S., Kearns, M., Schapire, R.: Exact identification of read-once formulas using fixed points of amplification functions. SIAM Journal on Computing\u00a022, 705\u2013726 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00224-003-1107-5","volume":"37","author":"H.U. Simon","year":"2004","unstructured":"Simon, H.U.: How many missing answers can be tolerated by query learners? Theory of Computing Systems\u00a037, 77\u201394 (2004)","journal-title":"Theory of Computing Systems"},{"key":"11_CR4","first-page":"49","volume":"3","author":"N.H. Bshouty","year":"2003","unstructured":"Bshouty, N.H., Eiron, N.: Learning monotone DNF from a teacher that almost does not answer membership queries. The Journal of Machine Learning Research\u00a03, 49\u201357 (2003)","journal-title":"The Journal of Machine Learning Research"},{"key":"11_CR5","series-title":"Lecture Notes in Artificial Intelligence","first-page":"574","volume-title":"Proceedings of COLT 2001\/EuroCOLT 2001","author":"N.H. Bshouty","year":"2001","unstructured":"Bshouty, N.H., Owshanko, A.: Learning regular sets with an incomplete membership oracle. In: Helmbold, D., Williamson, B. (eds.) COLT 2001 and EuroCOLT 2001. LNCS (LNAI), vol.\u00a02111, pp. 574\u2013588. Springer, Heidelberg (2001)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Goldman, S.A., Mathias, H.D.: Learning -term dnf formulas with an incomplete membership oracle. In: Proceedings of COLT, pp. 77\u201384 (1992)","DOI":"10.1145\/130385.130394"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-58520-6_70","volume-title":"AII 1994: Proceedings of the 4th International Workshop on Analogical and Inductive Inference","author":"Z. Chen","year":"1994","unstructured":"Chen, Z.: A note on learning dnf formulas using equivalence and incomplete membership queries. In: Arikawa, S., Jantke, K.P. (eds.) AII 1994 and ALT 1994. LNCS, vol.\u00a0872, pp. 272\u2013281. Springer, Heidelberg (1994)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. In: Proceedings of STOC, pp. 455\u2013464 (1991)","DOI":"10.1145\/103418.103466"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Jackson, J., Shamir, E., Shwartzman, C.: Learning with queries corrupted by classification noise. In: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems, pp. 45\u201353 (1997)","DOI":"10.1109\/ISTCS.1997.595156"},{"key":"11_CR10","unstructured":"Feldman, V.: Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. Journal of Machine Learning Research, 1431\u20131460 (2007)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Blum","year":"1993","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer, Heidelberg (1993)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, V., Gopalan, P., Khot, S., Ponuswami, A.: New Results for Learning Noisy Parities and Halfspaces. In: Proceedings of FOCS, pp. 563\u2013574 (2006)","DOI":"10.1109\/FOCS.2006.51"},{"key":"11_CR13","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN progress report, 42\u201344 (1978)"},{"key":"11_CR14","unstructured":"Barg, A.: Complexity issues in coding theory. Electronic Colloquium on Computational Complexity (ECCC)\u00a04 (1997)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Vardy, A.: Algorithmic complexity in coding theory and the minimum distance problem. In: Proceedings of STOC, pp. 92\u2013109 (1997)","DOI":"10.1145\/258533.258559"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M. Kearns","year":"1998","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. Journal of the ACM\u00a045, 983\u20131006 (1998)","journal-title":"Journal of the ACM"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proccedings of STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/335305.335355","volume-title":"Proceedings of STOC","author":"A. Blum","year":"2000","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Proceedings of STOC, pp. 435\u2013440. ACM Press, New York (2000)"},{"key":"11_CR19","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D. Angluin","year":"1997","unstructured":"Angluin, D., Krikis, M., Sloan, R., Tur\u00e1n, G.: Malicious Omissions and Errors in Answers to Membership Queries. Machine Learning\u00a028, 211\u2013255 (1997)","journal-title":"Machine Learning"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A theory of the learnable. Communications of the ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033, 792\u2013807 (1986)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75225-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T11:09:15Z","timestamp":1684062555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75225-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752240","9783540752257"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75225-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}