# 5.1 Lms algorithm analysis

 Page 1 / 1

## Objective

Minimize instantaneous squared error

${e}_{k}(w)^{2}=({y}_{k}-{x}_{k}^Tw)^{2}$

## Lms algorithm

$({w}_{k})=({w}_{k-1})+\mu {x}_{k}{e}_{k}$
Where ${w}_{k}$ is the new weight vector, ${w}_{k-1}$ is the old weight vector, and $\mu {x}_{k}{e}_{k}$ is a small step in the instantaneous error gradient direction.

## Interpretation in terms of weight error vector

Define

${v}_{k}={w}_{k}-{w}_{\mathrm{opt}}$
Where ${w}_{\mathrm{opt}}$ is the optimal weight vector and
${\epsilon }_{k}={y}_{k}-{x}_{k}^T{w}_{\mathrm{opt}}$
where ${\epsilon }_{k}$ is the minimum error. The stochastic difference equation is:
${v}_{k}=I{v}_{k-1}+\mu {x}_{k}{\epsilon }_{k}$

## Convergence/stability analysis

Show that (tightness)

$\lim_{B\to }B\to$ v k B 0
With probability 1, the weight error vector is bounded for all $k$ .

Chebyshev's inequality is

$(({v}_{k})\ge B)\le \frac{(({v}_{k})^{2})}{B^{2}}$
and
$(({v}_{k})\ge B)=\frac{1}{B^{2}}((({v}_{k}))^{2}+\sigma({v}_{k})^2)$
where $(({v}_{k}))^{2}$ is the squared bias. If $(({v}_{k}))^{2}+\sigma({v}_{k})^2$ is finite for all $k$ , then $\lim_{B\to }B\to$ v k B 0 for all $k$ .

Also,

$\sigma({v}_{k})^2=\mathrm{tr}(({v}_{k}{v}_{k}^T))$
Therefore $\sigma({v}_{k})^2$ is finite if the diagonal elements of ${\Gamma }_{k}\equiv ({v}_{k}{v}_{k}^T)$ are bounded.

## Convergence in mean

$(({v}_{k}))\to 0$ as $k\to$ . Take expectation of using smoothing property to simplify the calculation. We haveconvergence in mean if

• ${R}_{\mathrm{xx}}$ is positive definite (invertible).
• $\mu < \frac{2}{{\lambda }_{\mathrm{max}}({R}_{\mathrm{xx}})}$ .

## Bounded variance

Show that ${\Gamma }_{k}=({v}_{k}{v}_{k}^T)$ , the weight vector error covariance is bounded for all $k$ .

We could have $({v}_{k})\to 0$ , but $\sigma({v}_{k})^2\to$ ; in which case the algorithm would not be stable.
Recall that it is fairly straightforward to show that the diagonal elements of the transformed covariance ${C}_{k}=U{\Gamma }_{k}U^T$ tend to zero if $\mu < \frac{1}{{\lambda }_{\mathrm{max}}({R}_{\mathrm{xx}})}$ ( $U$ is the eigenvector matrix of ${R}_{\mathrm{xx}}$ ; ${R}_{\mathrm{xx}}=UDU^T$ ). The diagonal elements of ${C}_{k}$ were denoted by ${\gamma }_{k,i}\forall i, i=\{1, \dots , p\}$ .
$\sigma({v}_{k})^2=\mathrm{tr}({\Gamma }_{k})=\mathrm{tr}(U^T{C}_{k}U)=\mathrm{tr}({C}_{k})=\sum_{i=1}^{p} {\gamma }_{k,i}$
Thus, to guarantee boundedness of $\sigma({v}_{k})^2$ we need to show that the "steady-state" values ${\gamma }_{k,i}\to ({\gamma }_{i})$ .

We showed that

${\gamma }_{i}=\frac{\mu (\alpha +{\sigma }_{\epsilon }^{2})}{2(1-\mu {\lambda }_{i})}$
where ${\sigma }_{\epsilon }^{2}=({\epsilon }_{k}^{2})$ , ${\lambda }_{i}$ is the ${i}^{\mathrm{th}}$ eigenvalue of ${R}_{\mathrm{xx}}$ ( ${R}_{\mathrm{xx}}=U\begin{pmatrix}{\lambda }_{1} & \dots & 0\\ ⋮ & \ddots & ⋮\\ 0 & \dots & {\lambda }_{p}\\ \end{pmatrix}U^T$ ), and $\alpha =\frac{c{\sigma }_{\epsilon }^{2}}{1-c}$ .
$0< c=\frac{1}{2}\sum_{i=1}^{p} \frac{\mu {\lambda }_{i}}{1-\mu {\lambda }_{i}}< 1$
We found a sufficient condition for $\mu$ that guaranteed that the steady-state ${\gamma }_{i}$ 's (and hence $\sigma({v}_{k})^2$ ) are bounded: $\mu < \frac{\frac{2}{3}}{\sum_{i=1}^{p} {\lambda }_{i}}$ Where $\sum_{i=1}^{p} {\lambda }_{i}=\mathrm{tr}({R}_{\mathrm{xx}})$ is the input vector energy.

With this choice of $\mu$ we have:

• convergence in mean
This implies
$\lim_{B\to }B\to$ v k B 0
In other words, the LMS algorithm is stable about the optimumweight vector ${w}_{\mathrm{opt}}$ .

## Learning curve

Recall that

${e}_{k}={y}_{k}-{x}_{k}^T{w}_{k-1}$
and . These imply
${e}_{k}={\epsilon }_{k}-{x}_{k}^T{v}_{k-1}$
where ${v}_{k}={w}_{k}-{w}_{\mathrm{opt}}$ . So the MSE
$({e}_{k}^{2})={\sigma }_{\epsilon }^{2}+({v}_{k-1}^T{x}_{k}{x}_{k}^T{v}_{k-1})={\sigma }_{\epsilon }^{2}+(({x}_{n}{\epsilon }_{n}\forall n, n< k, {v}_{k-1}^T{x}_{k}{x}_{k}^T{v}_{k-1}))={\sigma }_{\epsilon }^{2}+({v}_{k-1}^T{R}_{\mathrm{xx}}{v}_{k-1})={\sigma }_{\epsilon }^{2}+(\mathrm{tr}({R}_{\mathrm{xx}}{v}_{k-1}{v}_{k-1}^T))={\sigma }_{\epsilon }^{2}+\mathrm{tr}({R}_{\mathrm{xx}}{\Gamma }_{k-1})$
Where $(\mathrm{tr}({R}_{\mathrm{xx}}{\Gamma }_{k-1})\equiv {\alpha }_{k-1})\to (\alpha =\frac{c{\sigma }_{\epsilon }^{2}}{1-c})$ . So the limiting MSE is
${\epsilon }_{}$ k e k 2 σ ε 2 c σ ε 2 1 c σ ε 2 1 c
Since $0< c< 1$ was required for convergence, ${\epsilon }_{}$ σ ε 2 so that we see noisy adaptation leads to an MSE larger than the optimal
$({\epsilon }_{k}^{2})=(({y}_{k}-{x}_{k}^T{w}_{\mathrm{opt}})^{2})={\sigma }_{\epsilon }^{2}$
To quantify the increase in the MSE, define the so-called misadjustment :
$M=\frac{-{\epsilon }_{}}{}$ σ ε 2 σ ε 2 ε σ ε 2 1 α σ ε 2 c 1 c
We would of course like to keep $M$ as small as possible.

Fast adaptation and quick convergence require that we take steps as large as possible. In other words,learning speed is proportional to $\mu$ ; larger $\mu$ means faster convergence. How does $\mu$ affect the misadjustment?

To guarantee convergence/stability we require $\mu < \frac{\frac{2}{3}}{\sum_{i=1}^{p} {\lambda }_{i}({R}_{\mathrm{xx}})}$ Let's assume that in fact $\ll (\mu , \frac{1}{\sum_{i=1}^{p} {\lambda }_{i}})$ so that there is no problem with convergence. This condition implies $\ll (\mu , \frac{1}{{\lambda }_{i}})$ or $\ll (\mu {\lambda }_{i}, 1)\forall i, i=\{1, \dots , p\}$ . From here we see that

$\ll (c=\frac{1}{2}\sum_{i=1}^{p} \frac{\mu {\lambda }_{i}}{1-\mu {\lambda }_{i}}\approx \frac{1}{2}\mu \sum_{i=1}^{p} {\lambda }_{i}, 1)$
$M=\frac{c}{1-c}\approx c=\frac{1}{2}\mu \sum_{i=1}^{p} {\lambda }_{i}$
This shows that larger step size $\mu$ leads to larger misadjustment.

Since we still have convergence in mean, this essentially means that with a larger step size we "converge"faster but have a larger variance (rattling) about ${w}_{\mathrm{opt}}$ .

## Summary

small $\mu$ implies

large $\mu$ implies

${w}_{\mathrm{opt}}=\left(\begin{array}{c}1\\ 1\end{array}\right)$ $({x}_{k}, (0, \begin{pmatrix}1 & 0\\ 0 & 1\\ \end{pmatrix}))$ ${y}_{k}={x}_{k}^T{w}_{\mathrm{opt}}+{\epsilon }_{k}$ $({\epsilon }_{k}, (0, 0.01))$

## Lms algorithm

initialization ${w}_{0}=\left(\begin{array}{c}0\\ 0\end{array}\right)$ and ${w}_{k}={w}_{k-1}+\mu {x}_{k}{e}_{k}\forall k, k\ge 1$ , where ${e}_{k}={y}_{k}-{x}_{k}^T{w}_{k-1}$

can someone help me with some logarithmic and exponential equations.
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
Commplementary angles
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
is it 3×y ?
J, combine like terms 7x-4y
im not good at math so would this help me
yes
Asali
I'm not good at math so would you help me
Samantha
what is the problem that i will help you to self with?
Asali
how do you translate this in Algebraic Expressions
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!