Apple tasting

Information and Computation

Volumn 161, Issue 2, 2000, Pages 85-139

  Helmbold, David P ^a   Littlestone, Nicholas ^b   Long, Philip M ^c  

^a University of California Santa Cruz   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBABILITY;

APPLE TASTING MODEL;

LEARNING ALGORITHMS;

EID: 0034666805     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2870     Document Type: Article

References (26)

1. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. Gambling in a rigged casino: The adversarial multi-armed bandit problem, in "Proceedings, 36th Annual Symposium on the Foundations of Computer Science, 1995."
2. Angluin, D. (1988), Queries and concept learning, Machine Learning 2, 319-342.
3. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. K. (1987), Occam's razor, Inform. Process. Lett. 24, 377-380.
4. Berger, J. O. (1980), "Statistical Decision Theory and Bayesian Analysis," Springer-Verlag, Berlin/New York.
5. Barzdin, J. M., and Freivald, R. V. (1972), On the prediction of general recursive functions, Soviet Math. Dok. 13, 1224-1228.
6. Blum, A., Hellerstein, L., and Littlestone, N. Learning in the presence of finitely many or infinitely many irrelevant attributes, in "Proceedings, Workshop on Computational Learning Theory, 1991."
7. Blum, A. Learning boolean functions in an infinite attribute space, in "Proceedings, 22nd ACM Symposium on the Theory of Computing, 1990."
8. Blum, A. Separating PAC and mistake-bound learning models over the boolean domain, in "Proceedings, 31st Annual Symposium on the Foundations of Computer Science, 1990."
9. Feller, W. (1968), "An Introduction to Probability and Its Applications," Vol. 1, 3rd ed., Wiley, New York.
10. Helmbold, D. P., Littlestone, N., and Long, P. M. (2000), On-line learning with linear loss constraints, Inform. and Comput. 161, 140-171, doi:10.1006/inco.2000.2871.
11. Helmbold, D. P., Littlestone, N., and Long, P. M. Apple tasting and nearly one-sided learning, in "Proceedings, 33rd Annual Symposium on the Foundations of Computer Science, 1992." Inform. and Comput., to appear.
12. Haussler, D., Littlestone, N., and Warmuth, M. K. (1994), Predicting {0, 1}-functions on randomly drawn points, Inform. and Comput. 115(2), 129-161.
13. Helmbold, D., Sloan, R., and Warmuth, M. K. Learning lattices and reversible, commutative regular languages, in "Proceedings, Workshop on Computational Learning Theory, 1990."
14. Kearns, M., Li, M., Pitt, L., and Valiant, L. G. On the learnability of Boolean formulae, in "Proceedings, 19th Annual Symposium on the Theory of Computation, 1987," pp. 285-295.
15. Littlestone, N. (1988), Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, Machine Learning 2, 285-318.
16. Littlestone, N. (1989), "Mistake Bounds and Logarithmic Linear-Threshold Learning Algorithms," Ph.D. thesis UC, Santa Cruz.
17. Long, P. M. On-line evaluation and prediction using linear functions, in "Proceedings, Conference on Computational Learning Theory, 1997."
18. Littlestone, N., and Warmuth, M. K. The weighted majority algorithm, in "Proceedings, 30th Annual Symposium on the Foundations of Computer Science, 1989," pp. 256-261.
19. Littlestone, N., and Warmuth, M. K. (1994), The weighted majority algorithm, Inform. and Comput. 108, 212-261.
20. Maass, W. On-line learning with an oblivious environment and the power of randomization, in "Proceedings, 1991 Workshop on Computational Learning Theory," pp. 167-175.
21. Maass, W., and Turán, G. On the complexity of learning from counterexamples, in "Proceedings 30th Annual Symposium on the Foundations of Computer Science, 1989," pp. 262-267.
22. Maass, W., and Turán, G. On the complexity of learning from counterexamples and membership queries, in "Proceedings, 31st Annual Symposium on the Foundations of Computer Science, 1990."
23. Natarajan, B. K. (1991), "Machine Learning: A Theoretical Approach," Kaufmann, San Mateo, CA.
24. Pitt, L., and Warmuth, M. K. (1990), Prediction preserving reducibility, J. Comput. System Sci. 41(3).
25. Valiant, L. G. (1984), A theory of the learnable, Comm. ACM 27(11), 1134-1142.
26. Vapnik, V. N., and Chervoneenkis, A. Y. (1971), On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16(2), 264-280.