{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:50Z","timestamp":1774946150637,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1023\/a:1007454427662","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"31-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Strong Minimax Lower Bounds for Learning"],"prefix":"10.1007","volume":"30","author":[{"given":"Andr\u00e1s","family":"Antos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"152250_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/238061.238160","volume-title":"Proceedings of the Ninth Annual ACM Conference on Computational Learning Theory","author":"A. Antos","year":"1996","unstructured":"Antos, A., & Lugosi, G. (1996). Strong minimax lower bounds for learning. Proceedings of the Ninth Annual ACM Conference on Computational Learning Theory (pp. 303\u2013309). New York: Association for Computing Machinery."},{"key":"152250_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.5802\/aif.938","volume":"33","author":"P. Assouad","year":"1983","unstructured":"Assouad, P. (1983). Densit\u00e9 et dimension. Annales de l'Institut Fourier, 33:233\u2013282.","journal-title":"Annales de l'Institut Fourier"},{"key":"152250_CR3","doi-asserted-by":"crossref","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. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929\u2013965.","journal-title":"Journal of the ACM"},{"key":"152250_CR4","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/0031-3203(94)00141-8","volume":"28","author":"L. Devroye","year":"1995","unstructured":"Devroye, L., & Lugosi, G. (1995). Lower bounds in pattern recognition and learning.Pattern Recognition, 28:1011\u20131018.","journal-title":"Pattern Recognition"},{"key":"152250_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., & Lugosi, G. (1996). A Probabilistic Theory of Pattern Recognition. New York: Springer-Verlag."},{"key":"152250_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989).A general lower bound on the number of examples needed for learning. Information and Computation, 82:247\u2013261.","journal-title":"Information and Computation"},{"key":"152250_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1006\/inco.1994.1097","volume":"115","author":"D. Haussler","year":"1994","unstructured":"Haussler, D., Littlestone, N., & Warmuth, M. (1994). Predicting {0, 1}-functions on randomly drawn points. Information and Computation, 115:248\u2013292.","journal-title":"Information and Computation"},{"key":"152250_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-7152(94)00207-O","volume":"25","author":"G. Lugosi","year":"1995","unstructured":"Lugosi, G. (1995). Improved upper bounds for probabilities of uniform deviations. Statistics and Probability Letters, 25:71\u201377.","journal-title":"Statistics and Probability Letters"},{"key":"152250_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9620-8","volume-title":"Approximate Distributions of Order Statistics","author":"R.-D. Reiss","year":"1989","unstructured":"Reiss, R.-D. (1989). Approximate Distributions of Order Statistics. New York: Springer-Verlag."},{"key":"152250_CR10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-59119-2_184","volume-title":"Computational Learning Theory: Second European Conference. EuroCOLT'95","author":"D. Schuurmans","year":"1995","unstructured":"Schuurmans, D. (1995). Characterizing rational versus exponential learning curves. Computational Learning Theory: Second European Conference. EuroCOLT'95 (pp. 272\u2013286). New York: Springer-Verlag."},{"key":"152250_CR11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0166-218X(93)90179-R","volume":"42","author":"J. Shawe-Taylor","year":"1993","unstructured":"Shawe-Taylor, J., Anthony, M., & Biggs, N.L. (1993). Bounding sample size with the Vapnik-Chervonenkis dimension. Discrete Applied Mathematics, 42:65\u201373.","journal-title":"Discrete Applied Mathematics"},{"key":"152250_CR12","volume-title":"Theory of Pattern Recognition","author":"V.N. Vapnik","year":"1979","unstructured":"Vapnik, V.N., & Chervonenkis, A.Ya. (1979). Theory of Pattern Recognition. Moscow: Nauka, 1974 (in Russian); German translation: Theorie der Zeichenerkennung, Berlin: Akademie Verlag."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007454427662.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007454427662\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007454427662.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:33:34Z","timestamp":1752147214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007454427662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["152250"],"URL":"https:\/\/doi.org\/10.1023\/a:1007454427662","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}