Dear Colleagues,
this is to announce the publication of my new book:
Rollout, Policy Iteration, and Distributed Reinforcement Learning, by Dimitri Bertsekas
Amazon Link: https://www.amazon.com/dp/1886529078/ref=sr_1_7?dchild=1&keywords=bertsekas+distributed+reinforcement+learning&qid=1595118374&sr=8-7  
This is a research monograph at the forefront of research on reinforcement learning, and methods that take advantage of distributed computation and are suitable for multiagent systems.  It focuses on the fundamental idea of policy iteration, i.e., start
from some policy, and successively generate one or more improved policies. If just one improved policy is generated, this is called rollout, which, based on broad and consistent computational experience, appears to be one of the most versatile and
reliable of all reinforcement learning methods. Among others, it can be applied on-line using easily implementable simulation, and it can be used for discrete deterministic combinatorial optimization, as well as for stochastic Markov decision problems.
Moreover, rollout can make on-line use of the policy produced off-line by policy iteration or by any other method (including a policy gradient method), and improve on the performance of that policy,
Approximate policy iteration is a strictly off-line method, and it is generally far more computationally intensive than rollout. This motivates the use of parallel and distributed computation. One of the purposes of the monograph is to discuss
distributed (possibly asynchronous) methods that relate to rollout and policy iteration, both in the context of an exact and an approximate implementation involving neural networks or other approximation architectures.

Several of the ideas that we develop in some depth in this monograph have been central in the implementation of recent high profile successes, such as the AlphaZero program for playing chess, Go, and other games. In addition to the fundamental process of
successive policy iteration/improvement, this program includes the use of deep neural networks for representation of both value functions and policies, the extensive use of large scale parallelization, and the simplification of lookahead minimization,
through methods involving Monte Carlo tree search and pruning of the lookahead tree. In this monograph, we also focus on policy iteration, value and policy neural network representations, parallel and distributed computation, and lookahead simplification.
Thus while there are significant differences, the principal design ideas that form the core of this monograph are shared by the AlphaZero architecture, except that we develop these ideas in a broader and less application-specific framework.
Among its special features, the book:

a) Presents new research relating to distributed asynchronous computation, partitioned architectures, and multiagent systems, with application to challenging large scale optimization problems, such as combinatorial/discrete optimization, as well as
partially observed Markov decision problems.
b) Describes variants of rollout and policy iteration for problems with a multiagent structure, which allow a dramatic reduction of the computational requirements for lookahead minimization.
c) Establishes a connection of rollout with model predictive control, one of the most prominent control system design methodologies.
d) Expands the coverage of some research areas discussed in 2019 textbook Reinforcement Learning and Optimal Control by the same author.

For more information, preface, table of contents, and related research material:
http://web.mit.edu/dimitrib/www/dpchapter.html

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)