Keras Reinforcement Learning Projects
by Giuseppe Ciaburro, Sudharsan Ravichandiran, Suriyadeepan Ramamoorthy
Optimal Portfolio Selection
The selection of an optimal portfolio is a typical decision problem, and as such, its solution consists of the following elements: the identification of a set of alternatives, using selection criteria to sort through the different possibilities, and finally the solution of the problem. Dynamic Programming (DP) represents a set of algorithms that can be used to calculate an optimal policy given a perfect model of the environment in the form of a MarkovDecision Process (MDP). The DP methods update the estimates of the values of the states—based on the estimates of the values of the successor states—or update the estimates on the basis of past estimates. In DP, an optimization problem is decomposed into simpler subproblems, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access