Categories

Algorithms for Reinforcement Learning

  • Machine Learning
  • Categories:Computers & Internet
  • Language:English(Translation Services Available)
  • Publication date:January,2010
  • Pages:103
  • Retail Price:(Unknown)
  • Size:190mm×234mm
  • Page Views:273
  • Words:(Unknown)
  • Star Ratings:
  • Text Color:Black and white
You haven’t logged in yet. Sign In to continue.

Request for Review Sample

Through our website, you are submitting the application for you to evaluate the book. If it is approved, you may read the electronic edition of this book online.

Copyright Usage
Application
 

Special Note:
The submission of this request means you agree to inquire the books through RIGHTOL, and undertakes, within 18 months, not to inquire the books through any other third party, including but not limited to authors, publishers and other rights agencies. Otherwise we have right to terminate your use of Rights Online and our cooperation, as well as require a penalty of no less than 1000 US Dollars.


Description

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.

Author

Csaba Szepesvari, University of Alberta
Csaba Szepesvari received his PhD in 1999 from "Jozsef Attila" University, Szeged, Hungary. He is currently an Associate Professor at the Department of Computing Science of the University of Alberta and a principal investigator of the Alberta Ingenuity Center for Machine Learning. Previously, he held a senior researcher position at the Computer and Automation Research Institute of the Hungarian Academy of Sciences, where he headed the Machine Learning Group. Before that, he spent 5 years in the software industry. In 1998, he became the Research Director of Mindmaker, Ltd., working on natural language processing and speech products, while from 2000, he became the Vice President of Research at the Silicon Valley company Mindmaker Inc. He is the coauthor of a book on nonlinear approximate adaptive controllers, published over 80 journal and conference papers and serves as the Associate Editor of IEEE Transactions on Adaptive Control and AI Communications, is on the board of editors of the Journal of Machine Learning Research and the Machine Learning Journal, and is a regular member of the program committee at various machine learning and AI conferences. His areas of expertise include statistical learning theory, reinforcement learning and nonlinear adaptive control.

Contents

Table of Contents
Markov Decision Processes
Value Prediction Problems
Control
For Further Exploration

Share via valid email address:


Back
© 2024 RIGHTOL All Rights Reserved.