Markov decision processes in large state spaces

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Markov decision processes in large state spaces

Full text

Pdf (745 KB)

Source

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

Santa Cruz, California, United States

Pages: 281 - 288

Year of Publication: 1995

ISBN:0-89791-723-5

Authors

Lawrence K. Saul	Center for Biological and Computational Learning, Massachusetts Institute of Technology, 79 Amherst Street, E10-243, Cambridge, MA
Satinder P. Singh	Center for Biological and Computational Learning, Massachusetts Institute of Technology, 79 Amherst Street, E10-243, Cambridge, MA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
University of California : University of California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 25, 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/225298.225332 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.

	1	D. J. Amit. Modeling brain functwn. Cambridge University Press, Cambridge, 1989.
	2	Andrew G. Barto , Steven J. Bradtke , Satinder P. Singh, Learning to act using real-time dynamic programming, Artificial Intelligence, v.72 n.1-2, p.81-138, Jan. 1995 [doi>10.1016/0004-3702(94)00011-O]
	3	Dimitri P. Bertsekas, Dynamic programming: deterministic and stochastic models, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	4	Claude-Nicolas Fiechter, Efficient reinforcement learning, Proceedings of the seventh annual conference on Computational learning theory, p.88-97, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181019]
	5	David Haussler , H. Sebastian Seung , Michael Kearns , Naftali Tishby, Rigorous learning curve bounds from statistical mechanics, Proceedings of the seventh annual conference on Computational learning theory, p.76-87, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181018]
	6	R. Howard. Dynamic programming a~d Markov processes. MIT Press, Cambridge, MA, 1960.
	7	K. Huang. Statistical Mechanics. John Wiley & Sons, New York, NY, 1987.
	8	W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes. Cambridge University Press, Cambridge, 1986.
	9	H. S. Seung, H. Sompolinsky, and N. Tishby. Statistical mechanics of learning from examples. Physical Review A 45: 6056-6091, 1992.
	10	Richard S. Sutton, Learning to Predict by the Methods of Temporal Differences, Machine Learning, v.3 n.1, p.9-44, August 1988 [doi>10.1023/A:1022633531479]
	11	P. Tseng. Solving H-horizon, stationary Markov decision problems in time proportional to log(H), Operations Research Letters, 9:287-297, 1990.
	12	T. Watkin, A. Rau, and M. Biehl. The statistical mechanics of learning a rule. Reviews of Modern Physzcs 65:499-556, 1993.
	13	C. Watkins. Learning from delayed rewards. PhD thesis, Cambridge University, 1989.
	14	Christopher J. C. H. Watkins , Peter Dayan, Technical Note: $\cal Q$ -Learning, Machine Learning, v.8 n.3-4, p.279-292, May 1992 [doi>10.1007/BF00992698]