{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:30:27Z","timestamp":1739338227360,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_44","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T02:39:51Z","timestamp":1250822391000},"page":"588-600","source":"Crossref","is-referenced-by-count":6,"title":["Baum\u2019s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions"],"prefix":"10.1007","author":[{"given":"Adam R.","family":"Klivans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex K.","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11503415_31","volume-title":"Learning Theory","author":"D. Achlioptas","year":"2005","unstructured":"Achlioptas, D., McSherry, F.: On spectral learning with mixtures of distributions. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 458\u2013469. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Arriaga, R., Vempala, S.: An algorithmic theory of learning: Robust concepts and random projection. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 616\u2013623 (1999)","key":"44_CR2","DOI":"10.1109\/SFFCS.1999.814637"},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1162\/neco.1990.2.4.510","volume":"2","author":"E. Baum","year":"1990","unstructured":"Baum, E.: A polynomial time algorithm that learns two hidden unit nets. Neural Computation\u00a02(4), 510\u2013522 (1990)","journal-title":"Neural Computation"},{"issue":"2","key":"44_CR4","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1006\/jcss.1997.1475","volume":"54","author":"A. Blum","year":"1997","unstructured":"Blum, A., Kannan, R.: Learning an intersection of a constant number of halfspaces under a uniform distribution. Journal of Computer and System Sciences\u00a054(2), 371\u2013380 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"44_CR5","doi-asserted-by":"publisher","DOI":"10.1142\/5997","volume-title":"Mathematics of Physics and Engineering","author":"E.K. Blum","year":"2006","unstructured":"Blum, E.K., Lototsky, S.V.: Mathematics of Physics and Engineering. World Scientific, Singapore (2006)"},{"issue":"4","key":"44_CR6","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik-Chervonenkis dimension. JACM\u00a036(4), 929\u2013965 (1989)","journal-title":"JACM"},{"issue":"3","key":"44_CR7","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1109\/TIT.2006.890699","volume":"53","author":"C. Caramanis","year":"2007","unstructured":"Caramanis, C., Mannor, S.: An inequality for nearly log-concave distributions with applications to learning. IEEE Transactions on Information Theory\u00a053(3), 1043\u20131057 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Dunagan, J.D.: A geometric theory of outliers and perturbation. PhD thesis, MIT (2002)","key":"44_CR8"},{"doi-asserted-by":"crossref","unstructured":"Kalai, A., Klivans, A., Mansour, Y., Servedio, R.: Agnostically learning halfspaces. In: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 11\u201320 (2005)","key":"44_CR9","DOI":"10.1109\/SFCS.2005.13"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/11503415_30","volume-title":"Learning Theory","author":"Ravindran Kannan","year":"2005","unstructured":"Kannan, R., Salmasian, H., Vempala, S.: The spectral method for general mixture models. In: Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT), pp. 444\u2013457 (2005)"},{"key":"44_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to computational learning theory","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Vazirani, U.: An introduction to computational learning theory. MIT Press, Cambridge (1994)"},{"doi-asserted-by":"crossref","unstructured":"Klivans, A., O\u2019Donnell, R., Servedio, R.: Learning geometric concepts via Gaussian surface area. In: Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 541\u2013550 (2008)","key":"44_CR12","DOI":"10.1109\/FOCS.2008.64"},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-540-27819-1_24","volume-title":"Learning Theory","author":"Adam R. Klivans","year":"2004","unstructured":"Klivans, A., Servedio, R.: Learning intersections of halfspaces with a margin. In: Proceedings of the 17th Annual Conference on Learning Theory, pp. 348\u2013362 (2004)"},{"issue":"3","key":"44_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/rsa.20135","volume":"30","author":"L. Lov\u00e1sz","year":"2007","unstructured":"Lov\u00e1sz, L., Vempala, S.: The geometry of logconcave functions and sampling algorithms. Random Structures and Algorithms\u00a030(3), 307\u2013358 (2007)","journal-title":"Random Structures and Algorithms"},{"key":"44_CR15","volume-title":"Estimations of dependences based on statistical data","author":"V. Vapnik","year":"1982","unstructured":"Vapnik, V.: Estimations of dependences based on statistical data. Springer, Heidelberg (1982)"},{"doi-asserted-by":"crossref","unstructured":"Vempala, S.: A random sampling based algorithm for learning the intersection of halfspaces. In: Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 508\u2013513 (1997)","key":"44_CR16","DOI":"10.1109\/SFCS.1997.646139"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:24:12Z","timestamp":1739305452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}