Reinforcement learning with immediate rewards and linear hypotheses

Algorithmica (New York)

Volumn 37, Issue 4, 2003, Pages 263-293

  Abe, Naoki ^a   Biermann, Alan W ^b   Long, Philip M ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Duke University   (United States)

^c GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

Computational learning theory; Decision theory; Dialogue systems; Immediate rewards; Online algorithms; Online learning; Reinforcement learning

Indexed keywords

BOUNDARY CONDITIONS; CLIENT SERVER COMPUTER SYSTEMS; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; ELECTRONIC COMMERCE; FUNCTIONS; INTERNET; LEARNING SYSTEMS; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

COMPUTATIONAL LEARNING THEORY; CONTINUOUS VALUED REWARDS; DIALOGUE SYSTEMS; IMMEDIATE REWARDS; ONLINE ALGORITHMS; ONLINE LEARNING; REINFORCEMENT LEARNING;

LEARNING ALGORITHMS;

EID: 0344118814     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1038-1     Document Type: Article

References (31)

1. N. Abe and P. M. Long. Associative reinforcement learning using linear probabilistic concepts. Proceedings of the 16th International Conference on Machine Learning, pages 3-11, 1999.
2. N. Abe and A. Nakamura. Learning to optimally schedule internet banner advertisements. Proceedings of the 16th International Conference on Machine Learning, 1999.
3. C. Allenberg. Individual sequence prediction - upper bounds and an application for complexity. Proceedings of the 1999 Conference on Computational Learning Theory, pages 233-242, 1999.
4. P. Auer. An improved algorithm for learning linear evaluation functions. Proceedings of the 2000 Conference on Computational Learning Theory, 2000.
5. P. Auer. Using upper confidence bounds for online learning. Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, 2000.
6. P. Auer. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 3:397-422, 2002.
7. P. Auer. A preliminary version has appeared in Proceedings of the 41st Annual Symposium on Foundations of Computer Science.
8. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. Proceedings of the 36th Annual Symposium on the Foundations of Computer Science, 1995.
9. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. Technical Report NC-TR-98-025, Neurocolt, 1998.
10. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
11. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. A preliminary version has appeared in Proceedings of the 36th Annual Symposium on Foundations of Computer Science.
12. A. G. Barto and P. Anandan. Pattern recognizing stochastic learning automata. IEEE Transactions on Systems, Man and Cybernetics, 15:360-374, 1985.
13. A. G. Barto, R. S. Sutton, and P. S. Brouwer. Associative search network: a reinforcement learning associative memory. Biological Cybernetics, 40:201-211, 1981.
14. D.A. Berry and B. Fristedt. Bandit Problems. Chapman and Hall, New York, 1985.
15. A. W. Biermann, C. I. Guinn, M. Fulkerson, G. Keim, Z. Liang, D. Melamed, and K. Rajagopalan. Goal-oriented multimedia dialogue with variable initiative. In Foundations of Intelligent Systems, Z. W. Ras and A. Skowron (eds.), 1997.
16. A. W. Biermann and P. M. Long. The composition of messages in speech-graphics interactive systems. Proceedings of the 1996 International Symposium on Spoken Dialogue, 1996.
17. N. Cesa-Bianchi, P. M. Long, and M. K. Warmuth. Worst-case quadratic loss bounds for prediction using linear functions and gradient descent. IEEE Transactions on Neural Networks, 7(3):604-619, 1996.
18. N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth. How to use expert advice. Journal of the Association for Computing Machinery, 44(3):427-485, May 1997.
19. C.-N. Fiechter. Design and Analysis of Efficient Reinforcement Learning Algorithms. Ph.D. thesis, University of Pittsburgh, 1997.
20. D. Haussler, M. Kearns, H. S. Seung, and N. Tishby. Rigorous learning curve bounds from statistical mechanics. Machine Learning, 25:195-236, 1996.
21. D.P.Helmbold, N.Littlestone, and P.M.Long. Apple tasting. Information and Computation, 161(2):85-139, 2000. Preliminary version in FOCS'92.
22. L. P. Kaelbling. Associative reinforcement learning: a generate and test algorithm. Machine Learning, 15(3):299-320, 1994.
23. L. P. Kaelbling. Associative reinforcement learning: functions in k-dnf. Machine Learning, 15(3):279-298, 1994.
24. M. Kearns, M. Li, L. Pitt, and L. G. Valiant. On the learnability of Boolean formulae. Proceedings of the 19th Annual Symposium on the Theory of Computation, pages 285-295, 1987.
25. M. J. Kearns, R. E. Schapire, and L. M. Sellie. Toward efficient agnostic learning. Machine Learning, 17:115-141, 1994.
26. N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
27. P.M. Long. On-line evaluation and prediction using linear functions. Proceedings of the 1997 Conference on Computational Learning Theory, 1997
28. K. S. Narendra and M. A. L. Thathachar. Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs, NJ, 1989.
29. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.
30. B. Widrow and M. E. Hoff. Adaptive switching circuits. 1960 IRE WESCON Conv. Record, pages 96-104, 1960.
31. R. J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8:229-256, 1992.