Skip to content

Commit

Permalink
Add markov chain example.
Browse files Browse the repository at this point in the history
  • Loading branch information
ahoereth committed Jul 5, 2016
1 parent 8866354 commit 4ee916a
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions sheet11/sheet11solutions.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -392,9 +392,9 @@
"Which of the following formulae describes the backpropagation of the error through hidden layers in a Multilayer Perceptron?\n",
"Assume they are calculated for each $k=L_H \\dots 1$ and $i=1\\dots N(k)$.\n",
"\n",
"1. $\\delta_i(k) = f^\\prime(o_i(k-1)) \\sum\\limits_{j=1}^{N(k+1)} w_{ji}(k+1, k)o_i(k)$\n",
"2. $\\delta_i(k) = f^\\prime(o_i(k-1)) \\sum\\limits_{j=1}^{N(k+1)} w_{ji}(k+1, k)\\delta_i(k+1)$\n",
"3. $\\delta_i(k) = f^\\prime(o_i(k-1)) \\sum\\limits_{j=1}^{N(k+1)} w_{ji}(k, k-1)\\delta_i(k+1)$"
"1. $\\delta_i(k) = f^\\prime(o_i(k)) \\sum\\limits_{j=1}^{N(k+1)} w_{ji}(k+1, k)o_i(k)$\n",
"2. $\\delta_i(k) = f^\\prime(o_i(k)) \\sum\\limits_{j=1}^{N(k+1)} w_{ji}(k+1, k)\\delta_i(k+1)$\n",
"3. $\\delta_i(k) = f^\\prime(o_i(k)) \\sum\\limits_{j=1}^{N(k+1)} w_{ji}(k, k-1)\\delta_i(k+1)$"
]
},
{
Expand Down Expand Up @@ -587,7 +587,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"The (first-order) Markov assumption means that state $s_{t+1}$ only depends on its predecessor state $s_t$ and the action $a_t$ performed then, i.e.: $s_{t+1} = \\delta(s_t, a_t)$. This allows to specify a $Q$-function of the form $Q(s_t,a_t)$, instead of $Q(s_0,a_0,\\ldots,s_t,a_t)$. The Markov assumption does not hold in situations where, e.g. the state does contain full information."
"The (first-order) Markov assumption means that state $s_{t+1}$ only depends on its predecessor state $s_t$ and the action $a_t$ performed then, i.e.: $s_{t+1} = \\delta(s_t, a_t)$. This allows to specify a $Q$-function of the form $Q(s_t,a_t)$, instead of $Q(s_0,a_0,\\ldots,s_t,a_t)$. The Markov assumption does not hold in situations where more information is needed than provided by the previous state. For example for sentence parsing with each word being a state the Markov assumption does not hold."
]
},
{
Expand Down

0 comments on commit 4ee916a

Please sign in to comment.