Reinforcement learning and mistake bounded algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Reinforcement learning and mistake bounded algorithms

Full text

Pdf (813 KB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the twelfth annual conference on Computational learning theory table of contents

Santa Cruz, California, United States

Pages: 183 - 192

Year of Publication: 1999

ISBN:1-58113-167-4

Author

Yishay Mansour

AT&T Labs and Tel-Aviv University

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Univ. of California, : University of California at Santa Cruz

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 11, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/307400.307437 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ACBFS95	P. Auer , N. Cesa-Bianchi , Y. Freund , R. E. Schapire, Gambling in a rigged casino: The adversarial multi-armed bandit problem, Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.322, October 23-25, 1995
	AS92	N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992.
	Bel57	Richard Ernest Bellman, Dynamic Programming, Dover Publications, Incorporated, 2003
	Ber87	Dimitri P. Bertsekas, Dynamic programming: deterministic and stochastic models, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	Ber95	Dimitri P. Bertsekas, Dynamic Programming and Optimal Control, Athena Scientific, 1995
	BT96	Dimitri P. Bertsekas , John N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, 1996
	CLR90	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	How60	R. Howard. Dynamic Programming and Markov Processes. MIT Press, 1960.
	KMN99	M. Kearns, Y. Mansour, and A. Ng. Approximate planning in large pomdps via reusable trajectories.
	KV94	Michael J. Kearns , Umesh V. Vazirani, An introduction to computational learning theory, MIT Press, Cambridge, MA, 1994
	Lit88	Nick Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Machine Learning, v.2 n.4, p.285-318, April 1988 [doi>10.1023/A:1022869011914]
	Lit96	Michael Lederman Littman, Algorithms for sequential decision-making, 1996
	PT87	Christos Papadimitriou , John N. Tsitsiklis, The complexity of Markov decision processes, Mathematics of Operations Research, v.12 n.3, p.441-450, August 1, 1987 [doi>10.1287/moor.12.3.441]
	SB98	Richard S. Sutton , Andrew G. Barto, Introduction to Reinforcement Learning, MIT Press, Cambridge, MA, 1998
	Tes94	Gerald Tesauro, TD-Gammon, a self-teaching backgammon program, achieves master-level play, Neural Computation, v.6 n.2, p.215-219, March 1994 [doi>10.1162/neco.1994.6.2.215]
	Vap82	Vladimir Vapnik, Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics), Springer-Verlag New York, Inc., Secaucus, NJ, 1982