Answers.Body: <p><strong>Background</strong></p>
  <p>The Markov Decision Process is an extension of Andrey Markov's action sequence that visualize action-result sequence possibilities as a directed acyclic graph.  One path through the acyclic graph, if it satisfies the Markov Property is called a Markov Chain.</p>
  <p>The Markov Property requires that the probability distribution of future states at any point within the acyclic graph be evaluated solely on the basis of the present state.</p>
  <p>Markov Chains are thus a stochastic model theoretically representing one of the set of possible paths.  And the action-result sequence is a list of state transitions corresponding to actions chosen solely by each action's previous state and the expectations that the expected subsequent state will most probably lead to the desired outcome.</p>
  <p>Andrey Markov based his work on Gustav Kirchhoff's work on spanning trees, which is based on Euler's initial directed graph work.</p>
  <p><strong>The Exercise</strong></p>
  <p>Exercise 3.2 was given with two parts.</p>
  <blockquote>
  <p>Is the MDP framework adequate to usefully represent all goal-directed learning tasks?</p>
  <p>Can you think of any clear exceptions?</p>
  </blockquote>
  <p>The first question is subjective in that it inquires about usefulness but does not define what it means.  If &quot;useful&quot; means the MDP will improve the chances of achieving a goal over a random selection of action at each state, then except in no win scenarios or the most contrived case where all actions have equal distribution of probable results, then the MDP is useful.</p>
  <p>If &quot;useful&quot; means optimal, then there are other approaches, with additional complexity and requiring additional computing resources that will improve odds of goal achievement.  These other approaches overcome one or more of the limitations of pure MDP.</p>
  <p><strong>Advancements and Alternatives</strong></p>
  <p>Advancements made to MDP and alternatives to MDP, which number in the hundreds, include these.</p>
  <ul>
  <li>Logical detection of the infeasibility of goal achievement (no win scenario)</li>
  <li>Calculation of probabilities when only partial information is available about the current state</li>
  <li>Invocation of the decision at any point (continuous MDP used in real time systems)</li>
  <li>Probabilities are not known and must be learned from past experience where simple Q-learning is employed</li>
  <li>Past experience is used by statistically relating action-state details to generalizations derived from past action-result sequences or such information acquired or shared</li>
  <li>The action-state decisions, made within the context of an unknown system of changing or not reliably applied rules, can be used to tune a set of fuzzy rules in a fuzzy logic container and utilize fuzzy inference in the decisions</li>
  <li>Bluff and fraud detection</li>
  </ul>
  <p><strong>Card Games</strong></p>
  <p>Game play for a typical card game could make use of MDP, so MDP would be strictly useful, however not optimal.  Some of the above decisioning features would be more optimal, particularly those that deals with unknowns and employ rules, since the card game has them.</p>
  <p><strong>Random or Decoupled</strong></p>
  <p>Two obvious cases are (a) a truly randomized action-result world where goal achievement has equal probability no matter the sequence of moves or (b) a scenario where goal achievement is entirely decoupled from actions the actor can take.  In those cases, nothing will be useful with regard to the particular objective chosen.</p>
  <p><strong>Challenge</strong></p>
  <p>The way to best learn from the exercise, though, is to find a scenario where MDP would be useless and one of the above listed <strong>Advancements and Alternatives</strong> would be required rather than simply preferred.  If you look at the list, there will be some cases that will eventually come to mind.  I suggest you think it through, since the goal is to learn from the book.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2018-10-19T19:06:36.580Z
Answers.LastActivityDate: 2018-10-19T19:06:36.580Z
Answers.LastEditDate: 2020-06-17T09:57:20.710Z
Answers.UserDisplayName: Douglas Daseeco
Answers.Body: <p>According to <a href="http://tianlinliu.com/files/notes_exercise_RL.pdf" rel="nofollow noreferrer">http://tianlinliu.com/files/notes_exercise_RL.pdf</a>, MDP may not be feasible to multi-target tasks.</p>
  <p>In contrast, EA-based methods like NSGA-II, NSGA-III, can solve the multi-target tasks.</p>
  <p>And also, tasks that need more than one state to predict the next action are also not suitable to use MDP. For example, when we predict the next action a stranger who just meets you at a party will do, we need to consider all the behaviors he did in the past minutes. It will be more suitable than using the MDP way, which will simply label the stranger is a &quot;good&quot; guy or &quot;bad&quot; guy (or a continuous number between good or bad).</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-08-08T06:01:09.053Z
Answers.LastActivityDate: 2020-08-08T06:17:23.123Z
Answers.LastEditDate: 2020-08-08T06:17:23.123Z
Answers.UserDisplayName: Neo li
Body: <p>In the book <em>Reinforcement Learning: An Introduction</em> (Sutton and Barto, 2018). The authors ask</p>
  
  <blockquote>
    <p><em>Exercise 3.2:</em>  Is the MDP framework adequate to usefully represent all goal-directed learning tasks? Can you think of any clear
    exceptions?</p>
  </blockquote>
  
  <p>I thought maybe a card game would be an example if the state does not contain any pieces of information on previously played cards. But that would mean that the chosen state leads to a system that is not fully observable. Hence, if I track all cards and append it to the state (state vector with changing dimension) the problem should have the Markov Property (no information on the past states is needed). This would not be possible if the state is postulated as invariant in MDP.</p>
  
  <p>If the previous procedure is allowed, then it seems to me that there are no examples where the MDP is not appropriate.</p>
  
  <p>I would be glad if someone could say if my reasoning is right or wrong. What would be an appropriate answer to this question?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2018-10-18T15:03:49.203Z
Comments.Text: There are collection of code exercises e.g. at https://github.com/ShangtongZhang/reinforcement-learning-an-introduction (not sure how official that is), but as far as I know, not published answers for the maths & text-based questions. I am not sure, but one likely scenario is that he does not want collections of answers easily available online, because it encourages students to think less and take the easy route. If you complete a whole chapter and send your answers, this is not trivial, and supports the way the author has requested here: http://incompleteideas.net/book/solutions-2nd.html
Comments.UserDisplayName: Neil Slater
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2018-10-18T16:18:33.543Z
Comments.Text: I have found something (http://fumblog.um.ac.ir/gallery/839/weatherwax_sutton_solutions_manual.pdf), but the answer does not convince me.
Comments.UserDisplayName: MrYouMath
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2018-10-18T16:25:37.263Z
Comments.Text: His answer is technically correct but not very interesting (since a vector is inherently not optimisable without a metric - and the metric would be your reward), and there are other areas worth discussing, such as your thoughts around partial information.
Comments.UserDisplayName: Neil Slater
Tags: <reinforcement-learning><applications><markov-decision-process>
Title: When is the Markov decision process not adequate for goal-directed learning tasks?
UserDisplayName: MrYouMath
ThreadText: # When is the Markov decision process not adequate for goal-directed learning tasks?
  
  (Asked by: username_0 on 2018-10-18)
  
  In the book *Reinforcement Learning: An Introduction* (Sutton and Barto, 2018). The authors ask
  
  > *Exercise 3.2:* Is the MDP framework adequate to usefully represent all goal-directed learning tasks? Can you think of any clear
  > exceptions?
  
  I thought maybe a card game would be an example if the state does not contain any pieces of information on previously played cards. But that would mean that the chosen state leads to a system that is not fully observable. Hence, if I track all cards and append it to the state (state vector with changing dimension) the problem should have the Markov Property (no information on the past states is needed). This would not be possible if the state is postulated as invariant in MDP.
  
  If the previous procedure is allowed, then it seems to me that there are no examples where the MDP is not appropriate.
  
  I would be glad if someone could say if my reasoning is right or wrong. What would be an appropriate answer to this question?
  
  **Tags:** reinforcement-learning, applications, markov-decision-process
  > **Comments:**
  > **username_1**: There are collection of code exercises e.g. at https://github.com/ShangtongZhang/reinforcement-learning-an-introduction (not sure how official that is), but as far as I know, not published answers for the maths & text-based questions. I am not sure, but one likely scenario is that he does not want collections of answers easily available online, because it encourages students to think less and take the easy route. If you complete a whole chapter and send your answers, this is not trivial, and supports the way the author has requested here: http://incompleteideas.net/book/solutions-2nd.html  
  > **username_0**: I have found something (http://fumblog.um.ac.ir/gallery/839/weatherwax_sutton_solutions_manual.pdf), but the answer does not convince me.  
  > **username_1**: His answer is technically correct but not very interesting (since a vector is inherently not optimisable without a metric - and the metric would be your reward), and there are other areas worth discussing, such as your thoughts around partial information.  
  
  ---
  
  ## 2 answers
  
  ### Answer by username_2 on 2018-10-19. Score: 2 | Accepted answer
  
  **Background**
  
  The Markov Decision Process is an extension of Andrey Markov's action sequence that visualize action-result sequence possibilities as a directed acyclic graph. One path through the acyclic graph, if it satisfies the Markov Property is called a Markov Chain.
  
  The Markov Property requires that the probability distribution of future states at any point within the acyclic graph be evaluated solely on the basis of the present state.
  
  Markov Chains are thus a stochastic model theoretically representing one of the set of possible paths. And the action-result sequence is a list of state transitions corresponding to actions chosen solely by each action's previous state and the expectations that the expected subsequent state will most probably lead to the desired outcome.
  
  Andrey Markov based his work on Gustav Kirchhoff's work on spanning trees, which is based on Euler's initial directed graph work.
  
  **The Exercise**
  
  Exercise 3.2 was given with two parts.
  
  > Is the MDP framework adequate to usefully represent all goal-directed learning tasks?
  >
  > Can you think of any clear exceptions?
  
  The first question is subjective in that it inquires about usefulness but does not define what it means. If "useful" means the MDP will improve the chances of achieving a goal over a random selection of action at each state, then except in no win scenarios or the most contrived case where all actions have equal distribution of probable results, then the MDP is useful.
  
  If "useful" means optimal, then there are other approaches, with additional complexity and requiring additional computing resources that will improve odds of goal achievement. These other approaches overcome one or more of the limitations of pure MDP.
  
  **Advancements and Alternatives**
  
  Advancements made to MDP and alternatives to MDP, which number in the hundreds, include these.
  
  * Logical detection of the infeasibility of goal achievement (no win scenario)
  * Calculation of probabilities when only partial information is available about the current state
  * Invocation of the decision at any point (continuous MDP used in real time systems)
  * Probabilities are not known and must be learned from past experience where simple Q-learning is employed
  * Past experience is used by statistically relating action-state details to generalizations derived from past action-result sequences or such information acquired or shared
  * The action-state decisions, made within the context of an unknown system of changing or not reliably applied rules, can be used to tune a set of fuzzy rules in a fuzzy logic container and utilize fuzzy inference in the decisions
  * Bluff and fraud detection
  
  **Card Games**
  
  Game play for a typical card game could make use of MDP, so MDP would be strictly useful, however not optimal. Some of the above decisioning features would be more optimal, particularly those that deals with unknowns and employ rules, since the card game has them.
  
  **Random or Decoupled**
  
  Two obvious cases are (a) a truly randomized action-result world where goal achievement has equal probability no matter the sequence of moves or (b) a scenario where goal achievement is entirely decoupled from actions the actor can take. In those cases, nothing will be useful with regard to the particular objective chosen.
  
  **Challenge**
  
  The way to best learn from the exercise, though, is to find a scenario where MDP would be useless and one of the above listed **Advancements and Alternatives** would be required rather than simply preferred. If you look at the list, there will be some cases that will eventually come to mind. I suggest you think it through, since the goal is to learn from the book.
  
  
  ---
  
  ### Answer by username_3 on 2020-08-08. Score: 0
  
  According to <http://tianlinliu.com/files/notes_exercise_RL.pdf>, MDP may not be feasible to multi-target tasks.
  
  In contrast, EA-based methods like NSGA-II, NSGA-III, can solve the multi-target tasks.
  
  And also, tasks that need more than one state to predict the next action are also not suitable to use MDP. For example, when we predict the next action a stranger who just meets you at a party will do, we need to consider all the behaviors he did in the past minutes. It will be more suitable than using the MDP way, which will simply label the stranger is a "good" guy or "bad" guy (or a continuous number between good or bad).
  
  
  ---
  
  