Analysis of a simple learning algorithm: learning foraging thresholds for lizards
Pages 2 - 9
References
[1]
W. FELLER, An Introductwn to Probability Theory and its Applications, Volume 1, 3rd Edition, John Wiley and Sons, 1968.
[2]
J. KOZA, Genetic programming: On Programming Computers by Means of Natural Selection and Genetics, The MIT Press, Cambridge, MA, 1992, pp. 314-328.
[3]
J. M. MCNAMARA, An optimal sequential policy for controlling a Markov renewal process, J. Appl. Prob., 22, 324-335, 1985.
[4]
F. MENCZER, W. E. HART, AND M. L. LITTMAN, Appendix to S. Shafir and J. Roughgarden's 'The Effect of Memory on Individual Fitness in a Lizard', Adaptive Individuals in Evolving Populations: Models and Algorithms, Ed. 1%. K. Belew and M. Mitchell, Addison-Wesley, SFI Studies in the Sciences of Complexity Vol. 26, 1996, (in press).
[5]
D. REDFERN, The Maple Handbook, Springer-Verlag, New York, 1993.
[6]
J. ROUGHGARDEN, Anolis lizards of the Caribbean: Ecology, evolution and plate tectonics, Oxford Univ. Press, 1995.
[7]
J. ROUGHGARDEN, Personal communication, September, 1995.
[8]
S. SHAFIR and J. ROUGHCARDEN, The effect of memory length on individual fitness in a lizard, Adaptive Individuals in Evolving Populations: Models and Algorithms, Ed. R. K. Belew and M. Mitchell, Addison-Wesley, SFI Studies in the Sciences of Complexity Vol. 26, 1996, (in press).
Index Terms
- Analysis of a simple learning algorithm: learning foraging thresholds for lizards
Recommendations
Simple Reinforcement Learning for Small-Memory Agent
ICMLA '11: Proceedings of the 2011 10th International Conference on Machine Learning and Applications and Workshops - Volume 01In this paper, we propose Simple Reinforcement Learning for a reinforcement learning agent that has small memory. In the real world, learning is difficult because there are an infinite number of states and actions that need a large number of stored ...
Analysis and Design of an Improved R-learning
ICIS '09: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information ScienceThis paper presents a modified R-learning according to the traditional average reward reinforcement learning algorithm. Reinforcement learning problems constitute an important class of learning and control problems faced by artificial intelligence ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1996 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGAI: ACM Special Interest Group on Artificial Intelligence
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- Univ degli Studi de Milano: Universite degli Studi de Milano
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1996
Check for updates
Qualifiers
- Article
Conference
9COLT96: 9th Annual Conference on Computational Learning Theory
June 28 - July 1, 1996
Desenzano del Garda, Italy
Acceptance Rates
Overall Acceptance Rate 35 of 71 submissions, 49%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 212Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)5
Reflects downloads up to 14 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in