Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Dynamic programming and optimal control

    Dynamic programming and optimal control

    Dimitri P. Bertsekas · 1995

    Programming
    Open LibraryAmazon
    Stats for nerds
    2recommend
    2mentions
    2people
    2011–2019years
    100% recommend

    Mentions per year

    201120122013201420152016201720182019

    What Hacker News says

    1. clickokFeb 2019
      Bertsekas' earlier books (Dynamic Programming and Optimal Control + Neurodynamic Programming w/ Tsitsiklis) are great references and collect many insights & results that you'd otherwise have to trawl the literature for. I'm very interested to see what a book focused more narrowly on RL will be like-- Sutton's Introduction to Reinforcement Learning[0] is fantastic, but if you're going to do research on RL, another text such as this one is necessary.

      0. http://www.incompleteideas.net/book/the-book-2nd.html

      thread
    2. verdatelAug 2011
      The theory of multi-armed bandits arises from the study of Markov decision processes (MDP). This field is also closely studied in and related to Stochastic Control and Dynamic Programming. A good book on MDP's is "Markov Decision Processes: Discrete Stochastic Dynamic Programming by Martin Puterman". It's fairly mathematical and is for grad-level learning. An alternative is another superb book "Dynamic Programming and Optimal Control" by Dimitri Bersekas.

      A more accessible book is "Approximate Dynamic Programming" by Warren Powell.

      I'm not sure if you know what a Markov chain is? Very roughly, any kind of data which changes its value (sometimes referred to as "state") and jumps to a new value is a Markov chain. The value that the chain jumps to is determined probabilistically using some distribution over all the states. When there are several Markov chains in parallel and each of them contribute to a certain reward and we are faced with the problem of which Markov chain to "control" or influence.. then it becomes a multi-armed bandit problem. They are not very easy to solve, except when certain simplifying assumptions are made. You can get a good start by looking at some MATLAB code from Prof. Kevin Murphy at UBC : http://www.cs.ubc.ca/~murphyk/Software/MDP/mdp.html

      thread

    Related

    Cover of Approximate dynamic programming
    2011–2015

    Approximate dynamic programming

    Warren B. Powell
    1 recommend · 2
    Cover of Markov Decision Processes
    2011–2025

    Markov Decision Processes

    Martin L. Puterman
    2 recommend · 3
    Cover of Reinforcement Learning
    2010–2026

    Reinforcement Learning

    Richard S. Sutton
    18 recommend · 34
    Cover of Nonlinear Programming
    2010–2024

    Nonlinear Programming

    Dimitri P. Bertsekas
    1 recommend · 5
    Reinforcement Learning and Optimal ControlDimitri Bertsekas
    2020–2022

    Reinforcement Learning and Optimal Control

    Dimitri Bertsekas
    1 recommend · 2
    Cover of Stochastic optimal control
    2011–2018

    Stochastic optimal control

    Dimitri P. Bertsekas
    0 recommend · 4
    Cover of Neuro-dynamic programming
    2010–2020

    Neuro-dynamic programming

    Dimitri P. Bertsekas
    3 recommend · 4
    Cover of The art and theory of dynamic programming
    2010–2025

    The art and theory of dynamic programming

    Stuart E. Dreyfus
    1 recommend · 10