by C. Weber, M. Elshaw, N. M. Mayer
Publisher: InTech 2008
Number of pages: 424
The first 11 chapters of this book describe and extend the scope of reinforcement learning. The remaining 11 chapters show that there is already wide usage in numerous fields. Reinforcement learning can tackle control tasks that are too complex for traditional, hand-designed, non-learning controllers. As learning computers can deal with technical complexities, the tasks of human operators remain to specify goals on increasingly higher levels.
Home page url
Download or read it online for free here:
by A. Goldenberg, A.X. Zheng, S.E. Fienberg, E.M. Airoldi - arXiv
We begin with the historical development of statistical network modeling and then we introduce some examples in the network literature. Our subsequent discussion focuses on prominent static and dynamic network models and their interconnections.
by Jonas Buchli, et al. - arXiv.org
The starting point is the formulation of of an optimal control problem and deriving the different types of solutions and algorithms from there. These lecture notes aim at supporting this unified view with a unified notation wherever possible.
by Jan-Willem van de Meent, et al. - arXiv.org
This text is designed to be a graduate-level introduction to probabilistic programming. It provides a thorough background for anyone wishing to use a probabilistic programming system, and introduces the techniques needed to build these systems.
by Dimitri P. Bertsekas - Athena Scientific
The book considers large and challenging multistage decision problems, which can be solved by dynamic programming and optimal control, but their exact solution is computationally intractable. We discuss solution methods that rely on approximations.