


















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
E Banking is closely associated with computer sciences. In these Lecture Slides, the lecturer has explained the following aspects of Banking : Widrow Hoff Learning, Adaline Network, Linear Neuron, Purelin, Input Neuron, Mean Square Error, Training Set, Notation, Mean Square Error, Square Error
Typology: Slides
1 / 26
This page cannot be seen from the preview
Don't miss anything!



















Docsity.co
R (^) x (^1)
S (^) x (^) R
S (^) x (^1)
S (^) x (^1)
S (^) x (^1)
(
)
=
=
a i^
purelin n
i
purelin
T
i
b i^
T
i
b i^
w i 1
,
w i 2
,
w i R ,
Docsity.co
Mean Square Error
1
1
{
,
}
,
,
,
Training Set:
q
q
Input:
Target:
1 b
=
a
T
=
F
(
)
E e
2 ]^
[
=
E
t
a
(
) 2 ]^
[
E
t
T
(
) 2 ]^
[
=
=
Notation:
Mean Square Error:
Docsity.co
Error Analysis
F
(
)
E e
2 ]^
[
=
E
t
a
(
) 2 ]^
[
E
t
T
(
) 2 ]^
[
=
=
F
(
)
E t
2
2 t
T
T
T
]
[
=
F
(
)
E t
2 ]^
2
T E^
t
[
]
T E^
T
[
]
[
F =
T
=
c
E t
2 ]^
[
=
E t
[
]
=
E
T
[
]
=
c
T
T
2
=
2
=
quadratic function: The mean square error for the ADALINE Network is a
Docsity.co
Approximate Steepest Descent
F ˆ
(
)
t k (
)
a k (
)
( ) 2 e 2 k
(
)
=
=
Approximate mean square error (one sample):
∇ˆ F^
(
)
e 2 k
( )
∇
=
e 2 k
j^
e 2 k
w 1 j
,
e k (
)
e k (
)
w 1 j
,
j
1 2
…
R
,
,
,
=
e 2
k
R
1
e 2 k
b
e k ( )
e k (
)
b
Approximate (stochastic) gradient:
Docsity.co
Approximate Gradient Calculation
e k (
)
w 1 j
,
t k (
)
a k (
)
w 1 j
,
w 1
j
,
t k (
)
T
1
k
e k (
)
w 1
j
,
w 1 j
,
t k (
)
w 1 i
, p i^ k
i
1
=^ ∑ R
b
e k ( )
w 1 j
,
p j^ k
e k (
)
b
∇ˆ F
(
)
e 2
k
( )
∇
2 e k (
)
k
(
)
=
=
Docsity.co
Multiple-Neuron Case
k
1
(
)
k
(
)
2 α e i^ k
(
)
k
(
)
=
b i^ k
1
(
)
b i^ k
(
)
2 α e i^ k
(
)
=
k
1
(
)
k
( )
2 α
k
(
)
T
k
(
)
=
k
1
(
)
k
( )
2 α
k
(
)
=
Matrix Form:
Docsity.co
Analysis of Convergence
k
1
k
2 α e k ( )
k
( )
=
E
k
1
[
]
E
k
[
]
2 α E e k
(
)
k
(
)
[
]
=
k
1
k
α
E t k
k
k T
k
k
k
1
k
α
E t
k^
k
k
T
k
k
E
k
1
[
]
E
k
[
]
{
}
=
E
k
1
[
] E
k
[
]
2 α
=
matrix must fall inside the unit circle.For stability, the eigenvalues of this
Docsity.co
Steady State Response
E
ss
[
] E
ss
[
]
2 α
=
ss
1
E
k
1
[
] E
k
[
]
2 α
=
If the system is stable, then a steady state condition will be reached.
The solution to this equation is
This is also the strong minimum of the performance index.
Docsity.co
Example
1
1
2
2
T
1
1 T
2
2 T
λ 1
λ 2
λ 3
=
,
=
,
=
α
λ max
Banana
Apple
Docsity.co
Iteration Two
Apple
a
1
2
e =
1
(
)
t 1
(
)
a
1
( ) t 2 a 1
(
)
1
(
)
=
=
=
=
T
Docsity.co
Iteration Three
a
2
1
e =
2
(
)
t 2
(
)
a
2
(
)
t 1
a
2
(
)
1
(
)
=
=
=
=
3
(
)
2
( ) 2 α e 2
(
)
T
2
(
)
1.1040 0.
=
=
∞
(
)
1 0 0
=
Docsity.co
Example: Noise Cancellation
Adaptive Filter
60-Hz
Noise Source
Noise Path
Filter
EEG Signal (random)
Contaminating
Noise
Contaminated
Signal
"Error"
Restored Signal
Adaptive Filter Adjusts to Minimize Error (and in doing this removes 60-Hz noise from contaminated signal)
Adaptively Filtered Noise to Cancel Contamination
Graduate Student
v
m
s
t
a
e
Docsity.co
SxR
1,
1,
1,
1,
Docsity.co