{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:45:00Z","timestamp":1760607900217,"version":"3.41.2"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":[[1999,9]]},"DOI":"10.1023\/a:1007614417594","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"147-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Structural Results About On-line Learning Models With and Without Queries"],"prefix":"10.1007","volume":"36","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"236581_CR1","doi-asserted-by":"crossref","unstructured":"Auer, P., & Long, P. M. (1994). Simulating access to hidden information while learning. Proceedings of the 26th ACM Symposium on the Theory of Computing (pp. 263\u2013272).","DOI":"10.1145\/195058.195152"},{"issue":"2","key":"236581_CR2","first-page":"187","volume":"18","author":"P. Auer","year":"1995","unstructured":"Auer, P., Long, P. M., Maass, W., & Woeginger, G. J. (1995). On the complexity of function learning. Machine Learning, 18(2), 187\u2013236.","journal-title":"Machine Learning"},{"key":"236581_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319\u2013342.","journal-title":"Machine Learning"},{"issue":"4","key":"236581_CR4","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. JACM, 36(4), 929\u2013965.","journal-title":"JACM"},{"issue":"2","key":"236581_CR5","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1006\/jcss.1996.0021","volume":"52","author":"N. H. Bshouty","year":"1996","unstructured":"Bshouty, Nader H., Goldman, Sally A., Hancock, Thomas R., & Mater, Sleiman. (1996). Asking questions to minimize errors. J. of Comput. Syst. Sci., 52(2), 268\u2013286. Earlier version in 6th COLT. 1993.","journal-title":"J. of Comput. Syst. Sci."},{"issue":"3","key":"236581_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. F. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, Nicol\u00f2, Freund, Yoav, Haussler, David, Helmbold, David P., Schapire, Robert E., & Warmuth, Manfred K. (1997, May). How to use expert advice. Journal of the Association for Computing Machinery, 44(3), 427\u2013485.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"236581_CR7","first-page":"71","volume":"25","author":"N. Cesa-Bianchi","year":"1996","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., & Warmuth, M. K. (1996). On-line prediction and conversion strategies. Machine Learning, 25, 71\u2013114.","journal-title":"Machine Learning"},{"key":"236581_CR8","first-page":"341","volume":"8","author":"P. Dayan","year":"1992","unstructured":"Dayan, P. (1992). The convergence of TD(\u03bb) for general \u03bb\u00b8. Machine Learning, 8, 341\u2013362.","journal-title":"Machine Learning"},{"key":"236581_CR9","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/18.144706","volume":"38","author":"M. Feder","year":"1992","unstructured":"Feder, M., Merhav, N., & Gutman, M. (1992). Universal prediction of individual sequences. IEEE Transactions of Information Theory, 38, 1258\u20131270.","journal-title":"IEEE Transactions of Information Theory"},{"key":"236581_CR10","doi-asserted-by":"crossref","unstructured":"Kearns, M., Li, M., Pitt, L., & Valiant, L. G. (1987). On the learnability of Boolean formulae. Proceedings of the 19th Annual Symposium on the Theory of Computation (pp. 285\u2013295).","DOI":"10.1145\/28395.28426"},{"key":"236581_CR11","first-page":"115","volume":"17","author":"M. J. Kearns","year":"1994","unstructured":"Kearns, M. J., Schapire, R. E., & Sellie, L. M. (1994). Toward efficient agnostic learning. Machine Learning, 17, 115\u2013141.","journal-title":"Machine Learning"},{"issue":"1","key":"236581_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1022627018023","volume":"11","author":"S. R. Kulkarni","year":"1993","unstructured":"Kulkarni, S. R., Mitter, S. K., & Tsitsiklis, J. N. (1993). Active learning using arbitrary binary valued queries. Machine Learning, 11(1), 23\u201336.","journal-title":"Machine Learning"},{"key":"236581_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2, 285\u2013318.","journal-title":"Machine Learning"},{"key":"236581_CR14","unstructured":"Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. Ph.D. thesis, UC Santa Cruz."},{"key":"236581_CR15","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212\u2013261.","journal-title":"Information and Computation"},{"key":"236581_CR16","doi-asserted-by":"crossref","unstructured":"Maass, W., & Tur\u00e1n, G. (1989). On the complexity of learning from counterexamples. Proceedings of the 30th Annual Symposium on the Foundations of Computer Science (pp. 262\u2013267).","DOI":"10.1109\/SFCS.1989.63488"},{"key":"236581_CR17","doi-asserted-by":"crossref","unstructured":"Maass, W., & Tur\u00e1n, G. (1990). On the complexity of learning from counterexamples and membership queries. Proceedings of the 31st Annual Symposium on the Foundations of Computer Science (pp. 203\u2013210).","DOI":"10.1109\/FSCS.1990.89539"},{"key":"236581_CR18","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"Maass,W., & Tur\u00e1n, G. (1992). Lower bound methods and separation results for on-line learning models. Machine Learning, 9, 107\u2013145.","journal-title":"Machine Learning"},{"issue":"4","key":"236581_CR19","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1109\/18.243445","volume":"39","author":"N. Merhav","year":"1993","unstructured":"Merhav, N., & Feder, M. (1993). Universal schemes for sequential decision from individual data sequences. IEEE Trans. Inform. Theory, 39(4), 1280\u20131291.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"236581_CR20","doi-asserted-by":"crossref","unstructured":"Samuel, A. L. (1959). Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 210\u2013229.","DOI":"10.1147\/rd.33.0210"},{"key":"236581_CR21","doi-asserted-by":"crossref","unstructured":"Schapire, R. E., & Warmuth, M. K. (1996). On the worst-case analysis of temporal-difference learning algorithms. Machine Learning, 95\u2013121.","DOI":"10.1007\/978-0-585-33656-5_6"},{"key":"236581_CR22","unstructured":"Shvaytser, H. (1988). Manuscript."},{"key":"236581_CR23","volume-title":"Temporal credit assignment in reinforcement learning","author":"R. S. Sutton","year":"1984","unstructured":"Sutton, R. S. (1984). Temporal credit assignment in reinforcement learning. Ph.D. thesis, University of Massachusetts, Amherst."},{"key":"236581_CR24","first-page":"9","volume":"3","author":"R. S. Sutton","year":"1988","unstructured":"Sutton, R. S. (1988). Learning to predict by methods of temporal difference. Machine Learning, 3, 9\u201344.","journal-title":"Machine Learning"},{"issue":"2","key":"236581_CR25","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. N. Vapnik","year":"1971","unstructured":"Vapnik, V. N., & Chervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2), 264\u2013280.","journal-title":"Theory of Probability and its Applications"},{"key":"236581_CR26","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990). Aggregating strategies. In Proceedings of the 3nd Workshop on Computational Learning Theory (pp. 371\u2013383). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"issue":"2","key":"236581_CR27","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0890-5401(92)90050-P","volume":"96","author":"V. Vovk","year":"1992","unstructured":"Vovk, V. (1992). Universal forecasting algorithms. Information and Computation, 96(2), 245\u2013277.","journal-title":"Information and Computation"},{"key":"236581_CR28","unstructured":"Watkins, C. I. C. H. (1989). Learning from delayed rewards. Ph.D. thesis, University of Cambridge."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007614417594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007614417594\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007614417594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:32:08Z","timestamp":1752147128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007614417594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["236581"],"URL":"https:\/\/doi.org\/10.1023\/a:1007614417594","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1999,9]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}