{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:40:03Z","timestamp":1750164003137,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_14","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T14:23:37Z","timestamp":1490019817000},"page":"187-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning $$AC^0$$ Under k-Dependent Distributions"],"prefix":"10.1007","author":[{"given":"Ning","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanli","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Ben-Or, M.: A theorem on probabilistic constant depth computations. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, Washington, DC, USA, pp. 471\u2013474, 30 April\u20132 May 1984. http:\/\/doi.acm.org\/10.1145\/800057.808715","DOI":"10.1145\/800057.808715"},{"issue":"2","key":"14_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01215346","volume":"14","author":"J Aspnes","year":"1994","unstructured":"Aspnes, J., Beigel, R., Furst, M., Rudich, S.: The expressive power of voting polynomials. Combinatorica 14(2), 1\u201314 (1994)","journal-title":"Combinatorica"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BF01263420","volume":"4","author":"R Beigel","year":"1994","unstructured":"Beigel, R.: When do extra majority gates help? Polylog (n) majority gates are equivalent to one. Comput. Complex. 4, 314\u2013324 (1994)","journal-title":"Comput. Complex."},{"issue":"2\u20133","key":"14_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10994-010-5179-6","volume":"80","author":"E Blais","year":"2010","unstructured":"Blais, E., O\u2019Donnell, R., Wimmer, K.: Polynomial regression under arbitrary product distributions. Mach. Learn. 80(2\u20133), 273\u2013294 (2010). http:\/\/dx.doi.org\/10.1007\/s10994-010-5179-6","journal-title":"Mach. Learn."},{"issue":"5","key":"14_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0020-0190(97)00131-2","volume":"63","author":"RB Boppana","year":"1997","unstructured":"Boppana, R.B.: The average sensitivity of bounded-depth circuits. Inf. Process. Lett. 63(5), 257\u2013261 (1997). http:\/\/dx.doi.org\/10.1016\/S0020-0190(97)00131-2","journal-title":"Inf. Process. Lett."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-662-47672-7_22","volume-title":"Automata, Languages, and Programming","author":"M Bun","year":"2015","unstructured":"Bun, M., Thaler, J.: Hardness amplification and the approximate degree of constant-depth circuits. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 268\u2013280. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47672-7_22"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Jackson, J.C., Smith, S.W.: Improved learning of AC $${}^{\\text{0}}$$ functions. In: Warmuth, M.K., Valiant, L.G. (eds.) Proceedings of the Fourth Annual Workshop on Computational Learning Theory, COLT 1991, Santa Cruz, California, USA, pp. 317\u2013325. Morgan Kaufmann, 5\u20137 August 1991. http:\/\/dl.acm.org\/citation.cfm?id=114866","DOI":"10.1016\/B978-1-55860-213-7.50032-8"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/978-3-642-15369-3_44","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P Gopalan","year":"2010","unstructured":"Gopalan, P., Servedio, R.A.: Learning and lower bounds for AC 0 with threshold gates. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX\/RANDOM -2010. LNCS, vol. 6302, pp. 588\u2013601. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15369-3_44"},{"issue":"2","key":"14_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A Hajnal","year":"1993","unstructured":"Hajnal, A., Maass, W., Pudl\u00e1k, P., Szegedy, M., Tur\u00e1n, G.: Threshold circuits of bounded depth. J. Comput. Syst. Sci. 46(2), 129\u2013154 (1993). http:\/\/dx.doi.org\/10.1016\/0022-0000(93)90001-D","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR10","unstructured":"Harsha, P., Srinivasan, S.: On polynomial approximations to $$AC^0$$ . CoRR abs\/1604.08121 (2016). http:\/\/arxiv.org\/abs\/1604.08121"},{"issue":"3","key":"14_CR11","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1006\/jcss.2001.1803","volume":"63","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: A slight sharpening of LMN. J. Comput. Syst. Sci. 63(3), 498\u2013508 (2001). http:\/\/dx.doi.org\/10.1006\/jcss.2001.1803","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","volume":"100","author":"D Haussler","year":"1992","unstructured":"Haussler, D.: Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inf. Comput. 100(1), 78\u2013150 (1992)","journal-title":"Inf. Comput."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Jackson, J.C., Klivans, A., Servedio, R.A.: Learnability beyond $$\\text{AC }^0$$ . In: IEEE Conference on Computational Complexity, p. 26. IEEE Computer Society (2002)","DOI":"10.1109\/CCC.2002.1004335"},{"issue":"6","key":"14_CR14","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1137\/060649057","volume":"37","author":"AT Kalai","year":"2008","unstructured":"Kalai, A.T., Klivans, A.R., Mansour, Y., Servedio, R.A.: Agnostically learning halfspaces. SIAM J. Comput. 37(6), 1777\u20131805 (2008). http:\/\/dx.doi.org\/10.1137\/060649057","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"14_CR15","first-page":"115","volume":"17","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Schapire, R.E., Sellie, L.: Toward efficient agnostic learning. Mach. Learn. 17(2\u20133), 115\u2013141 (1994)","journal-title":"Mach. Learn."},{"issue":"3","key":"14_CR16","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N Linial","year":"1993","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM 40(3), 607\u2013620 (1993)","journal-title":"J. ACM"},{"key":"14_CR17","first-page":"174","volume":"21","author":"A Tal","year":"2014","unstructured":"Tal, A.: Tight bounds on the fourier spectrum of $$\\rm {A}\\rm {C}^{0}$$ . Electron. Colloq. Comput. Complex. (ECCC) 21, 174 (2014). http:\/\/eccc.hpi-web.de\/report\/2014\/174","journal-title":"Electron. Colloq. Comput. Complex. (ECCC)"},{"issue":"1","key":"14_CR18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(93)90214-E","volume":"113","author":"J Tarui","year":"1993","unstructured":"Tarui, J.: Probablistic polynomials, $$\\rm {A}\\rm {C}^{0}$$ functions, and the polynomial-time hierarchy. Theor. Comput. Sci. 113(1), 167\u2013183 (1993). http:\/\/dx.doi.org\/10.1016\/0304-3975(93)90214-E","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR19","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0221023","volume":"21","author":"S Toda","year":"1992","unstructured":"Toda, S., Ogiwara, M.: Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput. 21(2), 316\u2013328 (1992). http:\/\/dx.doi.org\/10.1137\/0221023","journal-title":"SIAM J. Comput."},{"issue":"11","key":"14_CR20","doi-asserted-by":"crossref","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"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:13:56Z","timestamp":1750162436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}