{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:48:15Z","timestamp":1742996895771,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319463780"},{"type":"electronic","value":"9783319463797"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46379-7_7","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:54:33Z","timestamp":1474368873000},"page":"98-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Evolution of Monotone Conjunctions: Drilling for Best Approximations"],"prefix":"10.1007","author":[{"given":"Dimitrios I.","family":"Diochnos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2701427","volume":"12","author":"M Ajtai","year":"2016","unstructured":"Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algorithms 12(2), 19 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Angelino, E., Kanade, V.: Attribute-efficient evolvability of linear functions. In: ITCS, pp. 287\u2013300 (2014)","DOI":"10.1145\/2554797.2554824"},{"issue":"4","key":"7_CR3","first-page":"343","volume":"2","author":"D Angluin","year":"1987","unstructured":"Angluin, D., Laird, P.D.: Learning from noisy examples. Mach. Learn. 2(4), 343\u2013370 (1987)","journal-title":"Mach. Learn."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcss.1997.1558","volume":"56","author":"JA Aslam","year":"1998","unstructured":"Aslam, J.A., Decatur, S.E.: Specification and simulation of statistical query algorithms for efficiency and noise tolerance. J. Comput. Syst. Sci. 56(2), 191\u2013208 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR5","first-page":"359","volume":"2","author":"NH Bshouty","year":"2002","unstructured":"Bshouty, N.H., Feldman, V.: On using extended statistical queries to avoid membership queries. J. Mach. Learn. Res. 2, 359\u2013395 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Diochnos, D.I., Tur\u00e1n, G.: On evolvability: the swapping algorithm, product distributions, and covariance. In: SAGA, pp. 74\u201388 (2009)","DOI":"10.1007\/978-3-642-04944-6_7"},{"issue":"1\u20132","key":"7_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1\u20132), 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, V.: Evolvability from learning algorithms. In: STOC, pp. 619\u2013628 (2008)","DOI":"10.1145\/1374376.1374465"},{"key":"7_CR9","unstructured":"Feldman, V.: Robustness of Evolvability. In: COLT, pp. 277\u2013292 (2009)"},{"key":"7_CR10","unstructured":"Feldman, V.: Distribution-independent evolvability of linear threshold functions. In: COLT, pp. 253\u2013272 (2011)"},{"issue":"5","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1016\/j.jcss.2011.12.024","volume":"78","author":"V Feldman","year":"2012","unstructured":"Feldman, V.: A complete characterization of statistical query learning with applications to evolvability. J. Comput. Syst. Sci. 78(5), 1444\u20131459 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01300374","volume":"14","author":"SA Goldman","year":"1995","unstructured":"Goldman, S.A., Sloan, R.H.: Can PAC learning algorithms tolerate random attribute noise? Algorithmica 14(1), 70\u201384 (1995)","journal-title":"Algorithmica"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Kanade, V.: Evolution with recombination. In: FOCS, pp. 837\u2013846 (2011)","DOI":"10.1109\/FOCS.2011.24"},{"key":"7_CR14","unstructured":"Kanade, V., Valiant, L.G., Vaughan, J.W.: Evolution with drifting targets. In: COLT, pp. 155\u2013167 (2010)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kearns, M.J.: Efficient noise-tolerant learning from statistical queries. In: STOC, pp. 392\u2013401 (1993)","DOI":"10.1145\/167088.167200"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2012.08.009","volume":"462","author":"L Michael","year":"2012","unstructured":"Michael, L.: Evolvability via the Fourier transform. Theor. Comput. Sci. 462, 88\u201398 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sz\u00f6r\u00e9nyi, B.: Characterizing statistical query learning: simplified notions and proofs. In: ALT, pp. 186\u2013200 (2009)","DOI":"10.1007\/978-3-642-04414-4_18"},{"issue":"11","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-74456-6_5","volume-title":"Mathematical Foundations of Computer Science 2007","author":"LG Valiant","year":"2007","unstructured":"Valiant, L.G.: Evolvability. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 22\u201343. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74456-6_5"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Valiant, P.: Distribution free evolvability of polynomial functions over all convex loss functions. In: ITCS, pp. 142\u2013148 (2012)","DOI":"10.1145\/2090236.2090248"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2633598","volume":"6","author":"P Valiant","year":"2014","unstructured":"Valiant, P.: Evolvability of real functions. ACM Trans. Comput. Theor. 6(3), 12:1\u201312:19 (2014)","journal-title":"ACM Trans. Comput. Theor."},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-48224-5_6","volume-title":"Automata, Languages and Programming","author":"I Wegener","year":"2001","unstructured":"Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 64\u201378. Springer, Heidelberg (2001). doi:10.1007\/3-540-48224-5_6"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46379-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:05:44Z","timestamp":1710165944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46379-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319463780","9783319463797"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46379-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Learning Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}