Algorithms for reinforcement learning
Material type: TextPublication details: Williston Morgan & Claypool 2010Description: viii, 89pISBN:- 9781608454921 (pbk.)
- 006.31 SZE
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Book | Plaksha University Library | Computer science | 006.31 SZE (Browse shelf(Opens below)) | Available | 002861 | ||
Book | Plaksha University Library | Computer science | 006.31 SZE (Browse shelf(Opens below)) | Available | 002862 |
Browsing Plaksha University Library shelves, Collection: Computer science Close shelf browser (Hides shelf browser)
006.31 SUT Reinforcement learning : an introduction | 006.31 SUT Reinforcement learning : an introduction | 006.31 SZE Algorithms for reinforcement learning | 006.31 SZE Algorithms for reinforcement learning | 006.31 WIE Reinforcement learning : state-of-the-art | 006.31 WIE Reinforcement learning : state-of-the-art | 006.312 AGG Data mining : the textbook |
https://www.morganclaypoolpublishers.com/catalog_Orig/product_info.php?products_id=31
Reinforcement learning is a learning paradigm concerned with learning to control a system so as to maximize a numerical performance measure that expresses a long-term objective. What distinguishes reinforcement learning from supervised learning is that only partial feedback is given to the learner about the learner's predictions. Further, the predictions may have long term effects through influencing the future state of the controlled system. Thus, time plays a special role. The goal in reinforcement learning is to develop efficient learning algorithms, as well as to understand the algorithms' merits and limitations. Reinforcement learning is of great interest because of the large number of practical applications that it can be used to address, ranging from problems in artificial intelligence to operations research or control engineering. In this book, we focus on those algorithms of reinforcement learning that build on the powerful theory of dynamic programming. We give a fairly comprehensive catalog of learning problems, describe the core ideas, note a large number of state of the art algorithms, followed by the discussion of their theoretical properties and limitations.
There are no comments on this title.