{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:17:14Z","timestamp":1781835434043,"version":"3.54.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":[[2001,11]]},"DOI":"10.1023\/a:1010950718922","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:10:54Z","timestamp":1040598654000},"page":"123-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":103,"title":["Learning with Maximum-Entropy Distributions"],"prefix":"10.1007","volume":"45","author":[{"given":"Yishay","family":"Mansour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariano","family":"Schain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"357650_CR1","first-page":"444","volume-title":"Proceedings of the 23rd Annual ACM Symposium Theory Computing","author":"D. Angluin","year":"1991","unstructured":"Angluin, D. & Kharitonov, M. (1991). When won't membership queries help? In Proceedings of the 23rd Annual ACM Symposium Theory Computing (pp. 444\u2013454). New York: ACM."},{"key":"357650_CR2","unstructured":"Aslam, J. A. & Decatur, S. E. (1994). Improved nose-tolerant learning and generalized statistical queries. Tech. rep. TR-17-94, Harvard University."},{"issue":"2","key":"357650_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(91)90026-X","volume":"86","author":"G. M. Benedek","year":"1991","unstructured":"Benedek, G. M. & Itai, A. (1991). Learnability with respect to fixed distributions. Theoretical Computer Science, 86(2), 377\u2013390.","journal-title":"Theoretical Computer Science"},{"key":"357650_CR4","volume-title":"Elements of Information Theory","author":"T. M. Cover","year":"1991","unstructured":"Cover, T. M. & Thomas, J. A. (1991). Elements of Information Theory. New York, NY: John Wiley and Sons Inc."},{"key":"357650_CR5","first-page":"179","volume-title":"Proceedings of the 2nd Annual Workshop on Computational Learning Theory","author":"T. Hancock","year":"1991","unstructured":"Hancock, T. & Mansour, Y. (1991). Learning monotone k? dnf formulas on product distributions. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory (pp. 179\u2013183). San Mateo, CA: Morgan Kaufmann."},{"issue":"2","key":"357650_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","volume":"95","author":"D. Haussler","year":"1991","unstructured":"Haussler, D., Kearns, M., Littlestone, N., & Warmuth, M. K. (1991). Equivalence of models for polynominal learnability. Information and Computation, 95(2), 129\u2013161.","journal-title":"Information and Computation"},{"key":"357650_CR7","doi-asserted-by":"crossref","unstructured":"Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (pp. 392\u2013401).","DOI":"10.1145\/167088.167200"},{"issue":"6","key":"357650_CR8","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1145\/195613.195656","volume":"41","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Li, M., & Valiant, L. G. (1994). Learning boolean formulas. Journal of the ACM, 41(6), 1298\u20131328.","journal-title":"Journal of the ACM"},{"key":"357650_CR9","doi-asserted-by":"crossref","unstructured":"Kearns, M. & Valiant, L. G. (1989). Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (pp. 433\u2013444).","DOI":"10.1145\/73007.73049"},{"key":"357650_CR10","doi-asserted-by":"crossref","unstructured":"Kilian, J.& Naor,M. (1995). On the complexity of statistical reasoning. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (pp. 209\u2013217).","DOI":"10.1109\/ISTCS.1995.377030"},{"key":"357650_CR11","doi-asserted-by":"crossref","unstructured":"Koller, D. & Megiddo, N. (1993). Constructing small sample spaces satisfying given constraints. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (pp. 268\u2013277).","DOI":"10.1145\/167088.167168"},{"key":"357650_CR12","doi-asserted-by":"crossref","unstructured":"Natarajan, B. K. (1987). On learning boolean functions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 296\u2013304). New York.","DOI":"10.1145\/28395.28427"},{"key":"357650_CR13","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"A. Papoulis","year":"1991","unstructured":"Papoulis, A. (1991). Probability, Random Variables, and Stochastic Processes (3rd edn.), ch. 15. New York, NY: McGraw-Hill.","edition":"3rd edn."},{"issue":"4","key":"357650_CR14","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"Pitt, L. & Valiant, L. G. (1988). Computational limitations on learning from examples. Journal of the ACM, 35(4), 965\u2013984.","journal-title":"Journal of the ACM"},{"key":"357650_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2221-6","volume-title":"Maximum-Entropy and Bayesian Methods in Inverse Problems","author":"R. C. Smith","year":"1985","unstructured":"Smith, R. C. & Grandy,W. (1985). Maximum-Entropy and Bayesian Methods in Inverse Problems. Dordrecht: D. Reidel Publishing Company."},{"issue":"11","key":"357650_CR16","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"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010950718922.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010950718922\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010950718922.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:33:02Z","timestamp":1752147182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010950718922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["357650"],"URL":"https:\/\/doi.org\/10.1023\/a:1010950718922","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}