Reinforcement Learning And Dynamic Programming Using Function Approximators

Download Reinforcement Learning And Dynamic Programming Using Function Approximators full books in PDF, epub, and Kindle. Read online Reinforcement Learning And Dynamic Programming Using Function Approximators ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!

Reinforcement Learning and Dynamic Programming Using Function Approximators

Author : Lucian Busoniu
Publisher : CRC Press
ISBN 13 : 1351833820
Total Pages : 335 pages
Book Rating : 4.3/5 (518 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning and Dynamic Programming Using Function Approximators by : Lucian Busoniu

Download or read book Reinforcement Learning and Dynamic Programming Using Function Approximators written by Lucian Busoniu and published by CRC Press. This book was released on 2017-07-28 with total page 335 pages. Available in PDF, EPUB and Kindle. Book excerpt: From household appliances to applications in robotics, engineered systems involving complex dynamics can only be as effective as the algorithms that control them. While Dynamic Programming (DP) has provided researchers with a way to optimally solve decision and control problems involving complex dynamic systems, its practical value was limited by algorithms that lacked the capacity to scale up to realistic problems. However, in recent years, dramatic developments in Reinforcement Learning (RL), the model-free counterpart of DP, changed our understanding of what is possible. Those developments led to the creation of reliable methods that can be applied even when a mathematical model of the system is unavailable, allowing researchers to solve challenging control problems in engineering, as well as in a variety of other disciplines, including economics, medicine, and artificial intelligence. Reinforcement Learning and Dynamic Programming Using Function Approximators provides a comprehensive and unparalleled exploration of the field of RL and DP. With a focus on continuous-variable problems, this seminal text details essential developments that have substantially altered the field over the past decade. In its pages, pioneering experts provide a concise introduction to classical RL and DP, followed by an extensive presentation of the state-of-the-art and novel methods in RL and DP with approximation. Combining algorithm development with theoretical guarantees, they elaborate on their work with illustrative examples and insightful comparisons. Three individual chapters are dedicated to representative algorithms from each of the major classes of techniques: value iteration, policy iteration, and policy search. The features and performance of these algorithms are highlighted in extensive experimental studies on a range of control applications. The recent development of applications involving complex systems has led to a surge of interest in RL and DP methods and the subsequent need for a quality resource on the subject. For graduate students and others new to the field, this book offers a thorough introduction to both the basics and emerging methods. And for those researchers and practitioners working in the fields of optimal and adaptive control, machine learning, artificial intelligence, and operations research, this resource offers a combination of practical algorithms, theoretical analysis, and comprehensive examples that they will be able to adapt and apply to their own work. Access the authors' website at www.dcsc.tudelft.nl/rlbook/ for additional material, including computer code used in the studies and information concerning new developments.

Reinforcement Learning and Dynamic Programming Using Function Approximators

Author :
Publisher :
ISBN 13 :
Total Pages : 270 pages
Book Rating : 4.:/5 (113 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning and Dynamic Programming Using Function Approximators by :

Download or read book Reinforcement Learning and Dynamic Programming Using Function Approximators written by and published by . This book was released on 2010 with total page 270 pages. Available in PDF, EPUB and Kindle. Book excerpt: Three individual chapters are dedicated to representative algorithms from each of the major classes of techniques: value iteration, policy iteration, and policy search. The features and performance of these algorithms are highlighted in extensive experimental studies on a range of control applications.

Reinforcement Learning and Dynamic Programming Using Function Approximators

Author : Lucian Busoniu
Publisher : Createspace Independent Publishing Platform
ISBN 13 : 9781548919337
Total Pages : 370 pages
Book Rating : 4.9/5 (193 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning and Dynamic Programming Using Function Approximators by : Lucian Busoniu

Download or read book Reinforcement Learning and Dynamic Programming Using Function Approximators written by Lucian Busoniu and published by Createspace Independent Publishing Platform. This book was released on 2017-07-17 with total page 370 pages. Available in PDF, EPUB and Kindle. Book excerpt: Reinforcement Learning and Dynamic Programming Using Function Approximators By Lucian Busoniu

A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning

Author : Alborz Geramifard
Publisher :
ISBN 13 : 9781601987617
Total Pages : 76 pages
Book Rating : 4.9/5 (876 download)

DOWNLOAD NOW!

Book Synopsis A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning by : Alborz Geramifard

Download or read book A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning written by Alborz Geramifard and published by . This book was released on 2013 with total page 76 pages. Available in PDF, EPUB and Kindle. Book excerpt: A Markov Decision Process (MDP) is a natural framework for formulating sequential decision-making problems under uncertainty. In recent years, researchers have greatly advanced algorithms for learning and acting in MDPs. This article reviews such algorithms, beginning with well-known dynamic programming methods for solving MDPs such as policy iteration and value iteration, then describes approximate dynamic programming methods such as trajectory based value iteration, and finally moves to reinforcement learning methods such as Q-Learning, SARSA, and least-squares policy iteration. We describe algorithms in a unified framework, giving pseudocode together with memory and iteration complexity analysis for each. Empirical evaluations of these techniques with four representations across four domains, provide insight into how these algorithms perform with various feature sets in terms of running time and performance.

A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning

Author : Alborz Geramifard
Publisher :
ISBN 13 : 9781601987600
Total Pages : 92 pages
Book Rating : 4.9/5 (876 download)

DOWNLOAD NOW!

Book Synopsis A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning by : Alborz Geramifard

Reinforcement Learning and Approximate Dynamic Programming for Feedback Control

Author : Frank L. Lewis
Publisher : John Wiley & Sons
ISBN 13 : 1118453972
Total Pages : 498 pages
Book Rating : 4.1/5 (184 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning and Approximate Dynamic Programming for Feedback Control by : Frank L. Lewis

Download or read book Reinforcement Learning and Approximate Dynamic Programming for Feedback Control written by Frank L. Lewis and published by John Wiley & Sons. This book was released on 2013-01-28 with total page 498 pages. Available in PDF, EPUB and Kindle. Book excerpt: Reinforcement learning (RL) and adaptive dynamic programming (ADP) has been one of the most critical research fields in science and engineering for modern complex systems. This book describes the latest RL and ADP techniques for decision and control in human engineered systems, covering both single player decision and control and multi-player games. Edited by the pioneers of RL and ADP research, the book brings together ideas and methods from many fields and provides an important and timely guidance on controlling a wide variety of systems, such as robots, industrial processes, and economic decision-making.

Handbook of Learning and Approximate Dynamic Programming

Author : Jennie Si
Publisher : John Wiley & Sons
ISBN 13 : 9780471660545
Total Pages : 670 pages
Book Rating : 4.6/5 (65 download)

DOWNLOAD NOW!

Book Synopsis Handbook of Learning and Approximate Dynamic Programming by : Jennie Si

Download or read book Handbook of Learning and Approximate Dynamic Programming written by Jennie Si and published by John Wiley & Sons. This book was released on 2004-08-02 with total page 670 pages. Available in PDF, EPUB and Kindle. Book excerpt: A complete resource to Approximate Dynamic Programming (ADP), including on-line simulation code Provides a tutorial that readers can use to start implementing the learning algorithms provided in the book Includes ideas, directions, and recent results on current research issues and addresses applications where ADP has been successfully implemented The contributors are leading researchers in the field

Algorithms for Reinforcement Learning

Author : Csaba Szepesvari
Publisher : Morgan & Claypool Publishers
ISBN 13 : 1608454932
Total Pages : 103 pages
Book Rating : 4.6/5 (84 download)

DOWNLOAD NOW!

Book Synopsis Algorithms for Reinforcement Learning by : Csaba Szepesvari

Download or read book Algorithms for Reinforcement Learning written by Csaba Szepesvari and published by Morgan & Claypool Publishers. This book was released on 2010-08-08 with total page 103 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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. Table of Contents: Markov Decision Processes / Value Prediction Problems / Control / For Further Exploration

Reinforcement Learning and Dynamic Programming Using Function Approximators

Author : Lucian Busoniu
Publisher : CRC Press
ISBN 13 : 1439821097
Total Pages : 280 pages
Book Rating : 4.4/5 (398 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning and Dynamic Programming Using Function Approximators by : Lucian Busoniu

Download or read book Reinforcement Learning and Dynamic Programming Using Function Approximators written by Lucian Busoniu and published by CRC Press. This book was released on 2017-07-28 with total page 280 pages. Available in PDF, EPUB and Kindle. Book excerpt: From household appliances to applications in robotics, engineered systems involving complex dynamics can only be as effective as the algorithms that control them. While Dynamic Programming (DP) has provided researchers with a way to optimally solve decision and control problems involving complex dynamic systems, its practical value was limited by algorithms that lacked the capacity to scale up to realistic problems. However, in recent years, dramatic developments in Reinforcement Learning (RL), the model-free counterpart of DP, changed our understanding of what is possible. Those developments led to the creation of reliable methods that can be applied even when a mathematical model of the system is unavailable, allowing researchers to solve challenging control problems in engineering, as well as in a variety of other disciplines, including economics, medicine, and artificial intelligence. Reinforcement Learning and Dynamic Programming Using Function Approximators provides a comprehensive and unparalleled exploration of the field of RL and DP. With a focus on continuous-variable problems, this seminal text details essential developments that have substantially altered the field over the past decade. In its pages, pioneering experts provide a concise introduction to classical RL and DP, followed by an extensive presentation of the state-of-the-art and novel methods in RL and DP with approximation. Combining algorithm development with theoretical guarantees, they elaborate on their work with illustrative examples and insightful comparisons. Three individual chapters are dedicated to representative algorithms from each of the major classes of techniques: value iteration, policy iteration, and policy search. The features and performance of these algorithms are highlighted in extensive experimental studies on a range of control applications. The recent development of applications involving complex systems has led to a surge of interest in RL and DP methods and the subsequent need for a quality resource on the subject. For graduate students and others new to the field, this book offers a thorough introduction to both the basics and emerging methods. And for those researchers and practitioners working in the fields of optimal and adaptive control, machine learning, artificial intelligence, and operations research, this resource offers a combination of practical algorithms, theoretical analysis, and comprehensive examples that they will be able to adapt and apply to their own work. Access the authors' website at www.dcsc.tudelft.nl/rlbook/ for additional material, including computer code used in the studies and information concerning new developments.

Reinforcement Learning for Optimal Feedback Control

Author : Rushikesh Kamalapurkar
Publisher : Springer
ISBN 13 : 331978384X
Total Pages : 305 pages
Book Rating : 4.3/5 (197 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning for Optimal Feedback Control by : Rushikesh Kamalapurkar

Download or read book Reinforcement Learning for Optimal Feedback Control written by Rushikesh Kamalapurkar and published by Springer. This book was released on 2018-05-10 with total page 305 pages. Available in PDF, EPUB and Kindle. Book excerpt: Reinforcement Learning for Optimal Feedback Control develops model-based and data-driven reinforcement learning methods for solving optimal control problems in nonlinear deterministic dynamical systems. In order to achieve learning under uncertainty, data-driven methods for identifying system models in real-time are also developed. The book illustrates the advantages gained from the use of a model and the use of previous experience in the form of recorded data through simulations and experiments. The book’s focus on deterministic systems allows for an in-depth Lyapunov-based analysis of the performance of the methods described during the learning phase and during execution. To yield an approximate optimal controller, the authors focus on theories and methods that fall under the umbrella of actor–critic methods for machine learning. They concentrate on establishing stability during the learning phase and the execution phase, and adaptive model-based and data-driven reinforcement learning, to assist readers in the learning process, which typically relies on instantaneous input-output measurements. This monograph provides academic researchers with backgrounds in diverse disciplines from aerospace engineering to computer science, who are interested in optimal reinforcement learning functional analysis and functional approximation theory, with a good introduction to the use of model-based methods. The thorough treatment of an advanced treatment to control will also interest practitioners working in the chemical-process and power-supply industry.

Recent Advances in Reinforcement Learning

Author : Leslie Pack Kaelbling
Publisher : Springer
ISBN 13 : 0585336563
Total Pages : 286 pages
Book Rating : 4.5/5 (853 download)

DOWNLOAD NOW!

Book Synopsis Recent Advances in Reinforcement Learning by : Leslie Pack Kaelbling

Download or read book Recent Advances in Reinforcement Learning written by Leslie Pack Kaelbling and published by Springer. This book was released on 2007-08-28 with total page 286 pages. Available in PDF, EPUB and Kindle. Book excerpt: Recent Advances in Reinforcement Learning addresses current research in an exciting area that is gaining a great deal of popularity in the Artificial Intelligence and Neural Network communities. Reinforcement learning has become a primary paradigm of machine learning. It applies to problems in which an agent (such as a robot, a process controller, or an information-retrieval engine) has to learn how to behave given only information about the success of its current actions. This book is a collection of important papers that address topics including the theoretical foundations of dynamic programming approaches, the role of prior knowledge, and methods for improving performance of reinforcement-learning techniques. These papers build on previous work and will form an important resource for students and researchers in the area. Recent Advances in Reinforcement Learning is an edited volume of peer-reviewed original research comprising twelve invited contributions by leading researchers. This research work has also been published as a special issue of Machine Learning (Volume 22, Numbers 1, 2 and 3).

Stable Function Approximation in Dynamic Programming

Author : Geoffrey Gordon
Publisher :
ISBN 13 :
Total Pages : 21 pages
Book Rating : 4.:/5 (319 download)

DOWNLOAD NOW!

Book Synopsis Stable Function Approximation in Dynamic Programming by : Geoffrey Gordon

Download or read book Stable Function Approximation in Dynamic Programming written by Geoffrey Gordon and published by . This book was released on 1995 with total page 21 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "The success of reinforcement learning in practical problems depends on the ability to combine function approximation with temporal difference methods such as value iteration. Experiments in this area have produced mixed results; there have been both notable successes and notable disappointments. Theory has been scarce, mostly due to the difficulty of reasoning about function approximators that generalize beyond the observed data. We provide a proof of convergence for a wide class of temporal difference methods involving function approximators such as k- nearest-neighbor, and show experimentally that these methods can be useful. The proof is based on a view of function approximators as expansion or contraction mappings. In addition, we present a novel view of approximate value iteration: an approximate algorithm for one environment turns out to be an exact algorithm for a different environment."

Approximate Dynamic Programming

Author : Warren B. Powell
Publisher : John Wiley & Sons
ISBN 13 : 0470182954
Total Pages : 487 pages
Book Rating : 4.4/5 (71 download)

DOWNLOAD NOW!

Book Synopsis Approximate Dynamic Programming by : Warren B. Powell

Download or read book Approximate Dynamic Programming written by Warren B. Powell and published by John Wiley & Sons. This book was released on 2007-10-05 with total page 487 pages. Available in PDF, EPUB and Kindle. Book excerpt: A complete and accessible introduction to the real-world applications of approximate dynamic programming With the growing levels of sophistication in modern-day operations, it is vital for practitioners to understand how to approach, model, and solve complex industrial problems. Approximate Dynamic Programming is a result of the author's decades of experience working in large industrial settings to develop practical and high-quality solutions to problems that involve making decisions in the presence of uncertainty. This groundbreaking book uniquely integrates four distinct disciplines—Markov design processes, mathematical programming, simulation, and statistics—to demonstrate how to successfully model and solve a wide range of real-life problems using the techniques of approximate dynamic programming (ADP). The reader is introduced to the three curses of dimensionality that impact complex problems and is also shown how the post-decision state variable allows for the use of classical algorithmic strategies from operations research to treat complex stochastic optimization problems. Designed as an introduction and assuming no prior training in dynamic programming of any form, Approximate Dynamic Programming contains dozens of algorithms that are intended to serve as a starting point in the design of practical solutions for real problems. The book provides detailed coverage of implementation challenges including: modeling complex sequential decision processes under uncertainty, identifying robust policies, designing and estimating value function approximations, choosing effective stepsize rules, and resolving convergence issues. With a focus on modeling and algorithms in conjunction with the language of mainstream operations research, artificial intelligence, and control theory, Approximate Dynamic Programming: Models complex, high-dimensional problems in a natural and practical way, which draws on years of industrial projects Introduces and emphasizes the power of estimating a value function around the post-decision state, allowing solution algorithms to be broken down into three fundamental steps: classical simulation, classical optimization, and classical statistics Presents a thorough discussion of recursive estimation, including fundamental theory and a number of issues that arise in the development of practical algorithms Offers a variety of methods for approximating dynamic programs that have appeared in previous literature, but that have never been presented in the coherent format of a book Motivated by examples from modern-day operations research, Approximate Dynamic Programming is an accessible introduction to dynamic modeling and is also a valuable guide for the development of high-quality solutions to problems that exist in operations research and engineering. The clear and precise presentation of the material makes this an appropriate text for advanced undergraduate and beginning graduate courses, while also serving as a reference for researchers and practitioners. A companion Web site is available for readers, which includes additional exercises, solutions to exercises, and data sets to reinforce the book's main concepts.

Reinforcement Learning, second edition

Author : Richard S. Sutton
Publisher : MIT Press
ISBN 13 : 0262352702
Total Pages : 549 pages
Book Rating : 4.2/5 (623 download)

DOWNLOAD NOW!

Book Synopsis Reinforcement Learning, second edition by : Richard S. Sutton

Download or read book Reinforcement Learning, second edition written by Richard S. Sutton and published by MIT Press. This book was released on 2018-11-13 with total page 549 pages. Available in PDF, EPUB and Kindle. Book excerpt: The significantly expanded and updated new edition of a widely used text on reinforcement learning, one of the most active research areas in artificial intelligence. Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives while interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the field's key ideas and algorithms. This second edition has been significantly expanded and updated, presenting new topics and updating coverage of other topics. Like the first edition, this second edition focuses on core online learning algorithms, with the more mathematical material set off in shaded boxes. Part I covers as much of reinforcement learning as possible without going beyond the tabular case for which exact solutions can be found. Many algorithms presented in this part are new to the second edition, including UCB, Expected Sarsa, and Double Learning. Part II extends these ideas to function approximation, with new sections on such topics as artificial neural networks and the Fourier basis, and offers expanded treatment of off-policy learning and policy-gradient methods. Part III has new chapters on reinforcement learning's relationships to psychology and neuroscience, as well as an updated case-studies chapter including AlphaGo and AlphaGo Zero, Atari game playing, and IBM Watson's wagering strategy. The final chapter discusses the future societal impacts of reinforcement learning.

Stable Function Approximation in Dynamic Programming

Author : Geoffrey Gordon
Publisher :
ISBN 13 :
Total Pages : 0 pages
Book Rating : 4.:/5 (319 download)

DOWNLOAD NOW!

Book Synopsis Stable Function Approximation in Dynamic Programming by : Geoffrey Gordon

Download or read book Stable Function Approximation in Dynamic Programming written by Geoffrey Gordon and published by . This book was released on 1995 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "The success of reinforcement learning in practical problems depends on the ability to combine function approximation with temporal difference methods such as value iteration. Experiments in this area have produced mixed results; there have been both notable successes and notable disappointments. Theory has been scarce, mostly due to the difficulty of reasoning about function approximators that generalize beyond the observed data. We provide a proof of convergence for a wide class of temporal difference methods involving function approximators such as k- nearest-neighbor, and show experimentally that these methods can be useful. The proof is based on a view of function approximators as expansion or contraction mappings. In addition, we present a novel view of approximate value iteration: an approximate algorithm for one environment turns out to be an exact algorithm for a different environment."

Rollout, Policy Iteration, and Distributed Reinforcement Learning

Author : Dimitri Bertsekas
Publisher : Athena Scientific
ISBN 13 : 1886529078
Total Pages : 498 pages
Book Rating : 4.8/5 (865 download)

DOWNLOAD NOW!

Book Synopsis Rollout, Policy Iteration, and Distributed Reinforcement Learning by : Dimitri Bertsekas

Download or read book Rollout, Policy Iteration, and Distributed Reinforcement Learning written by Dimitri Bertsekas and published by Athena Scientific. This book was released on 2021-08-20 with total page 498 pages. Available in PDF, EPUB and Kindle. Book excerpt: The purpose of this book is to develop in greater depth some of the methods from the author's Reinforcement Learning and Optimal Control recently published textbook (Athena Scientific, 2019). In particular, we present new research, relating to systems involving multiple agents, partitioned architectures, and distributed asynchronous computation. We pay special attention to the contexts of dynamic programming/policy iteration and control theory/model predictive control. We also discuss in some detail the application of the methodology to challenging discrete/combinatorial optimization problems, such as routing, scheduling, assignment, and mixed integer programming, including the use of neural network approximations within these contexts. The book 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. In this book, rollout algorithms are developed for both discrete deterministic and stochastic DP problems, and the development of distributed implementations in both multiagent and multiprocessor settings, aiming to take advantage of parallelism. Approximate policy iteration is more ambitious than rollout, but it is a strictly off-line method, and it is generally far more computationally intensive. 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. Much of the new research is inspired by the remarkable AlphaZero chess program, where policy iteration, value and policy networks, approximate lookahead minimization, and parallel computation all play an important role.

Distributional Reinforcement Learning

Author : Marc G. Bellemare
Publisher : MIT Press
ISBN 13 : 0262374013
Total Pages : 385 pages
Book Rating : 4.2/5 (623 download)

DOWNLOAD NOW!

Book Synopsis Distributional Reinforcement Learning by : Marc G. Bellemare

Download or read book Distributional Reinforcement Learning written by Marc G. Bellemare and published by MIT Press. This book was released on 2023-05-30 with total page 385 pages. Available in PDF, EPUB and Kindle. Book excerpt: The first comprehensive guide to distributional reinforcement learning, providing a new mathematical formalism for thinking about decisions from a probabilistic perspective. Distributional reinforcement learning is a new mathematical formalism for thinking about decisions. Going beyond the common approach to reinforcement learning and expected values, it focuses on the total reward or return obtained as a consequence of an agent's choices—specifically, how this return behaves from a probabilistic perspective. In this first comprehensive guide to distributional reinforcement learning, Marc G. Bellemare, Will Dabney, and Mark Rowland, who spearheaded development of the field, present its key concepts and review some of its many applications. They demonstrate its power to account for many complex, interesting phenomena that arise from interactions with one's environment. The authors present core ideas from classical reinforcement learning to contextualize distributional topics and include mathematical proofs pertaining to major results discussed in the text. They guide the reader through a series of algorithmic and mathematical developments that, in turn, characterize, compute, estimate, and make decisions on the basis of the random return. Practitioners in disciplines as diverse as finance (risk management), computational neuroscience, computational psychiatry, psychology, macroeconomics, and robotics are already using distributional reinforcement learning, paving the way for its expanding applications in mathematical finance, engineering, and the life sciences. More than a mathematical approach, distributional reinforcement learning represents a new perspective on how intelligent agents make predictions and decisions.