CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Investigating learning rates for evolution and temporal difference learning
Authors
Simon M Lucas
Publication date
1 December 2008
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
Abstract
Evidently, any learning algorithm can only learn on the basis of the information given to it. This paper presents a first attempt to place an upper bound on the information rates attainable with standard co-evolution and with TDL. The upper bound for TDL is shown to be much higher than for coevolution. Under commonly used settings for learning to play Othello for example, TDL may have an upper bound that is hundreds or even thousands of times higher than that of coevolution. To test how well these bounds correlate with actual learning rates, a simple two-player game called Treasure Hunt. is developed. While the upper bounds cannot be used to predict the number of games required to learn the optimal policy, they do correctly predict the rank order of the number of games required by each algorithm. © 2008 IEEE
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
University of Essex Research Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.essex.ac.uk:401...
Last time updated on 06/02/2021
University of Essex Research Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.essex.ac.uk:401...
Last time updated on 05/10/2012
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/06/2019