{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T12:52:55Z","timestamp":1772801575845,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,5,25]],"date-time":"2007-05-25T00:00:00Z","timestamp":1180051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2007,10,11]]},"DOI":"10.1007\/s10994-007-5010-1","type":"journal-article","created":{"date-parts":[[2007,5,25]],"date-time":"2007-05-25T03:22:53Z","timestamp":1180063373000},"page":"97-114","source":"Crossref","is-referenced-by-count":22,"title":["Unconditional lower bounds for learning intersections of halfspaces"],"prefix":"10.1007","volume":"69","author":[{"given":"Adam R.","family":"Klivans","sequence":"first","affiliation":[]},{"given":"Alexander A.","family":"Sherstov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,25]]},"reference":[{"key":"5010_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Braverman, M., Feldman, V., Klivans, A., & Pitassi, T. (2004). Learnability and automatizability. In Proceedings of the 45th annual symposium on foundations of computer science (FOCS).","DOI":"10.1109\/FOCS.2004.36"},{"issue":"2","key":"5010_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01215346","volume":"14","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Beigel, R., Furst, M. L., & Rudich, S. (1994). The expressive power of voting polynomials. Combinatorica, 14(2), 135\u2013148.","journal-title":"Combinatorica"},{"issue":"2","key":"5010_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1006\/jcss.1995.1017","volume":"50","author":"R. Beigel","year":"1995","unstructured":"Beigel, R., Reingold, N., & Spielman, D. A. (1995). PP is closed under intersection. Journal of Computer and System Sciences, 50(2), 191\u2013202.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\/2","key":"5010_CR4","first-page":"35","volume":"22","author":"A. Blum","year":"1997","unstructured":"Blum, A., Frieze, A., Kannan, R., & Vempala, S. (1997). A polynomial time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1\/2), 35\u201352.","journal-title":"Algorithmica"},{"key":"5010_CR5","first-page":"253","volume-title":"Proceedings of the 26th annual ACM symposium on theory of computing (STOC)","author":"A. Blum","year":"1994","unstructured":"Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., & Rudich, S. (1994). Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the 26th annual ACM symposium on theory of computing (STOC) (pp. 253\u2013262). New York: ACM."},{"issue":"4","key":"5010_CR6","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum, A., Kalai, A., & Wasserman, H. (2003). Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM, 50(4), 506\u2013519.","journal-title":"Journal of the ACM"},{"issue":"2","key":"5010_CR7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","volume":"3","author":"J. Bruck","year":"1990","unstructured":"Bruck, J. (1990). Harmonic analysis of polynomial threshold functions. SIAM Journal on Discrete Mathematics, 3(2), 168\u2013177.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"5010_CR8","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1145\/234533.234564","volume":"43","author":"N. H. Bshouty","year":"1996","unstructured":"Bshouty, N. H., & Tamon, C. (1996). On the Fourier spectrum of monotone functions. Journal of the ACM, 43(4), 747\u2013770.","journal-title":"Journal of the ACM"},{"key":"5010_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, V., Gopalan, P., Khot, S., & Ponnuswami, A. K. (2006). New results for learning noisy parities and halfspaces. In Proceedings of the 47th annual symposium on foundations of computer science (FOCS) (pp. 563\u2013574).","DOI":"10.1109\/FOCS.2006.51"},{"key":"5010_CR10","unstructured":"Jackson, J. C. (1995). The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice. PhD thesis, Carnegie Mellon University."},{"key":"5010_CR11","first-page":"392","volume-title":"Proceedings of the 25th annual ACM symposium on theory of computing (STOC)","author":"M. Kearns","year":"1993","unstructured":"Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. In Proceedings of the 25th annual ACM symposium on theory of computing (STOC) (pp. 392\u2013401). New York: ACM."},{"issue":"4","key":"5010_CR12","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1016\/j.jcss.2003.11.002","volume":"68","author":"A. Klivans","year":"2004","unstructured":"Klivans, A., O\u2019Donnell, R., & Servedio, R. (2004). Learning intersections and thresholds of halfspaces. Journal of Computer and System Sciences, 68(4), 808\u2013840.","journal-title":"Journal of Computer and System Sciences"},{"key":"5010_CR13","doi-asserted-by":"crossref","unstructured":"Klivans, A., & Servedio, R. (2004). Learning intersections of halfspaces with a margin. In Proceedings of the 17th annual conference on learning theory (pp. 348\u2013362).","DOI":"10.1007\/978-3-540-27819-1_24"},{"key":"5010_CR14","doi-asserted-by":"crossref","unstructured":"Klivans, A. R., & Sherstov, A. A. (2006). Cryptographic hardness for learning intersections of halfspaces. In Proceedings of the 47th annual symposium on foundations of computer science (FOCS) (pp. 553\u2013562), October 2006.","DOI":"10.1109\/FOCS.2006.24"},{"issue":"1\u20132","key":"5010_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0304-3975(96)00019-9","volume":"174","author":"M. Krause","year":"1997","unstructured":"Krause, M., & Pudl\u00e1k, P. (1997). On the computational power of depth-2 circuits with threshold and modulo gates. Theoretical Computer Science, 174(1\u20132), 137\u2013156.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"5010_CR16","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., & Mansour, Y. (1993). Learning decision trees using the Fourier spectrum. SIAM Journal on Computing, 22(6), 1331\u20131348.","journal-title":"SIAM Journal on Computing"},{"issue":"1\/2","key":"5010_CR17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/PL00013834","volume":"22","author":"S. Kwek","year":"1998","unstructured":"Kwek, S., & Pitt, L. (1998). PAC learning intersections of halfspaces with membership queries. Algorithmica, 22(1\/2), 53\u201375.","journal-title":"Algorithmica"},{"key":"5010_CR18","volume-title":"The theory of error correcting codes","author":"F. J. Macwilliams","year":"1977","unstructured":"Macwilliams, F. J., & Sloane, N. J. A. (1977). The theory of error correcting codes. Amsterdam: North-Holland."},{"key":"5010_CR19","volume-title":"Perceptrons: expanded edition","author":"M. L. Minsky","year":"1988","unstructured":"Minsky, M. L., & Papert, S. A. (1988). Perceptrons: expanded edition. Cambridge: MIT."},{"key":"5010_CR20","unstructured":"O\u2019Donnell, R. (2003). Computational applications of noise sensitivity. PhD thesis, Massachusetts Institute of Technology."},{"key":"5010_CR21","first-page":"325","volume-title":"Proceedings of the 25th annual ACM symposium on theory of computing (STOC)","author":"R. O\u2019Donnell","year":"2003","unstructured":"O\u2019Donnell, R., & Servedio, R. A. (2003). New degree bounds for polynomial threshold functions. In Proceedings of the 25th annual ACM symposium on theory of computing (STOC) (pp. 325\u2013334). New York: ACM."},{"issue":"2","key":"5010_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0012-365X(71)90025-2","volume":"1","author":"P. O\u2019Neil","year":"1971","unstructured":"O\u2019Neil, P. (1971). Hyperplane cuts of an n-cube. Discrete Mathematics, 1(2), 193\u2013195.","journal-title":"Discrete Mathematics"},{"key":"5010_CR23","first-page":"211","volume":"1993","author":"M. E. Saks","year":"1993","unstructured":"Saks, M. E. (1993). Slicing the hypercube. Surveys in Combinatorics, 1993, 211\u2013255.","journal-title":"Surveys in Combinatorics"},{"issue":"11","key":"5010_CR24","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5010_CR25","doi-asserted-by":"crossref","unstructured":"Vempala, S. (1997). A random sampling based algorithm for learning the intersection of halfspaces. In Proceedings of the 38th annual symposium on foundations of computer science (FOCS) (pp. 508\u2013513).","DOI":"10.1109\/SFCS.1997.646139"},{"issue":"4","key":"5010_CR26","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jcss.2004.10.003","volume":"70","author":"K. Yang","year":"2005","unstructured":"Yang, K. (2005). New lower bounds for statistical query learning. Journal of Computer and System Sciences, 70(4), 485\u2013509.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5010-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-007-5010-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5010-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:23Z","timestamp":1559338823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-007-5010-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,25]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,10,11]]}},"alternative-id":["5010"],"URL":"https:\/\/doi.org\/10.1007\/s10994-007-5010-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,25]]}}}