Structural results about on-line learning models with and without queries

Machine Learning

Volumn 36, Issue 3, 1999, Pages 147-181

  Auer, Peter ^a   Long, Philip M ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING; QUERY LANGUAGES;

FUNCTION LEARNING; MISTAKE-BOUND MODEL;

LEARNING SYSTEMS;

EID: 0032595785     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007614417594     Document Type: Article

References (28)

1. 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-272).
2. Auer, P., Long, P. M., Maass, W., & Woeginger, G. J. (1995). On the complexity of function learning. Machine Learning, 18(2), 187-236.
3. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319-342.
4. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. JACM, 36(4), 929-965.
5. 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-286. Earlier version in 6th COLT. 1993.
6. Cesa-Bianchi, Nicolò, 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-485.
7. Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., & Warmuth, M. K. (1996). On-line prediction and conversion strategies. Machine Learning, 25, 71-114.
8. Dayan, P. (1992). The convergence of TD(λ) for general λ. Machine Learning, 8, 341-362.
9. Feder, M., Merhav, N., & Gutman, M. (1992). Universal prediction of individual sequences. IEEE Transactions of Information Theory, 38, 1258-1270.
10. 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-295).
11. Kearns, M. J., Schapire, R. E., & Sellie, L. M. (1994). Toward efficient agnostic learning. Machine Learning, 17, 115-141.
12. Kulkarni, S. R., Mitter, S. K., & Tsitsiklis, J. N. (1993). Active learning using arbitrary binary valued queries. Machine Learning, 11(1), 23-36.
13. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2, 285-318.
14. Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. Ph.D. thesis, UC Santa Cruz.
15. Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
16. Maass, W., & Turán, G. (1989). On the complexity of learning from counterexamples. Proceedings of the 30th Annual Symposium on the Foundations of Computer Science (pp. 262-267).
17. Maass, W., & Turán, 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-210).
18. Maass, W., & Turán, G. (1992). Lower bound methods and separation results for on-line learning models. Machine Learning, 9, 107-145.
19. Merhav, N., & Feder, M. (1993). Universal schemes for sequential decision from individual data sequences. IEEE Trans. Inform. Theory, 39(4), 1280-1291.
20. Samuel, A. L. (1959). Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 210-229.
21. Schapire, R. E., & Warmuth, M. K. (1996). On the worst-case analysis of temporal-difference learning algorithms. Machine Learning, 95-121.
22. Shvaytser, H. (1988). Manuscript.
23. Sutton, R. S. (1984). Temporal credit assignment in reinforcement learning. Ph.D. thesis, University of Massachusetts, Amherst.
24. Sutton, R. S. (1988). Learning to predict by methods of temporal difference. Machine Learning, 3, 9-44.
25. 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-280.
26. Vovk, V. (1990). Aggregating strategies. In Proceedings of the 3nd Workshop on Computational Learning Theory (pp. 371-383). Morgan Kaufmann.
27. Vovk, V. (1992). Universal forecasting algorithms. Information and Computation, 96(2), 245-277.
28. Watkins, C. I. C. H. (1989). Learning from delayed rewards. Ph.D. thesis, University of Cambridge.