I'm reading sequential estimation section 2.3.5 PRML where Bishop introduces Robbins-Monro algorithm to calculate the root of $f(\theta) = E z | \theta = \int zp(z|\theta) dz, (z, \theta) \sim p(z, \theta)$.
The Robbins-Monro procedure then defines a sequence of successive estimates of the root $\theta^\star$ given by $$θ^{(N)} = θ^{(N−1)} + a_{N−1}z(θ^{(N−1)}) \tag{2.129}$$ where $z(θ^{(N)})$ is an observed value of $z$ when $θ$ takes the value $θ^{(N)}$. The coefficients $\{a_N\}$ represent a sequence of positive numbers that satisfy the conditions. (I skip the conditios since it does not help)
However, after some deduction and oberving the asypmtotic property of the equation of log likelihood (Equation 2.134), Bishop gives the procudure to estimate the parameters of normal distribution,
We can therefore apply the Robbins-Monro procedure, which now takes the form $$ θ^{(N)} = θ^{(N−1)} + a_{N−1}\frac{\partial}{\partial \theta^{(N-1)}}\ln p(x_N|\theta^{(N-1)}) \tag{2.135} $$ where $p(x|theta)$ is the normal density.
I'm confused that why it is $x_N$ but $x_{N-1}$. Does it be a typo or I didnot catch the idea of Robbins-Monro algorithm?
UPDATE
Another confusion arises that why the equation(2.129) does not integrate the the new observed data $x_N$ since I think the algorithm is similar to the gradient descent mothod.