Fundamentals of pattern recognition (2nd revised and expanded ed.)
Fundamentals of pattern recognition (2nd revised and expanded ed.)
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Simulation and the Monte Carlo Method
Simulation and the Monte Carlo Method
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough-Neuro-Computing: Techniques for Computing with Words
Rough-Neuro-Computing: Techniques for Computing with Words
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Reinforcement Learning with Approximation Spaces
Fundamenta Informaticae
Calculi of Approximation Spaces
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Near Sets. Special Theory about Nearness of Objects
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Approximation spaces in off-policy Monte Carlo learning
Engineering Applications of Artificial Intelligence
Incremental least-squares temporal difference learning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Near sets: toward approximation space-based object recognition
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Approximation spaces and information granulation
Transactions on Rough Sets III
IEEE Transactions on Fuzzy Systems
Nearness of Objects: Extension of Approximation Space Model
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |
The problem considered in this paper is how the classification of observed behaviour of organisms can be used to influence adaptive learning, beneficially. The solution to this problem hearkens back to the pioneering work during the 1980s by Zdzisław Pawlak and others on classification of objects and approximation spaces, where elementary sets of equivalent objects a framework for perceptions concerning observed behaviours. The seminal work by Oliver Selfridge and Chris J.C.H. Watkins on delay rewards and adaptive learning, also during the 1980s, combined with more recent work on reinforcement learning provide a basis for the forms of adaptive learning introduced in this article. In addition, recent work on approximation spaces has led to what is known as approximate adaptive learning. This article presents two forms of run-and-twiddle (RT) adaptive learning, each using the Watkins' stopping time strategy to mark the end of an episode. Twiddling amounts to adjusting what one does to achieve a better result. This becomes more apparent in approximate RT adaptive learning introduced in this article, where a record of observed behaviour patterns during each episode recorded in an ethogram makes it possible to define a pattern-based learning rate in the context of approximation spaces. Both forms of adaptive learning are actor-critic methods. The contribution of this article is the introduction of two forms of adaptive learning with Watkins' stopping time strategy with differential discount on returns in both cases and differential learning rate for adaptive learning in the context of approximation spaces.